Research Article
Maximizing Lifetime of Wireless Sensor Network through Extended LEACH Algorithm
@INPROCEEDINGS{10.1007/978-3-642-27317-9_39, author={Indrajit Bhattacharya and Saurav Ghosh and Suparna Kundu}, title={Maximizing Lifetime of Wireless Sensor Network through Extended LEACH Algorithm}, proceedings={Advances in Computer Science and Information Technology. Computer Science and Information Technology. Second International Conference, CCSIT 2012, Bangalore, India, January 2-4, 2012. Proceedings, Part III}, proceedings_a={CCSIT PART III}, year={2012}, month={11}, keywords={Wireless Sensor Network Cluster-head probability LEACH lifetime Last Node Dies (LND)}, doi={10.1007/978-3-642-27317-9_39} }- Indrajit Bhattacharya
Saurav Ghosh
Suparna Kundu
Year: 2012
Maximizing Lifetime of Wireless Sensor Network through Extended LEACH Algorithm
CCSIT PART III
Springer
DOI: 10.1007/978-3-642-27317-9_39
Abstract
Wireless Sensor Networks (WSNs) represent a new generation of real-time embedded systems that can be applied to ample of real life applications. LEACH is one of the most popular clustering mechanism in WSN; it elects a cluster head (CH) based on a probability model and rotates the cluster heads periodically to preserve maximum network coverage and lifetime. In our work we extend the LEACH’s cluster head selection algorithm in WSN based on different node characteristics like, density, centrality and energy. This paper focuses on increasing the lifetime of wireless sensor networks. Appropriate cluster head selection strategy can enhance the lifetime of the network. In our work we have modified the probability calculation formula for selecting the cluster heads in each round based on three parameters of a node: density, centrality and remaining energy in the network. Simulation results demonstrate that extension of LEACH algorithm can enlarge the lifetime of the Wireless Sensor Network.
