To search, Click below search items.

 

All Published Papers Search Service

Title

Distributed Algorithm for Fast Detecting the Failure Nodes Chronicles

Author

VENKAT RAO KOMMURI, NAGUL SHAIK, ANIL KUMAR DASARI

Citation

Vol. 14  No. 2  pp. 135-138

Abstract

The Distributed Cut Detection algorithm we propose here enables every node of a wireless sensor network to detect Disconnected from Source events if they occur. Second, it enables a subset of nodes that experience CCOS events to detect them and estimate the approximate location of the cut in the form of a list of active nodes that lie at the boundary of the cut/hole. The DOS and CCOS events are defined with respect to a specially designated source node. The algorithm is based on ideas from electrical network theory and parallel iterative solution of linear equations. Numerical simulations, as well as experimental evaluation on a real Wireless Sensor Networks system consisting of micaZ motes, show that the algorithm works effectively with large classes of graphs of varying size and structure, without requiring changes in the parameters. For certain scenarios, the algorithm is assured to detect connection and disconnection to the source node without error. A key strength of the DCD algorithm is that the convergence rate of the underlying iterative scheme is quite fast and independent of the size and structure of the network, which makes detection using this algorithm quite fast.

Keywords

Application, Cut, Detection, Electrical, Fast, Network, Nodes, Parameter, Research, Wireless network

URL

http://paper.ijcsns.org/07_book/201402/20140220.pdf