A Token-Based Group Mutual Exclusion Algorithm for MANETs

A mobile ad hoc network can be defined as a network that is spontaneously deployed and is independent of any static network. The network consist of mobile nodes(1) with wireless interfaces and has an arbitrary dynamic topology. The networks suffers from frequent link formation and disruption due to the mobility of the nodes. In this paper we present a token based algorithm for Group Mutual Exclusion in ad hoc mobile networks. The proposed algorithm is adapted from the RL algorithm in [1]. We utilizes also the concept used in [6] to detect that all the nodes concurrently accessing the same resource have terminated their tasks (concurrent entering). The algorithm ensures the mutual exclusion, the bounded delay, and the concurrent entering properties.