This Article 
 Bibliographic References 
 Add to: 
Reaching Agreement among Virtual Subnets in Hybrid Failure Mode
September 2008 (vol. 19 no. 9)
pp. 1252-1262
Fault-tolerance is an important research topic in the study of distributed systems. To cope with the influence of faulty components, reaching a common agreement in the presence of faults before performing certain tasks is essential. However, the Byzantine Agreement (BA) problem is a fundamental problem in fault-tolerant distributed systems. In previous studies, protocols dealing with the BA problem focused on static networks; however, these do not perform well in dynamically changing mobile networks. The most well known mobile network is the Mobile Ad-hoc Network (MANET). To enhance fault-tolerance and MANET reliability, the BA problem in virtual subnets of MANET is revisited in this paper. The proposed protocol is called the Hybrid Agreement Protocol (HAP). It achieves agreement on a common value among all functional mobile processors in a minimal number of message exchange rounds, and can tolerate a maximal number of allowable faulty components in the virtual subnet of MANET.

[1] M. Barborak, M. Malek, and A. Dahbura, “The Consensus Problem in Fault Tolerant Computing,” ACM Computing Surveys, vol. 25, no. 2, pp. 171-220, 1993.
[2] A. Bar-Noy et al., “Shifting Gears: Changing Algorithms on the Fly to Expedite Byzantine Agreement,” Proc. Symp. Principles of Distributed Computing, pp. 42-51, 1987.
[3] R. Beraldi, “The Polarized Gossip Protocol for Path Discovery in MANETs,” Ad Hoc Networks, vol. 6, no. 1, pp. 79-91, Jan. 2008.
[4] T.C. Chiang, H.M. Tsai, and Y.M. Huang, “A Partition Network Model for Ad Hoc Networks,” Proc. IEEE Int'l Conf. Wireless and Mobile Computing, Networking and Comm., vol. 3, pp. 467-472, 2005.
[5] P. Dasgupta, “Agreement under Faulty Interfaces,” Information Processing Letters, vol. 65, pp. 25-129, 1998.
[6] M. Fischer, “The Consensus Problem in Unreliable Distributed Systems (A Brief Survey),” technical report, Dept. Computer Science, Yale Univ., 2000.
[7] D.K. Gifford, “Weighted Voting for Replicated Data,” Technical Report CSL-79-14, XEROX Palo Alto Research Center, 1979.
[8] F. Halsall, Data Links, Computer Networks and Open Systems, fourth ed. Addison-Wesley, 1995.
[9] H. Jun, W. Zhao, M.H. Ammar, E.W. Zegura, and C. Lee, “Trading Latency for Energy in Densely Deployed Wireless Ad Hoc Networks Using Message Ferrying,” Ad Hoc Networks, vol. 5, no. 4, pp. 444-461, May 2007.
[10] M. Kumar, L. Schwiebert, and M. Brockmeyer, “Efficient Data Aggregation Middleware for Wireless Sensor Networks,” Proc. IEEE Int'l Conf. Mobile Ad-Hoc and Sensor Systems, pp. 561-579, 2005.
[11] L. Lamport, R. Shostak, and M. Pease, “The Byzantine General Problem,” ACM Trans. Programming Language and Systems, vol. 4, no. 3, pp. 382-401, 1982.
[12] B. Lehane and L. Doyle, “Shared RSA Key Generation in a Mobile Ad Hoc Network,” Proc. IEEE Conf. Military Comm., vol. 2, pp. 814-819, 2003.
[13] F.J. Meyer and D.K. Pradhan, “Consensus with Dual Failure Modes,” IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 2, pp. 214-222, 1991.
[14] M. Min, F. Wang, D.Z. Du, and P.M. Pardalos, “A Reliable Virtual Backbone Scheme in Mobile Ad-Hoc Networks,” Proc. IEEE Int'l Conf. Mobile Ad-Hoc and Sensor Systems, pp. 60-69, 2004.
[15] M. Pease, R. Shostak, and L. Lamport, “Reaching Agreement in Presence of Faults,” J. ACM, vol. 27, no. 2, pp. 228-234, 1980.
[16] A. Silberschatz, P.B. Galvin, and G. Gagne, Operating System Concepts, sixth ed. John Wiley & Sons, 2002.
[17] H.S. Siu, Y.H. Chin, and W.P. Yang, “A Note on Consensus on Dual Failure Modes,” IEEE Trans. Parallel and Distributed System, vol. 7, no. 3, pp. 225-230, 1996.
[18] J.A. Stine and G. Veciana, “A Paradigm for Quality-of-Service in Wireless Ad Hoc Networks Using Synchronous Signaling and Node States,” IEEE J. Selected Areas in Comm., vol. 22, no. 7, pp.301-321, Sept. 2004.
[19] Y.C. Tseng, C.S. Hsu, and T.Y. Hsieh, “Power-Saving Protocols for IEEE 802.11-Based Multi-Hop Ad Hoc Networks,” Computer Networks, vol. 43, no. 3, pp. 317-337, Oct. 2003.
[20] S.C. Wang, K.Q. Yan, and G.Y. Zheng, “Reaching Consensus Underlying Fallible Virtual Subnet of Mobile Ad-Hoc Network,” Proc. 12th Mobile Computing Workshop, pp. 257-263, 2006.
[21] S.C Wang, K.Q. Yan, and C.F. Cheng, “Asynchronous Consensus Protocol for the Unreliable Unfully Connected Network,” ACM Operating Systems Rev., vol. 37, no. 3, pp. 43-54, 2003.
[22] J.H. Wesley et al., “SIFT: Design and Analysis of a Fault-Tolerant Computer for Aircraft Control,” Proc. IEEE, vol. 10, pp. 1240-1255, 1978.
[23] S.L. Wu, P.C. Tseng, and Z.T. Chou, “Distributed Power Management Protocols for Multi-Hop Mobile Ad Hoc Networks,” Computer Networks, vol. 47, no. 1, pp. 63-85, Jan. 2005.
[24] K.Q. Yan and S.C Wang, “Group Byzantine Agreement,” Computer Standards & Interfaces, vol. 28, no. 1, pp. 75-92, July 2005.

Index Terms:
Byzantine agreement, fault-tolerance, distributed system, parallel processing, virtual subnet, mobile ad-hoc network
S.-C. Wang, K.-Q. Yan, S.-S. Wang, G.-Y. Zheng, "Reaching Agreement among Virtual Subnets in Hybrid Failure Mode," IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 9, pp. 1252-1262, Sept. 2008, doi:10.1109/TPDS.2007.70819
Usage of this product signifies your acceptance of the Terms of Use.