This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Distributed Token Circulation in Mobile Ad Hoc Networks
March/April 2005 (vol. 4 no. 2)
pp. 154-165
This paper presents several distributed algorithms that cause a token to continually circulate through all the nodes of a mobile ad hoc network. An important application of such algorithms is to ensure total order of message delivery in a group communication service. Some of the proposed algorithms are aware of, and adapt to changes in, the ad hoc network topology. When using a token circulation algorithm, a round is said to complete when every node has been visited at least once. Criteria for comparing the algorithms include the average time required to complete a round, number of bytes sent per round, and number of nodes visited per round. Comparison between the proposed algorithms is performed using simulation results obtained from a detailed simulation model (with ns-2 simulator). We also give a rigorous worst-case analysis of the proposed LR algorithm, which gives the best overall performance in the simulation.

[1] A. Acharya and B.R. Badrinath, “A Framework for Delivering Multicast Messages in Networks with Mobile Hosts,” ACM–Baltzer J. Mobile Networks and Applications, vol. 1, pp. 199-219, 1996.
[2] Y. Amir, D. Dolev, S. Kramer, and D. Malki, “Membership Algorithms for Multicast Communication Groups,” Proc. Int'l Workshop Distributed Algorithms, pp. 292-312, 1992.
[3] Y. Amir, L. Moser, D. Agrawal, and P. Ciarfella, “Fast Message Ordering and Membership Using a Logical Token-Passing Ring,” Proc. 13th IEEE Int'l Conf. Distributed Computing Systems, pp. 551-560, 1993.
[4] M. Baldi and Y. Ofek, “Ring versus Tree Embedding for Real-Time Group Multicast,” Proc. IEEE INFOCOM '99, pp. 27-45, Mar. 1999.
[5] K.P. Birman and R.V. Renesse, Reliable Distributed Computing with the ISIS Toolkit. Los Alamitos, Calif.: IEEE CS Press, 1994.
[6] J. Broch, D.A. Maltz, D.B. Johnson, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” Proc. ACM/IEEE Int'l Conf. Mobile Computing and Networking, pp. 85-97, Oct. 1998.
[7] Y. Chen and J.L. Welch, “Self-Stabilizing Mutual Exclusion Using Tokens in Mobile Ad Hoc Networks,” Proc. Sixth Ann. Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIALM '02), 2002.
[8] K. Cho and K.P. Birman, “A Group Communication Approach for Mobile Computing,” Technical Report TR94-1424, Dept. Computer Science, Cornell Univ., Ithaca, New York, May 1994.
[9] F. Cristian, “Synchronous and Asynchronous Group Communication,” Comm. ACM, vol. 39, pp. 88-97, 1996.
[10] F. Cristian and F. Schmuck, “Agreeing on Processor Group Membership in Asynchronous Distributed Systems,” Technical Report CSE95-428, Dept. Computer Science, Univ. of California at San Diego, 1995.
[11] A. Datta, C. Johnen, F. Petit, and V. Villain, “Self-Stabilizing Depth-First Token Circulation in Arbitrary Rooted Networks,” Proc. Fifth Int'l Colloquium Structural Information and Comm. Complexity (SIROCCO '98), 1998.
[12] D. Dolev, D. Malki, and R. Strong, “An Asynchronous Membership Protocol that Tolerates Partitions,” Technical Report CS94-6, Inst. Computer Science, Hebrew Univ., Jerusalem, 1994.
[13] S. Dolev, E. Schiller, and J. Welch, “Random Walk for Self-Stabilizing Group Communication in Ad-Hoc Networks,” Proc. 21st IEEE Symp. Reliable Distributed Systems, Oct. 2002.
[14] M.A. El-Gendy, H. Baraka, and A.H. Fahmy, “Migrating Group Communication Protocols to Networks with Mobile Hosts,” Proc. IEEE Midwest Symp. Systems and Circuits, pp. 7-12, 1998.
[15] A. Fekete, N. Lynch, and A. Shvartsman, “Specifying and Using a Partitionable Group Communication Service,” Proc. 16th Ann. ACM Symp. Principles of Distributed Computing, pp. 53-71, 1997.
[16] R. Friedman and R.V. Renesse, “Strong and Weak Virtual Synchrony in Horus,” Technical Report TR95-1537, Dept. Computer Science, Cornell Univ., Ithaca New York, 1995.
[17] G. Holland and N.H. Vaidya, “Analysis of TCP Performance over Mobile Ad Hoc Networks,” Proc. Fifth Ann. ACM/IEEE Int'l Conf. Mobile Computing and Networking (MOBICOM), pp. 219-230, 1999.
[18] D. Johnson and D.A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, T. Imielinski and H. Korth, eds., pp. 153-181, Kluwer Academic Publishers, 1994.
[19] D. Karger Personal Communication, 2001.
[20] I. Keidar and D. Dolev, “Efficient Message Ordering in Dynamic Networks,” Proc. ACM Symp. Principles of Distributed Computing, pp. 68-76, 1996.
[21] F. Petit and V. Villain, “Color Optimal Self-Stabilizing Depth-First Token Circulation for Asynchronous Message-Passing Systems,” Proc. ISCA 10th Conf. Parallel and Distributed Computing Systems, Oct. 1997.
[22] R. Prakash and R. Baldoni, “Architecture for Group Communication in Mobile Systems,” Proc. IEEE Symp. Reliable Distributed Systems, pp. 235-242, Oct. 1998.
[23] R. Prakash, M. Raynal, and M. Singhal, “An efficient Causal Ordering Algorithm for Mobile Computing Environments,” Proc. 16th Int'l Conf. Distributed Computing Systems (ICDCS), pp. 744-751, 1996.
[24] B. Rajagopalan and P. McKinley, “A Token-Based Protocol for Reliable, Ordered Multicast Communication,” Proc. Eighth IEEE Symp. Reliable Distributed Systems, pp. 84-93, Oct. 1989.
[25] R. RoyChoudhury, S. Bandyopadhyay, and K. Paul, “A Distributed Mechanism for Topology Discovery in Ad Hoc Wireless Networks Using Mobile Agents,” Proc. Workshop Mobile Ad Hoc Networking and Computing (Mobi Hoc 2000), 2000.
[26] V.P. Team, “The Network Simulator–ns-2,” VINT Project Team, available at http://www.isi.edu/nsnamns/, Nov. 2000.
[27] Y.C. Tseng, S.H. Chang, and J.P. Sheu, “Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures,” IEEE Trans. Parallel and Distributed Systems, vol. 8, pp. 1185-1195, 1997.
[28] G. Xylomenos and G.C. Polyzos, “IP Multicast for Mobile Hosts,” IEEE Comm. Magazine, vol. 35, pp. 54-58, 1997.

Index Terms:
Mobile ad hoc networks, token circulation, distributed system.
Citation:
Navneet Malpani, Yu Chen, Nitin H. Vaidya, Jennifer L. Welch, "Distributed Token Circulation in Mobile Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 4, no. 2, pp. 154-165, March-April 2005, doi:10.1109/TMC.2005.25
Usage of this product signifies your acceptance of the Terms of Use.