Distributed Algorithm for Fast Detecting the Failure Nodes Chronicles

International Journal of Computer Trends and Technology (IJCTT)          
© - Issue 2013 by IJCTT Journal
Volume-4 Issue-2                           
Year of Publication : 2013
Authors :Venkat Rao Kommuri, Nagul Shaik, Anil Kumar Dasari.


Venkat Rao Kommuri, Nagul Shaik, Anil Kumar Dasari."Distributed Algorithm for Fast Detecting the Failure Nodes Chronicles"International Journal of Computer Trends and Technology (IJCTT),V4(2):112-115 Issue 2013 .ISSN 2231-2803.www.ijcttjournal.org. Published by Seventh Sense Research Group.

Abstract: -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.


[1] X. Cao and X. Guo, "Partially Observable Markov Decision Processes With Reward Information: Basic Ideas and Models," IEEE Transactions on Automatic Control, vol.52, no.4, Apr. 2007, pp.677-681
[2] J. Lessmann, T. Heimfarth, P. Janacik, “ShoX: An Easy to Use Simulation Platform for Wireless Networks,” Proc. of 10th International Conference on Computer Modeling and Simulation, 2008, pp. 410-415.
[3] A.T. Erman, L. Hoesel and P. Havinga, “Enabling Mobility in Heterogeneous Wireless International Journal of Computer Trends and Technology- volume4Issue2- 2013
Sensor Networks Cooperating with UAVs for Mission-Critical Management,” IEEE Wireless Communications, vol. 15, is. 6, 2008, pp. 38-46.
[4] M. Hauspie, J. Carle, and D. Simplot, “Partition Detection in Mobile Ad-Hoc Networks,” Proc. Second Mediterranean Workshop Ad-Hoc Networks, pp. 25-27, 2003.

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