This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Pilot: Probabilistic Lightweight Group Communication System for Ad Hoc Networks
April 2004 (vol. 3 no. 2)
pp. 164-179

Abstract—Providing reliable group communication is an ever recurring topic in distributed settings. In mobile ad hoc networks, this problem is even more significant since all nodes act as peers, while it becomes more challenging due to highly dynamic and unpredictable topology changes. In order to overcome these difficulties, we deviate from the conventional point of view, i.e., we "fight fire with fire,”1 by exploiting the nondeterministic nature of ad hoc networks. Inspired by the principles of gossip mechanisms and probabilistic quorum systems, we present in this paper Pilot (Probabilistic Lightweight group communication system) for ad hoc networks, a two-layer system consisting of a set of protocols for reliable multicasting and data sharing in mobile ad hoc networks. The performance of Pilot is predictable and controllable in terms of both reliability (fault tolerance) and efficiency (overhead). We present an analysis of Pilot's performance, which is used to fine-tune protocol parameters to obtain the desired trade off between reliability and efficiency. We confirm the predictability and tunability of Pilot through simulations with ns-2.

[1] I. Gupta, K.P. Birman, and R. van Renesse, Fighting Fire with Fire: Using Randomized Gossip to Combat Stochastic Scalability Limits J. Quality and Reliability Eng. Int'l, vol. 18, no. 3, pp. 165-184, 2002.
[2] D. Powell et al. Group Communication (special issue) Comm. ACM, vol. 39, no. 4, pp. 50-97, 1996.
[3] Z.J. Haas and B. Liang, Ad Hoc Mobility Management with Uniform Quorum Systems IEEE/ACM Trans. Networking, vol. 7, no. 2, pp. 228-240, 1999.
[4] G. Pei and M. Gerla, Mobility Management for Hierarchical Wireless Networks ACM/Kluwer Mobile Networks and Applications (MONET), vol. 6, no. 4, pp. 331-337, 2001.
[5] L. Zhou and Z. Haas, “Securing Ad Hoc Networks,” IEEE Network, vol. 13, no. 6, pp. 24-30, Nov./Dec. 1999.
[6] S. Capkun, L. Buttyán, and J. -P. Hubaux, Self-Organized Public-Key Management for Mobile Ad Hoc Networks IEEE Trans. Mobile Computing, vol. 2, no. 1, pp. 52-64, Jan-Mar. 2003.
[7] L. Buttyán and J.-P. Hubaux, Report on a Working Session on Security in Wireless Ad Hoc Networks ACM SIGMOBILE Mobile Computing and Comm. Rev., vol. 6, no. 4, 2002.
[8] N. Asokan and P. Ginzboorg, Key-Agreement in Ad-Hoc Networks Computer Comm., vol. 23, no. 17, pp. 1627-1637, 2000.
[9] S. Nesargi and R. Prakash, MANETconf: Configuration of Hosts in a Mobile Ad Hoc Network Proc. INFOCOM, pp. 1059-1068, 2002.
[10] E.M. Royer and C.E. Perkins, Multicast Operation of the Ad-Hoc On-Demand Distance Vector Routing Protocol Proc. MobiCom, pp. 207-218, 1999.
[11] J.-P. Hubaux, T. Gross, J.-Y. Le Boudec, and M. Vetterli, “Toward Self-Organized Mobile Ad Hoc Networks: The Terminodes Project,” IEEE Comm. Magazine, Jan. 2001.
[12] J. Luo, P.T. Eugster, and J-P. Hubaux, "Route Driven Gossip: Probabilistic Reliable Multicast in Ad Hoc Networks," Proc. IEEE Infocom 2003, IEEE Press, 2003, pp. 2229-2239.
[13] J. Luo, J.-P. Hubaux, and P.Th Eugster, Pan: Providing Reliable Storage in Mobile Ad Hoc Networks with Probabilistic Quorum Systems Proc. MobiHoc, pp. 1-12, 2003.
[14] M.G. Hayden, The Ensemble System PhD thesis, Dept. of Computer Science, Cornell Univ., 1997.
[15] Y. Amir, C. Danilov, and J. Stanton, “A Low Latency, Loss Tolerant Architecture and Protocol for Wide Area Group Communication,” Proc. Int'l Conf. Dependable Systems and Networks, June 2000.
[16] N. Malpani, N.H. Vaidya, and J.L. Welch, Distributed Token Circulation in Mobile Ad Hoc Networks Proc. 10th IEEE Int'l Conf. Network Protocols, pp. 4-13, 2002.
[17] S. Dolev, E. Schiller, and J. L. Welch, Random Walk for Self-Stabilizing Group Communication in Ad Hoc Networks Proc. 21st Symp. Reliable Distributed Systems, pp. 70-79, 2002.
[18] E. Vollset, The Autograph Protocol a Preliminary Report on a Reliable Broadcast Protocol for Mobile Ad-Hoc Networks Proc. Int'l Conf. Dependable Systems and Networks-Student Forum, 2003.
[19] G.-C. Roman, Q. Huang, and A. Hazemi, Consistent Group Membership in Ad Hoc Networks Proc. ISCE, 2001.
[20] V. Hadzilacos and S. Toueg, Fault-Tolerant Broadcasts and Related Problems Distributed Systems, pp. 97-145, chap. 5, second ed., Addison-Wesley, 1993.
[21] K.P. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky, Bimodal Multicast ACM Trans. Computer Systems, vol. 17, no. 2, pp. 41-88, 1999.
[22] P. Eugster, R. Guerraoui, S. Handurukande, A.M. Kermarrec, and P. Kouznetsov, Lightweight Probabilistic Broadcast ACM Trans. Computer Systems, 2003.
[23] S. Floyd et al., "A Reliable Multicast Framework for Lightweight Sessions and Application Level Framing," ACM/IEEE Trans. Networking, Dec. 1997, pp. 784-803.
[24] S. Paul, K.K. Sabnani, J.C.H. Lin, and S. Bhattacharyya, “Reliable Multicast Transport Protocol,” IEEE J. Selected Areas in Comm., vol. 15, no. 3, pp. 407–421, Mar. 1997.
[25] R. Chandra, V. Ramasubramanian, and K. Birman, "Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks," Proc. IEEE Int'l Conf. Distributed Computing Systems, IEEE CS Press, 2001, pp. 275-283.
[26] D. Barbara and H. Garcia-Molina, The Reliability of Vote Mechanisms IEEE Trans. Computers, vol. 36, no. 10, pp. 1197-1208, Oct. 1987.
[27] F.B. Schneider, Replication Management Using the State-Machine Approach Distributed Systems, pp. 169-197, chapter. 6, second ed., Addison-Wesley, 1993.
[28] D. Malkhi, M.K. Reiter, and A. Wool, Probabilistic Quorum Systems Information and Computation, vol. 170, no. 2, pp. 184-206, 2001.
[29] Z.J. Haas and B. Liang, Ad Hoc Mobility Management with Randomized Database Groups Proc. Int'l Conf. Comm., vol. 3, pp. 1756-1762, 1999.
[30] M. Papadopouli and H. Schulzrinne, Effects of Power Conservation, Wireless Coverage and Cooperation on Data Dissemination among Mobile Devices Proc. MobiHoc, pp. 117-127, 2001.
[31] T. Hara, “Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility,” Proc. IEEE INFOCOM Conf., Apr. 2001.
[32] K.H. Wang and B. Li, Efficient and Guaranteed Service Coverage in Partitionable Mobile Ad-Hoc Networks Proc. INFOCOM, pp. 1089-1098, 2002.
[33] D.B. Johnson, D.A. Maltz, and Y-C. Hu, The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks(DSR) Internet-Draft, draft-ietf-manet-dsr-08. txt, work in progress, Feb. 2003.
[34] K. Xu, X. Hong, and M. Gerla, An Ad Hoc Network with Mobile Backbones Proc. Int'l Conf. Comm., vol. 5, pp. 3138-3143, 2002.
[35] R. Sivakumar, P. Sinha, and V. Bharghavan, CEDAR: A Core-Extraction Distributed Ad Hoc Routing Algorithm IEEE J. Selected Areas in Comm., special issue on ad-hoc routing, vol. 17, no. 8, pp. 1454-1465, 1999.
[36] A.W. Fu and D.W. Cheung, A Transaction Replication Scheme for a Replicated Database with Node Autonomy Proc. Very Large Data Bases Conf., pp. 214-225, 1994.
[37] L.-G. Alberto and I. Widjaja, Communications Networks. McGraw Hill Higher Education, 2000.
[38] J.D. Murray, Mathematical Biology. second ed. Berlin: Springer, 1993.
[39] The ns Manual The VINT Project, K. Fall and K. Varadhan, eds., UC Berkeley, LBL, USC/ISI, and Xerox PARC, Apr. 2002, availiable fromhttp://www.isi.edu/nsnamns/.
[40] T.S. Rappaport, Wireless Communications: Principles and Practice, second ed. Upper Saddle River, N.J.: Prentice Hall, 2002.
[41] D.B. Johnson and D.A. Maltz, Dynamic Source Routing in Ad Hoc Wireless Networks Mobile Computing, T. Imielinski and H. Korth, eds., chap. 5, pp. 153-181, Kluwer Academic Publishers, 1996.
[42] A.-M. Kermarrec, L. Massoulié, and A.J. Ganesh, “Probabilistic Reliable Dissemination in Large-Scale Systems,” IEEE Trans. Parallel and Distributed Systems, to appear.
[43] J. Yoon, M. Liu, and B. Noble, Random Waypoint Considered Harmful Proc. 21st Ann. Joint Conf. IEEE Computer and Comm. Soc. (INFOCOM 2003), pp. 1312-1321, Apr. 2003.

Index Terms:
Mobile ad hoc networks, group communication systems, quorum systems, reliable multicast, gossiping, data sharing, replication.
Citation:
Jun Luo, Patrick Th. Eugster, Jean-Pierre Hubaux, "Pilot: Probabilistic Lightweight Group Communication System for Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 3, no. 2, pp. 164-179, April 2004, doi:10.1109/TMC.2004.12
Usage of this product signifies your acceptance of the Terms of Use.