Algorithms for mutual exclusion
Algorithms for mutual exclusion
Conflict multiplicity estimation and batch resolution algorithms
IEEE Transactions on Information Theory
Multiple access protocols: performance and analysis
Multiple access protocols: performance and analysis
An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
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
A Distributed Mutual Exclusion Algorithm for Mobile Ad-Hoc Networks
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Distributed Token Circulation on Mobile Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Shared-memory mutual exclusion: major research trends since 1986
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Echo Algorithms: Depth Parallel Operations on General Graphs
IEEE Transactions on Software Engineering
A mobility-management mechanism for broadcasting in unknown mobile ad hoc networks
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
A distributed mutual exclusion algorithm over multi-routing protocol for mobile ad hoc networks
International Journal of Parallel, Emergent and Distributed Systems
Hi-index | 0.00 |
Previous mutual exclusion (MUTEX for short) protocols for mobile ad hoc networks are based on the token circulation technique. They assume that the network is reliable to avoid starvation. Considering that the MUTEX issue is to share a communication channel, we have designed an average-case-analysis protocol for single-hop networks which is based on the fully distributed construction of a random binary tree. Contrarily to other papers, the stations are not identified and their number (n) is unknown. Assuming that time is slotted, our algorithm runs in approximately n/log 2 slots. The derived k-MUTEX protocol runs in n/log k slots.