New approach for mobile ad-hoc networks unity issue in a suspicious environment

This study investigates the problem of unity in a mobile ad-hoc network (MANET) when the members are suspected of having malicious faults. This study has reexamined the related Byzantine agreement (BA) problem for the new territory of MANET. The authors provide a new fault modelling approach followed by a new algorithm for the BA problem considering the limited connectivity of MANET. The proposed protocol results in a significant save in packet transmission counts for a fault-free member to reach an agreement in comparison with previous studies. Also, the minimum required network connectivity is reduced in this study to cover more network topologies. The proposed protocol also distinguishes faulty transmission media from a faulty processor which increases the maximum number of allowable faulty units in the network. Simulation results are provided to depict the applicability of the proposed protocol in mobile networks.

[1]  Mahtab Seddigh,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..

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

[3]  Shu-Chin Wang,et al.  Reaching fault diagnosis agreement on an unreliable general network , 2005, Inf. Sci..

[4]  Jonathan Katz,et al.  On Expected Constant-Round Protocols for Byzantine Agreement , 2006, CRYPTO.

[5]  Danny Dolev,et al.  Shifting Gears: Changing Algorithms on the Fly to Expedite Byzantine Agreement , 1992, Inf. Comput..

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

[7]  Jie Wu,et al.  Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links , 2002, IEEE Trans. Parallel Distributed Syst..

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

[9]  Martin Hirt,et al.  Efficient Byzantine Agreement with Faulty Minority , 2007, ASIACRYPT.

[10]  Wei-Pang Yang,et al.  A Note on Consensus on Dual Failure Modes , 1996, IEEE Trans. Parallel Distributed Syst..

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

[12]  Shu-Chin Wang,et al.  Byzantine Agreement & Fault Diagnosis Agreement in Dynamic Ad-Hoc Environment , 2009, Fundam. Informaticae.

[13]  Dhiraj K. Pradhan,et al.  Consensus With Dual Failure Modes , 1991, IEEE Trans. Parallel Distributed Syst..

[14]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[15]  Rick S. Blum,et al.  Theoretical analysis of an information-based quality measure for image fusion , 2008, Inf. Fusion.

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

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

[18]  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.

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

[20]  Shu-Chin Wang,et al.  Reaching Agreement among Virtual Subnets in Hybrid Failure Mode , 2008, IEEE Transactions on Parallel and Distributed Systems.

[21]  Wei-Pang Yang,et al.  Byzantine Agreement in the Presence of Mixed Faults on Processors and Links , 1998, IEEE Trans. Parallel Distributed Syst..

[22]  Piotr Berman,et al.  Bit optimal distributed consensus , 1992 .

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

[24]  Mao-Lun Chiang,et al.  The anatomy study of consensus agreement in MANETs , 2010, Comput. Electr. Eng..

[25]  Michael Okun,et al.  On the round complexity of Byzantine agreement without initial set-up , 2009, Inf. Comput..

[26]  K. Srinathan,et al.  Byzantine Agreement Using Partial Authentication , 2011, DISC.