Distributed fault detection and recovery algorithms in two-tier wireless sensor networks Online publication date: Wed, 18-May-2016
by Kumar Nitesh; Prasanta K. Jana
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 16, No. 3, 2016
Abstract: Failure of relay nodes in a cluster-based WSN is catastrophic as they act as cluster heads that are responsible for collecting sensed data, aggregate them and send to a sink. Therefore, fault tolerance of relay nodes is an important issue in cluster based WSNs. In this paper, we present a distributed algorithm to detect faulty relay nodes with O(m) message complexity where m is the number of relay nodes. It is shown that the proposed algorithm can detect any relay node with transient or permanent fault based on neighbouring table information. We also propose a distributed algorithm for local recovery of the member sensor nodes of a failed relay node with message exchange complexity of O(n) where n is the number of sensor nodes. The proposed algorithms are simulated extensively using Weibull distribution under several scenarios of WSN and compared with existing algorithms to show its superiority.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Communication Networks and Distributed Systems (IJCNDS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook