Energy-Efficient Distributed Clustering Algorithm Based on Coverage

In the field of wireless sensor network, it is one of the hottest issues of current research that how to maintain the quality of network coverage and balance nodes´ energy consumption to optimize the network lifetime. This paper analyzed LEACH (low energy adaptive clustering hierarchy) and proposed an energy-efficient distributed clustering algorithm on coverage (ECAC). In the algorithm, the redundancy degree of coverage and node´s rest energy are considered. Moreover, the distribution of cluster head is more reasonable. Simulation results show that: the improved algorithm can efficiently reduce the network energy consumption and improve the quality of coverage.