Premium
A novel approach for particle swarm optimization‐based clustering with dual sink mobility in wireless sensor network
Author(s) -
Kaur Supreet,
Grewal Vinit
Publication year - 2020
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.4553
Subject(s) - computer science , wireless sensor network , particle swarm optimization , cluster analysis , scalability , energy consumption , sink (geography) , centrality , ant colony optimization algorithms , computer network , distributed computing , artificial intelligence , machine learning , ecology , cartography , mathematics , combinatorics , database , biology , geography
Summary The proliferation in the sensing technology in wireless sensor network has left an everlasting impact to revolutionize every sector of human's lives. The limited battery of sensor nodes (SNs) has generated a tremendous challenge for the researchers to ameliorate the network's life span. To pacify this concern, in this paper, we have proposed a particle swarm optimization (PSO)‐based dual sink mobility (PSODSM) technique to reduce the energy expenditure of the SNs. PSODSM has the paramount focus on the cluster head (CH) selection based on integration of crucial factors: “ratio of remaining energy to the initial energy,” node degree, node centrality, separation factor between the SN and the sink, CH number, and energy consumption rate. As soon as the CHs are selected, two sinks placed opposite to each other are made to move towards the selected CHs for data collection. The most prominent fact is the movement of sinks which is done outside the periphery of the network to collect data rather than the reported conventional research works that employ sink mobility inside the network. Extensive simulations are performed to examine the empirical evaluation of PSODSM based on the benchmark of different performance metrics. The performance validation of PSODSM is done against the other meta‐heuristic algorithms, and findings show that the PSODSM outperforms the competitive algorithms and is also found to be scalable pertaining to real time implementation.