A Distributed Mutual Exclusion Algorithm for Mobile Ad-Hoc Networks

Locate full-text(opens in a new window)|NILDE - Document delivery(opens in a new window)|View at Publisher| Export | Download | Add to List | More... Proceedings - IEEE Symposium on Computers and Communications 2002, Article number 1021727, Pages 539-544 7th International Symposium on Computers and Communications, ISCC 2002; Taormina-Giardini Naxos; Italy; 1 July 2002 through 4 July 2002; Category numberPR01671; Code 99371 A distributed mutual exclusion algorithm for mobile ad-hoc networks (Conference Paper) Baldoni, R. , Virgillito, A. , Petrassi, R. Dipartimento di Informatica e Sistemistica, Universitá di Roma La Sapienza, Via Salaria 113, 00198 Rome, Italy View references (14) Abstract 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 on a dynamic logical ring and combines the best from two families of token based algorithms (i.e., token-asking and circulating token). In this way, the number of messages exchanged per critical section (CS) access (the main performance index for such algorithms) tends to optimal values under a heavy request load (i.e., two application messages for 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 the logical ring on-the-fly.