A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
A Non-Token-Based-Distributed Mutual Exclusion Algorithm for Single-Hop Mobile Ad Hoc Networks
[chapter]
2005
IFIP International Federation for Information Processing
This paper presents a simple mutual exclusion algorithm for ad hoc mobile networks. Our algorithm does not use the token circulation technique. A station which requests a Critical Section (CS) competes in order to be alone to use the unique channel dedicated to this CS. To reach this goal, we derive a Markov process which guarantees that each station will enter the C^. More precisely, we show that, in presence of collision detection, n/ln2 broadcast rounds are necessary in the average case to
doi:10.1007/0-387-23150-1_25
fatcat:7xbpfzrlqjfgzabw2xec2w446e