Communications of the ACM
Efficient message ordering in dynamic networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Specifying and using a partitionable group communication service
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
A framework for delivering multicast message in networks with mobile hosts
Mobile Networks and Applications - Special issue: routing in mobile communications networks
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Analysis of TCP performance over mobile ad hoc networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A distributed mechanism for topology discovery in ad hoc wireless networks using mobile agents
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Reliable Distributed Computing with the ISIS Toolkit
Reliable Distributed Computing with the ISIS Toolkit
Self-stabilizing mutual exclusion using tokens in mobile ad hoc networks
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures
IEEE Transactions on Parallel and Distributed Systems
Membership Algorithms for Multicast Communication Groups
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Self-Stabilizing Depth-First Token Passing on Rooted Networks
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Migrating Group Communication Protocols to Networks with Mobile Hosts
MWSCAS '98 Proceedings of the 1998 Midwest Symposium on Systems and Circuits
Architecture for Group Communication in Mobile Systems
SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
Random Walk for Self-Stabilizing Group Communication in Ad-Hoc Networks
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
An efficient causal ordering algorithm for mobile computing environments
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Color Optimal Self-Stabilizing Depth-First Token Circulation
ISPAN '97 Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks
A Group Communication Approach for Mobile Computing MobileChannel: an ISIS Tool for Mobile Services
A Group Communication Approach for Mobile Computing MobileChannel: an ISIS Tool for Mobile Services
IEEE Communications Magazine
A dynamic token passing MAC protocol for mobile ad hoc networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Self-stabilizing dynamic mutual exclusion for mobile ad hoc networks
Journal of Parallel and Distributed Computing
Coordinated interaction using reliable broadcast in mobile wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
CountTorrent: ubiquitous access to query aggregates in dynamic and mobile sensor networks
Proceedings of the 5th international conference on Embedded networked sensor systems
Distributed aerial scanning in mobile ad-hoc networks
Proceedings of the 1st international conference on Autonomic computing and communication systems
Token based algorithm for supporting mutual exclusion in opportunistic networks
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
Neighbor discovery in mobile ad hoc networks using an abstract MAC layer
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Stability analysis of analytical hierarchy process clustering protocol in mobile ad hoc networks
International Journal of Communication Networks and Distributed Systems
Secure token passing at application level
Future Generation Computer Systems
Reliable neighbor discovery for mobile ad hoc networks
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Evaluation and design of beaconing in mobile wireless networks
Ad Hoc Networks
Maintaining information about nearby processors in a mobile environment
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Coordinated interaction using reliable broadcast in mobile wireless networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
A token based distributed algorithm for supporting mutual exclusion in opportunistic networks
Pervasive and Mobile Computing
Reliable neighbor discovery for mobile ad hoc networks
Ad Hoc Networks
| Hi-index | 0.00 |
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.