Abstract
The fault is inevitable in case of the wireless sensor network (WSN) because of its remote deployment and constrained architecture. In literature, many algorithms have been proposed to address several types of fault in the WSN life-cycle. In the context of fault tolerance, the clustering method has been adopted as a proven technique. Heintzelman et al. first considered the clustering technique and proposed the seminal low energy adaptive clustering hierarchy (LEACH) algorithm for fault handling in WSN. In this study, the authors propose a LEACH variant clustering convention called partitioned-based energy-efficient – LEACH (PE-LEACH) protocol which tends to the energy-based fault-tolerant technique. They also study and present a taxonomy on LEACH variants. The execution of PE-LEACH is analysed against its predecessors; hard-computing based LEACH, energy-efficient LEACH (E-LEACH) convention and soft-computing-based energy-swarm-optimisation LEACH (ESO-LEACH). They have found through their recreation that PE-LEACH outperforms than LEACH and E-LEACH separately whereas, for ESO-LEACH the PE-LEACH is a tough competitor.
Published Version (
Free)
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.
