Distributed Algorithm for Fast Detecting the Failure Nodes Chronicles

摘要

with the fast transferring the data some of the nodes will not working while transferring the information that is called the cut. To avoid this problem one of the algorithm is proposed and we have to demonstrate that algorithm Cut Detection algorithm in that algorithm enables every node of a wireless sensor network to detect Disconnected from Source events if they occur. 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. Defined with respect to a specially designated source node. The algorithm is based 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.