Distributed Energy Balance Clustering Algorithm in Wireless Sensor Networks

The traditional clustering algorithm of Low-Energy Adaptive Clustering Hierarchy (LEACH) does not care about the residual energy of the cluster heads and the distance relationship of each node in the wireless sensor networks (WSNs). Each new round the cluster head is changed without any concern about the residual energy of the current cluster head, and the nodes join into a new cluster head without concern about the distance factor and the residual energy factor of all nodes in WSNs. To solve these problems in LEACH, this paper puts forward a distributed energy balance clustering algorithm, which takes into full consideration the residual energy of the cluster heads and the distance relationship between the base station and the cluster heads. The experimental results indicate that the proposed distributed energy balance clustering algorithm can prolong the lifetime of the networks more than LEACH, and the number of messages for selecting a new cluster head at the same time can be greatly reduced, which proves it as more suitable for practical applications.