On-line Fault Diagnosis for Distributed Communication Networks

This paper proposes an on-line two phase (TPD) fault diagnosis algorithm for distributed communication networks. Intermediate nodes communicate the messages between different source destination pairs. The algorithm addresses a realistic fault model considering crash and value faults in the nodes. The algorithm is shown to produce a time complexity of O(1) and message complexity of O(n.e) respectively. The results such as diagnostic latency, message complexity and energy consumption shows that the proposed diagnosis algorithm is feasible for design of different fault tolerant wired and wireless communication networks.

[1]  Douglas M. Blough,et al.  The Broadcast Comparison Model for On-Line Fault Diagnosis in Multicomputer Systems , 1999, IEEE Trans. Computers.

[2]  P.M. Khilar,et al.  An Energy Efficient Search in Dense Wireless Sensor Network , 2010, 2010 International Conference on Computational Intelligence and Communication Networks.

[3]  Miroslaw Malek,et al.  The consensus problem in fault-tolerant computing , 1993, CSUR.

[4]  Douglas M. Blough,et al.  Distributed diagnosis in dynamic fault environments , 2004, IEEE Transactions on Parallel and Distributed Systems.

[5]  Neeraj Suri,et al.  Formally Verified On-Line Diagnosis , 1997, IEEE Trans. Software Eng..

[6]  Meenakshi Panda,et al.  Learning with distributed data in wireless sensor network , 2010, 2010 First International Conference On Parallel, Distributed and Grid Computing (PDGC 2010).

[7]  Sudipta Mahapatra,et al.  A Novel Hierarchical Clustering Approach for Diagnosing Large Scale Wireless Adhoc Systems , 2009 .