Local Leader Election, Signal Strength Aware Flooding, and Routeless Routing
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
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
A Software Architecture for Shared Resource Management in Mobile Ad Hoc Networks
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
A distributed token based h-out of-k Mutual Exclusion protocol for mobile ad hoc networks
International Journal of Ad Hoc and Ubiquitous Computing
Token based algorithm for supporting mutual exclusion in opportunistic networks
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
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
DMX in MANETs: major research trends since 2004
ACAI '11 Proceedings of the International Conference on Advances in Computing and Artificial Intelligence
A token based distributed algorithm for supporting mutual exclusion in opportunistic networks
Pervasive and Mobile Computing
Oblivious assignment with m slots
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
| Hi-index | 0.00 |
A distributed mutual exclusion algorithm based on token exchange and well suited for mobile ad-hoc networks is presented along with a simulation study. The algorithm is based onto a dynamic logical ring and combines the best from the two families of token based algorithms (i.e., token-asking and circulating token) in order to get a number of messages exchanged per CS access (the main performance index for such algorithms) that tends to optimal values under heavy request load (i.e., two application messages each CS access). We present a simulation study that (i) confirms this optimality and (ii) shows that, in a mobile ad-hoc network,an effective reduction in the number of hops per application message can be achieved by using a specific policy to build on-the-fly the logical ring.