ACM Computing Surveys (CSUR)
Fundamental control algorithms in mobile networks
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Leader election algorithms for mobile ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Self-stabilizing systems in spite of distributed control
Communications of the ACM
A mutual exclusion algorithm for ad hoc mobile networks
Wireless Networks
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
Random Walk for Self-Stabilizing Group Communication in Ad-Hoc Networks
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
A Distributed Mutual Exclusion Algorithm for Mobile Ad-Hoc Networks
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Superstabilizing Protocols for Dynamic Distributed Systems
Superstabilizing Protocols for Dynamic Distributed Systems
Distributed Token Circulation on Mobile Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
MobiCom poster: ELAN---an E-learning infrastructure for ad-hoc networks
ACM SIGMOBILE Mobile Computing and Communications Review
Distributed Token Circulation in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Universal adaptive self-stabilizing traversal scheme: Random walk and reloading wave
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
We propose a self-stabilizing mutual exclusion algorithm for mobile ad hoc networks, in which the composition of processors that want to enter the critical section can change dynamically. Our algorithm is based on dynamic virtual rings formed by circulating tokens. The algorithm always guarantees mutual exclusion and it guarantees different levels of progress under different levels of performance of the token circulation in the presence of mobility and message loss. Rigorous proofs of correctness and performance are given.