Clustering routing based maximizing lifetime for wireless sensor networks

Abstract

In order to prolong the networks lifetime, an effective routing protocol is needed to design to adapt the characteristic of the limited energy in Wireless sensor networks. We present a novel algorithm, that is, Low Energy Adaptive Clustering Hierarchy-Energy Distance(LEACH-ED) based on the residual energy of sensor nodes and the distance of any two cluster heads. Compared with the classical clustering algorithm LEACH and extended LEACH, it uniforms the clustering and balances the network load by considering the residual energy of nodes and the distances' restrained factor between two cluster heads, so that extend the networks lifetime. Meantime, it also takes the acreage of area and the number of nodes into account and analyses their impacts on performance of networks. As a result of simulation, we have confirmed that LEACH-ED shows the better performance in terms of lifetime than LEACH and LEACH-C.