Distributed token circulation in mobile ad hoc networks

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]  Idit Keidar,et al.  Efficient message ordering in dynamic networks , 1996, PODC '96.

[2]  Mukesh Singhal,et al.  An efficient causal ordering algorithm for mobile computing environments , 1996, Proceedings of 16th International Conference on Distributed Computing Systems.

[3]  M.A. El-Gendy,et al.  Migrating group communication protocols to networks with mobile hosts , 1998, 1998 Midwest Symposium on Circuits and Systems (Cat. No. 98CB36268).

[4]  George C. Polyzos,et al.  IP multicast for mobile hosts , 1997, IEEE Commun. Mag..

[5]  Romit Roy Choudhury,et al.  A distributed mechanism for topology discovery in ad hoc wireless networks using mobile agents , 2000, MobiHoc.

[6]  Yu-Chee Tseng,et al.  Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures , 1997, IEEE Trans. Parallel Distributed Syst..

[7]  Roberto Baldoni,et al.  Architecture for group communication in mobile systems , 1998, Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281).

[8]  Robbert van Renesse,et al.  Reliable Distributed Computing with the Isis Toolkit , 1994 .

[9]  B. R. Badrinath,et al.  A framework for delivering multicast messages in networks with mobile hosts , 1996, Mob. Networks Appl..

[10]  Nitin H. Vaidya,et al.  Analysis of TCP Performance over Mobile Ad Hoc Networks , 1999, Wirel. Networks.

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

[12]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[13]  Flaviu Cristian,et al.  Synchronous and asynchronous , 1996, CACM.

[14]  Jennifer L. Welch,et al.  Random walk for self-stabilizing group communication in ad hoc networks , 2002, IEEE Transactions on Mobile Computing.

[15]  Franck Petit,et al.  Color optimal self-stabilizing depth-first token circulation , 1997, Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97).

[16]  Kenneth P. Birman,et al.  A Group Communication Approach for Mobile Computing , 1994, 1994 First Workshop on Mobile Computing Systems and Applications.

[17]  Yoram Ofek,et al.  Ring versus tree embedding for real-time group multicast , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[18]  Yu Chen,et al.  Self-stabilizing mutual exclusion using tokens in mobile ad hoc networks , 2002, DIALM '02.

[19]  Louise E. Moser,et al.  Fast message ordering and membership using a logical token-passing ring , 1993, [1993] Proceedings. The 13th International Conference on Distributed Computing Systems.

[20]  Yair Amir,et al.  Membership Algorithms for Multicast Communication Groups , 1992, WDAG.

[21]  Ajoy Kumar Datta,et al.  Self-stabilizing depth-first token circulation in arbitrary rooted networks , 2000, Distributed Computing.

[22]  Frank B. Schmuck,et al.  Agreeing on Processor Group Membership in Timed Asynchronous Distributed Systems , 1995 .

[23]  Flaviu Cristian,et al.  Synchronous and Asynchronous Group Communication. , 1996 .

[24]  Roy Friedman,et al.  Strong and weak virtual synchrony in Horus , 1996, Proceedings 15th Symposium on Reliable Distributed Systems.

[25]  Nancy A. Lynch,et al.  Specifying and using a partitionable group communication service , 2001, TOCS.

[26]  Philip K. McKinley,et al.  A token-based protocol for reliable, ordered multicast communication , 1989, Proceedings of the Eighth Symposium on Reliable Distributed Systems.