An algorithm for energy driven cluster head rotation in a distributed wireless sensor network

Abstract

Wireless sensor networks (WSNs) consists of large number of inexpensive, low-power, sensors that can be placed in an ad hoc fashion to form a communication network. Efficient techniques for inter sensor communication and information gathering is critical for prolonging the lifetime of the sensor network. Clustering provides an effective way for extending the lifetime of a sensor network. In this paper we propose a distributed and energy driven clustering algorithm where the cluster heads are selected based on relative residual energy level of sensors. Furthermore the cluster head candidacy selection phase, and the cluster head candidacy rotation among phases is triggered only when any of cluster heads energy drops below a dynamic threshold computed by the algorithm. As a result, the overheads in the inter sensor communications will be reduced and thereby the proposed algorithm will favor more powerful nodes over the weaker ones to prolong the lifetime of the entire sensor network in both homogeneous and heterogeneous sensor networks. The results have shown that the the proposed algorithm performs better when compared to existing algorithms such as LEACH, SEP, HEED and ANTCLUST based on the Percentage Node Alive (PNA) and the First Node Dies (FND) metrics.