Abstract
Given the inherent limitations of sensor nodes in wireless sensor networks (WSNs) such as energy limitation and since sensor nodes are distributed in harsh environments in the majority of WSN applications, the probability of their failure is high. Hence, nodes’ failure for any reason is regarded as a challenge for these networks which has a negative impact on the efficiency of the entire network. Consequently, for achieving appropriate performance in important applications, faulty nodes should be detected and removed from network. Detection of faulty nodes in these networks is considered to be an NP-hard problem. Thus, meta-heuristic algorithms are used for solving this problem. Given the significance of this issue, a model based on harmony search algorithm (HSA) is proposed in this paper for detecting faulty nodes. In this model, for doing so, each memory vector in the HSA includes energy and correlation between neighbor nodes data. The results of simulation indicated that the proposed model is more efficient than other methods and is able to optimize detection precision rate, packet delivery rate and remaining energy.
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.
