Self-stabilization by counter flushing
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
A mutual exclusion algorithm for ad hoc mobile networks
Wireless Networks
Random walk for self-stabilizing group communication in ad hoc networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Color Optimal Self-Stabilizing Depth-First Token Circulation
ISPAN '97 Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks
Distributed Token Circulation on Mobile Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Distributed Token Circulation in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Self-stabilizing dynamic mutual exclusion for mobile ad hoc networks
Journal of Parallel and Distributed Computing
A fault tolerant mutual exclusion algorithm for mobile ad hoc networks
Pervasive and Mobile Computing
Fault tolerant mutual and k-mutual exclusion algorithms for single-hop mobile ad hoc networks
International Journal of Ad Hoc and Ubiquitous Computing
Journal of Parallel and Distributed Computing
A dual-token-based fault tolerant mutual exclusion algorithm for MANETs
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Topological adaptability for the distributed token circulation paradigm in faulty environment
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
A dynamic reconfiguration tolerant self-stabilizing token circulation algorithm in ad-hoc networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Hi-index | 0.00 |
In this paper, we propose a self-stabilizing mutual exclusion algorithm using tokens for mobile ad hoc networks. Our algorithm is based on dynamic virtual rings formed by circulating tokens. We require the topology to be static while the algorithm is converging. But after it has converged, under a restricted mobility assumption, it guarantees both the safety and liveness properties of mutual exclusion; under arbitrary mobility, it cannot guarantee the liveness property, but it does guarantee the safety property.