A group k-mutual exclusion algorithm for mobile Ad hoc networks

Abstract

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 with wireless interfaces and has an arbitrary dynamic topology. In this paper we present a toke- based group k-mutual exclusion algorithm for mobile ad hoc networks. The Gk-ME problem is concerned with controlling the concurrent accesses of some resources by at most k nodes with the constraint that no two distinct resources can be accessed simultaneously. The proposed algorithm is adapted from the RL algorithm. The algorithm ensures the mutual exclusion, the bounded delay, and the k-concurrent entering property. © 2009 Springer Berlin Heidelberg.