Improved election of cluster heads in LEACH

Abstract

Abstract-Wireless Sensor Networks (WSNs) are a promising technology to monitor distant or inaccessible areas. As nodes have a limited energy supply, many routing protocols are based on a clustering mechanism: some nodes are elected as cluster heads and have to deal with most of the communication burden of the network, while the other nodes perform only simple operations. In this paper, we propose a new election mechanism with important features: it ensures that all nodes are in range of a cluster head while keeping the number of cluster heads low, it takes into account the residual energy of nodes, and it requires a small communication overhead. We compare the performance of our election mechanism with an optimal election, as well as with the election mechanism of LEACH, which is the main clustering algorithm for WSNs.