COMPLEX TECHNICAL CONTROL SYSTEMS AND INFORMATION-CONTROL COMPLEXES Visiting Byzantine Agreement Underlying Ad Hoc Environment 1

The Mobile Ad Hoc Network (MANET) has become more popular because the MANET is a self- organizing, self-configuring, and an instantly deployable multi-hop wireless network that responds to applica- tion needs without any fixed infrastructure. Moreover, the MANET is fault-tolerant and reliable. A mechanism is needed in the MANET that allows a set of nodes to agree on a common value. The distributed Byzantine Agreement (BA) problem is one of the most important issues in designing a fault-tolerant system. In many cases, reaching a common agreement among fault-free nodes in coping with the influence from faulty compo- nents is crucial in a fault-tolerant system. When a common agreement is achieved, all fault-free nodes in the system can produce stable results without any influence from the faulty components. In this study, the BA prob- lem is visited in a MANET, in which the components are subject to a malicious fault. The proposed protocol can tolerate the maximum number of allowable faulty nodes using a minimum number of message exchange rounds. Each fault-free node can reach a common agreement value for the BA problem in a MANET.

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

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

[3]  Shu-Chin Wang,et al.  Optimal Agreement Protocol in Malicious Faulty Processors and Faulty Links , 1992, IEEE Trans. Knowl. Data Eng..

[4]  Zygmunt J. Haas,et al.  Determining the optimal configuration for the zone routing protocol , 1999, IEEE J. Sel. Areas Commun..

[5]  Gregory A. Hansen,et al.  The Optimized Link State Routing Protocol , 2003 .

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

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

[8]  D. R. Brough Logic Programming - New Frontiers , 1899 .

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

[10]  Charles E. Perkins,et al.  Ad Hoc Networking , 2001 .

[11]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[12]  Atsushi Iwata,et al.  Scalable routing strategies for ad hoc wireless networks , 1999, IEEE J. Sel. Areas Commun..

[13]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[14]  Ram Ramanathan,et al.  Making link-state routing scale for ad hoc networks , 2001, MobiHoc '01.

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

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