Improvement of LEACH routing algorithm based on use of balanced energy in wireless sensor networks

15Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Based on the analysis of LEACH routing algorithm, this paper proposes a novel clustering algorithm(I-LEACH) which selects cluster heads according to the node's residual energy and distance with other cluster heads. In addition, the clusters send data to the base station by means of combination of single hop and multi-hop manner for saving cluster heads' energy. Simulation results show that compared with LEACH and P-LEACH, the improved algorithm can balance energy consumption among nodes, reduce the energy consumption and prolong the lifetime of the networks. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Chen, J. (2011). Improvement of LEACH routing algorithm based on use of balanced energy in wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6838 LNCS, pp. 71–76). https://doi.org/10.1007/978-3-642-24728-6_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free