The Community for Technology Leaders
Subscribe
Issue No.06 - June (2009 vol.20)
pp: 753-765
Weigang Wu , Sun Yat-sen University, Guangzhou
Jiannong Cao , Hong Kong Polytechnic University, Hong Kong
Michel Raynal , IRISA, Campus de Beaulieu, Université de Rennes, France
ABSTRACT
This paper proposes a modular approach to the design of hierarchical consensus protocols for the mobile ad hoc network with a static and known set of hosts. A two-layer hierarchy is imposed on the network by grouping mobile hosts into clusters, each with a clusterhead. The messages from and to the hosts in the same cluster are merged/unmerged by the clusterhead so as to reduce the message cost and improve the scalability. The proposed modular approach separates the concerns of clustering hosts from achieving consensus. A clustering function, called eventual clusterer (denoted as \diamondC), is designed for constructing and maintaining the two-layer hierarchy. Similar to unreliable failure detectors, \diamondC greatly facilitates the design of hierarchical protocols by providing the fault-tolerant clustering function transparently. We propose an implementation of \diamondC based on the failure detector \diamondS. Using \diamondC, we design a new hierarchical consensus protocol. As shown by the performance evaluation results, the proposed consensus protocol can save both message cost and time cost. Our proposed modular design is therefore effective and can lead to efficient solutions to achieving consensus in mobile ad hoc networks.
INDEX TERMS
Consensus, mobile ad hoc network, mobile computing, distributed algorithm, failure detector, fault tolerance.
CITATION
Weigang Wu, Jiannong Cao, Michel Raynal, "Eventual Clusterer: A Modular Approach to Designing Hierarchical Consensus Protocols in MANETs", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 6, pp. 753-765, June 2009, doi:10.1109/TPDS.2008.266
REFERENCES
 [1] N. Badache, M. Hurfin, and R. Macedo, “Solving the Consensus Problem in a Mobile Environment,” Proc. IEEE Int’l Performance, Computing, and Comm. Conf. (IPCCC), 1999. [2] B. Badrinath, A. Acharya, and T. Imielinski, “Designing Distributed Algorithms for Mobile Computing Networks,” Computer Comm., vol. 19, no. 4, Apr. 1996. [3] R. Baldoni, J. Helary, and S. Tcci-Piergio, “Group Communication in Ad-Hoc Networks: A Few Results and a Case Study,” Proc. IEEE Int’l Conf. Pervasive Services (ICPS '05), July 2005. [4] M. Ben-Or, “Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols,” Proc. ACM Symp. Principles of Distributed Computing Systems (PODC), 1983. [5] T. Camp, J. Boleng, and V. Davies, “A Survey of Mobility Models for Ad Hoc Network Research,” Wireless Comm. and Mobile Computing (WCMC '02), vol. 2, no. 5, pp.483-502, 2002. [6] D. Cavin, Y. Sasson, and A. Schiper, “Consensus with Unknown Participants or Fundamental Self-Organization,” Proc. Conf. Ad Hoc Networks and Wireless (ADHOC-NOW '04), July 2004. [7] T. Chandra, V. Hadzilacos, and S. Toueg, “The Weakest Failure Detector for Solving Consensus,” J. ACM, vol. 43, no. 4, July 1996. [8] T. Chandra and S. Toueg, “Unreliable Failure Detectors for Reliable Distributed Systems,” J. ACM, vol. 43, no. 2, Mar. 1996. [9] G. Chockler, M. Demirbas, S. Gilbert, C.C. Newport, and T. Nolte, “Consensus and Collision Detectors in Wireless Ad Hoc Networks,” Proc. Conf. Principles of Distributed Computing (PODC '05), July 2005. [10] F. Chu, “Reducing Ω to $\diamond W$ ,” Information Processing Letters, vol. 67, no. 6, 1998. [11] G. Coulouris, J. Dollimore, and T. Kindberg, Distributed Systems: Concepts and Design, third ed. Addison-Wesley, 2001. [12] D. Dolev, R. Friedman, I. Keidar, and D. Malkhi, “Failure Detectors in Omission Failure Environments,” Technical Report TR96-1608, Dept. of Computer Science, Cornell Univ., Sept. 1996. [13] P. Dutta and R. Guerraoui, “Fast Indulgent Consensus with Zero Degradation,” Proc. Fourth European Dependable Computing Conf. (EDCC), 2002. [14] H. Elaarag, “Improving TCP Performance over Mobile Networks,” ACM Computing Surveys, vol. 34, no. 3, Sept. 2002. [15] P. Ezhilchelvan, A. Mostefaoui, and M. Raynal, “Randomized Multivalued Consensus,” Proc. Fourth IEEE Int'l Symp. Object-Oriented Real-Time Computing, May 2001. [16] M. Fischer, N. Lynch, and M. Paterson, “Impossibility of Distributed Consensus with One Faulty Process,” J. ACM, vol. 32, no. 2, Apr. 1985. [17] G. Forman and J. Zahorjan, “The Challenges of Mobile Computing,” Computer, vol. 27, no. 4, pp.38-47, Apr. 1994. [18] F. Greve and S. Tixeuil, “Knowledge Connectivity versus Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks,” Proc. Dependable Systems and Networks (DSN '07), June 2007. [19] R. Guerraoui, M. Huifin, A. Mostefaoui, R. Oliveira, M. Raynal, and A. Schiper, “Consensus in Asynchronous Distributed Systems: A Concise Guided Tour,” Lecture Notes in Computer Science, vol. 1752, 2000. [20] R. Guerraoui and A. Schiper, “Consensus: The Big Misunderstanding,” Proc. Sixth IEEE Workshop Future Trends of Distributed Computing Systems, 1997. [21] R. Gueraoui and A. Schiper, “The Generic Consensus Service,” IEEE Trans. Software Eng., vol. 27, no. 1, pp.29-41, Jan. 2001. [22] M. Hurfin, A. Mostefaoui, and M. Raynal, “A Versatile Family of Consensus Protocols Based on Chandra-Toueg's Unreliable Failure Detectors,” IEEE Trans. Computers, vol. 51, no. 4, pp.395-408, Apr. 2002. [23] M. Hurfin and M. Raynal, “A Simple and Fast Asynchronous Consensus Protocol Based on a Weak Failure Detector,” Distributed Computing, vol. 12, no. 4, Sept. 1999. [24] D. Johnson and D. Maltz, Dynamic Source Routing in Ad Hoc Wireless Networks, Mobile Computing, chapter 5. Kluwer Academic Publishers, 1996. [25] L. Lamport, “The Part-Time Parliament,” ACM Trans. Computer Systems, vol. 16, no. 2, 1998. [26] M. Larrea, A. Fernandez, and S. Arevalo, “On the Implementation of Unreliable Failure Detectors in Partially Synchronous Systems,” IEEE Trans. Computers, vol. 53, no. 7, pp. 815-828, July 2004. [27] Mostefaoui and M. Raynal, “Leader-Based Consensus,” Parallel Processing Letters, vol. 11, no. 1, 2001. [28] ns-2, http://www.eng. tau.ac.il/~yash/ees2003-6.pshttp:/ /www.isi.edu/nsnamns/, Aug. 2008. [29] R. Oliveira, “Solving Consensus: From Fair-Lossy Channels to Crash-Recovery of Processes,” PhD thesis 2139, Swiss Federal Inst. of Technology, Ecole Polytechnique Federale de Lausanne (EPFL), 2000. [30] C. Perkins, Ad Hoc Networking. Addison-Wesley, 2001. [31] C. Perkins and P. Bhangwat, “Highly Dynamic Destination-Sequenced Distance-Vector (DSDV) Routing for Mobile Computers,” Proc. ACM SIGCOMM '94, Aug. 1994. [32] C. Perkins and E. Royer, “Ad-Hoc On-Demand Distance Vector Routing,” Proc. Second IEEE Workshop Mobile Computing Systems and Applications, Feb. 1999. [33] QualNet, http:/www.scalable-networks.com/, Aug. 2008. [34] M. Satyanarayanan, “Fundamental Challenges in Mobile Computing,” Proc. ACM Symp. Principles of Distributed Computing (PODC), 1996. [35] Schiper, “Early Consensus in an Asynchronous System with a Weak Failure Detector,” Distributed Computing, vol. 10, no. 3, Oct. 1997. [36] H. Seba, N. Badache, and A. Bouabdallah, “Solving the Consensus Problem in a Dynamic Group: An Approach Suitable for a Mobile Environment,” Proc. Int’l Symp. Computers and Comm. (ISCC), 2002. [37] K. Sundaresan, V. Anantharaman, H. Hsieh, and R. Sivakumar, “ATP: A Reliable Transport Protocol for Ad Hoc Networks,” Proc. ACM MobiHoc '03, June 2003. [38] S. Tucci-Piergiovanni and R. Baldoni, “Eventual Leader Election in the Infinite Arrival Message-Passing System Model,” Proc. Diocesan Information Systems Conf. (DISC '08), Sept. 2008. [39] E. Vollset and P.D. Ezhilchelvan, “Design and Performance-Study of Crash-Tolerant Protocols for Broadcasting and Reaching Consensus in MANETs,” Proc. Symp. Reliable Distributed Systems (SRDS '05), Oct. 2005. [40] W. Wu, J. Cao, J. Yang, and M. Raynal, “Design and Performance Evaluation of Efficient Consensus Protocols for Mobile Ad Hoc Networks,” IEEE Trans. Computers, vol. 56, no. 8, pp.1055-1070, Aug. 2007. [41] W. Wu, J. Cao, J. Yang, and M. Raynal, “Using Asynchrony and Zero Degradation to Speed Up Indulgent Consensus Protocols,” J.Parallel and Distributed Computing, vol. 68, no. 7, pp.984-996, July 2008. [42] J. Yu and P. Chong, “A Survey of Clustering Schemes for Mobile Ad Hoc Networks,” IEEE Comm. Surveys and Tutorials, vol. 7, no. 1, May 2005. [43] X. Yu, “Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross-Layer Information Awareness,” Proc. MobiCom '04, Sept. 2004.
FULL ARTICLE
28 ms
(Ver 2.0)

Marketing Automation Platform