Self-stabilizing dynamic mutual exclusion for mobile ad hoc networks

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.