Distributed token circulation in mobile ad hoc networks Academic Article uri icon

abstract

  • 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. 2005 IEEE.

published proceedings

  • IEEE Transactions on Mobile Computing

author list (cited authors)

  • Malpani, N., Yu Chen, .., Vaidya, N. H., & Welch, J. L.

citation count

  • 50

complete list of authors

  • Malpani, N||Vaidya, NH||Welch, JL

publication date

  • March 2005