Autonomous fault-diagnosis and decision-making algorithm for determining faulty nodes in distributed wireless networks

In this paper, we address fault-diagnosis agreement (FDA) problems in distributed wireless networks (DWNs) with arbitrary fallible nodes and healthy access points. We propose a new algorithm to reach an agreement among fault-free members about the faulty ones. The algorithm is designed for fully connected DWN and can also be easily adapted to partially connected networks. Our contribution is to reduce the bit complexity of the Byzantine agreement process by detecting the same list of faulty units in all fault-free members. Therefore, the malicious units can be removed from other consensus processes. Also, each healthy unit detects a local list of malicious units, which results in lower packet transmissions in the network. Our proposed algorithm solves FDA problems in 2t+1 rounds of packet transmissions, and the bit complexity in each wireless node is O(nt+1).

[1]  Adel Khosravi,et al.  Locating Malicious Links in Fully-Connected Networks Using a Formal Framework , 2011, 2011 21st International Conference on Systems Engineering.

[2]  He Chen,et al.  A novel mutual authentication and key agreement protocol based on NTRU cryptography for wireless communications , 2005 .

[3]  Amnon Barak,et al.  Efficient Algorithms for Anonymous Byzantine Agreement , 2008, Theory of Computing Systems.

[4]  Richard W. Buskens,et al.  Distributed on-line diagnosis in the presence of arbitrary faults , 1993, FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing.

[5]  Mao-Lun Chiang,et al.  Robustness improvement for mobile P2P network by the Byzantine Agreement problem , 2013, 2013 10th Annual Conference on Wireless On-demand Network Systems and Services (WONS).

[6]  Wei-Pang Yang,et al.  Reaching Fault Diagnosis Agreement under a Hybrid Fault Model , 2000 .

[7]  Michael Kevin Maggs,et al.  Consensus Clock Synchronization for Wireless Sensor Networks , 2012, IEEE Sensors Journal.

[8]  Shu-Chin Wang,et al.  Reaching a Fault Detection Agreement , 1990, ICPP.

[9]  Carlos Silvestre,et al.  Finite-time average consensus in a Byzantine environment using Set-Valued Observers , 2014, 2014 American Control Conference.

[10]  Azzedine Boukerche,et al.  An Adaptive Fault Identification Protocol for an Emergency/Rescue-Based Wireless and Mobile Ad-Hoc Network , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[11]  Mao-Lun Chiang,et al.  An early fault diagnosis agreement under hybrid fault model , 2009, Expert Syst. Appl..

[12]  Shu-Chin Wang,et al.  An optimal solution for byzantine agreement under a hierarchical cluster-oriented mobile ad hoc network , 2010, Comput. Electr. Eng..

[13]  Antonio Bicchi,et al.  Consensus Computation in Unreliable Networks: A System Theoretic Approach , 2010, IEEE Transactions on Automatic Control.

[14]  Shu-Chin Wang,et al.  Byzantine Agreement in a Generalized Connected Network , 1995, IEEE Trans. Parallel Distributed Syst..

[15]  Michael G. Rabbat,et al.  Broadcast Gossip Algorithms for Consensus on Strongly Connected Digraphs , 2012, IEEE Transactions on Signal Processing.

[16]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[17]  Nancy A. Lynch,et al.  A Lower Bound for the Time to Assure Interactive Consistency , 1982, Inf. Process. Lett..

[18]  Paul D. Ezhilchelvan,et al.  Consensus in Sparse, Mobile Ad Hoc Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.

[19]  Fernando C. Colón Osorio.  Using Byzantine Agreement in the Design Of IPS Systems , 2007, 2007 IEEE International Performance, Computing, and Communications Conference.

[20]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[21]  Béchir el Ayeb,et al.  A flexible formal framework for masking/demasking faults , 2004, Inf. Sci..