Optimal Node Clustering and Scheduling in Wireless Sensor Networks

Selection and rotation of cluster head (CH) is a well known optimization problem in hierarchical Wireless sensor networks (WSNs), which affects its overall network performance. Population-based metaheuristic particularly Artificial bee colony (ABC) has shown to be competitive over other metaheuristics for solving optimization problems in WSNs. However, its search equation contributes to its insufficiency due to poor exploitation phase and low convergence rate. This paper, presents an improved artificial bee colony (iABC) metaheuristic with an improved search equation, which will be able to search an optimal solution to improve its exploitation capabilities moreover, in order to increase the global convergence of the proposed metaheuristic, an improved approach for population sampling is introduced through Student’s-t distribution. The proposed metaheuristic maintain a balance between exploration and exploitation search abilities with least memory requirements, with the use of first of its kind compact Student’s-t distribution, which is particularly suitable for WSNs limited hardware environment. Further utilising the capabilities of the proposed metaheuristic, an improved artificial bee colony based clustering and scheduling (iABC-CS) scheme is introduced, to obtain optimal cluster heads (CHs) along with optimal CH scheduling in WSNs. Simulation results manifest that iABC-CS outperform over other well known clustering algorithms on the basis of packet delivery ratio, energy consumption, network lifetime and end to end delay.