Abstract
Aiming at all existing energy-hole repair algorithms for wireless sensor network must execute repeatedly in every round, energy-hole repair algorithm based on cluster (EHRA) is proposed in this paper. Before any common node is about to die because of exhaustion of energy, it sends failure message to its cluster head, and the cluster head activates suitable redundant node which is in the sensing range of failure node and has the most energy-hole boundary nodes as neighbor nodes. Simulations present that the performance of EHRA is related to sensing radius of nodes and the size of cluster, while EHRA has an advantage over 3MeSH in coverage keeping, energy consumption and time consumption.
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 callDisclaimer: 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.
