Distributed Fault Tolerant Algorithm for Identifying Node Failures in Wireless Sensor Networks
Navneet N Tewani1, Neeharika Ithapu2, K Raghava Rao3, Sheik Nissar Sami4, B. Sai Pradeep5,V.Krishna Deepak6
1Navneet N Tewani, Department of Electronics and Computer Engineering, K.L. University, Vijayawada (A.P), India.
2Neeharika Ithapu, Department of Electronics and Computer Engineering, K.L. University, Vijayawada (A.P), India.
3K.Raghava Rao, Professor, Department of Computing, K.L. University, Vijayawada (A.P), India.
4Sheik Nissar Sami, Department of Electronics and Computer Engineering, K.L. University, Vijayawada (A.P), India.
5B.Sai Pradeep, Department of Electronics and Computer Engineering, K.L. University, Vijayawada (A.P), India.
6V. Krishna Deepak, Department of Electronics and Computer Engineering, K.L. University, Vijayawada (A.P), India.
Manuscript received on 15 April 2013 | Revised Manuscript received on 22 April 2013 | Manuscript Published on 30 April 2013 | PP: 79-83 | Volume-2 Issue-5, April 2013 | Retrieval Number: E0669032413/13©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: A Wireless Sensor Network i s a s e t o f multiple connected components. Sometimes due to the failure of some of its nodes, the sensor network communication fails. So that we consider this problem of node(s) failure termed as “cut” from the remaining nodes of a wireless sensor network. We propose an algorithm that allows (i) every node to detect when the connectivity to a specially designated node has been lost, and (ii) one or more nodes (that are connected to the special node after the cut) to detect the occurrence of the cut. The algorithm we proposed is distributed and asynchronous i.e. every node needsto communicate with only those nodes that are within its communication range. The algorithm is based on the iterative computation of the nodes. The convergence rate of the underlying iterative scheme is independent of the size and structure of the network. In this algorithm we devised a way to solve the problem of redundant information at the destination which arises due to availability of information at every node that is initially sent from the source node. We demonstrate the effectiveness of the proposed algorithm through simulation.
Keywords: Cut, Iterative Computation, Redundancy, Simulation, Wireless Sensor Networks.
Scope of the Article: Heterogeneous Wireless Networks