An algorithm for electing cluster heads based on maximum residual energy
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Energy efficient clustering communication protocol for wireless sensor network
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Wireless sensor network design for tactical military applications: remote large-scale environments
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
A resource reuse method in cluster sensor networks in ad hoc networks
ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II
| Hi-index | 0.00 |
A wireless network consisting of a large number of small sensors with limited battery power can be an effective tool for gathering data in a variety of environments. Clustering sensors into groups, so that sensors communicate information only to cluster-heads and then the cluster-heads communicate the aggregated information to the base station, may save energy. In this paper, we propose an optimal energyadaptive clustering algorithm which is motivated from the LEACH protocol presented in [4]. We optimize LEACH's random cluster-head selection algorithm to ensure the balanced energy depletion over the whole network thus prolongs the network lifetime. Simulation results show that our algorithm outperforms LEACH by about 20% to 35% when 1%, 50%, 100% of nodes die for different network sizes and topologies.