Energy-efficient uniform clustering algorithm for wireless sensor networks

The efficient subdivision of a sensor network into uniform clusters of physically close nodes is an important building block in the design of efficient upper layer network functions such as routing, broadcast, data aggregation, and query processing. This paper analyzes a low energy adaptive clustering hierarchy (LEACH) in terms of the optimum number of clusters and demonstrates through simulation that the optimum number calculated are not suitable for sensor networks including large number of nodes or covering large area. Based on the analysis results, we give a new formula of calculating the optimum number of clusters on an improved data gathering model. To decrease the energy dissipation further, we develop a new efficient uniform clustering algorithm in ad-hoc sensor networks. Simulation results show that it achieves fairly uniform cluster-head distribution across the network.