Failure node detection and recovery in wireless sensor networks

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

Abstract

A Wireless Sensor Network may often consist of hundreds of distributed sensors. Our goal is to formulate wireless sensor networks (WSNs) fault identification problem in terms of pattern classification and to introduce a newly developed algorithm, neighbor node hidden conditional algorithm (NHCA) to determine the unknown path through which packets are transmitted from source to destination. We propose a concept of fault recovery in WSN using clustering. This includes the protocols of Dynamic Delegation based Efficient Broadcast and Neighborhood Hidden Conditional Random Field Algorithm. The history of transmission is classified according to the pattern, sorted and ranked along with the cluster information. The data privacy is maintained with in the cluster during the packet transmission apart from the destination which may present outside the cluster. The leader of the cluster is restricted only to view the transmission path in order to maintain the confidentiality of the data transmitted. Our simulation results strongly enforce fault recovery in quick time and also maintain the confidentiality of data.

Cite

CITATION STYLE

APA

John Justin Thangaraj, S., Rajesh Khanna, M., & Balamanigandan, R. (2019). Failure node detection and recovery in wireless sensor networks. International Journal of Innovative Technology and Exploring Engineering, 8(12), 5226–5230. https://doi.org/10.35940/ijitee.L2793.1081219

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