Abstract
Adaptations have been key to the development and advancement of the low energy adaptive clustering hierarchy (LEACH) protocol. Presented is an alteration to the traditional LEACH, low energy adaptive clustering hierarchy, algorithm. This algorithm focuses on the battery life optimization of sensors within a wireless sensor network (WSN). These sensors will be grouped into clusters with the aim of maximizing the battery life of the overall system by sorting each sensor by residual energy and assigning the highest residual energy the role of cluster head. The protocol will then assign sensors to cluster heads based on distance relative to the head. This algorithm achieves the goal of extending battery life and offers itself as a promising alternative to standard LEACH algorithms. The algorithm is tested by comparing sensor battery life, total sensors communicating at a given time, and sensors with residual energy. This paper addresses the strengths and vulnerabilities of the algorithm, as well as proposed work for further implementation for the following groups looking to create their own LEACH protocol.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Electrical and Computer Engineering (IJECE)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
