Arbitration based distributed group mutual exclusion algorithm for mobile ad hoc networks

The group mutual exclusion problem is a simplification of mutual exclusion problem such that a set of processes in the similar group can enter a critical section all together. To handle group mutual exclusion, the interrelated solutions are chiefly classified into quorum-based, token-based as well as permission-based protocols. The proposed algorithm is based on tokens; a process that grasps a token can invoke a critical section. To our knowledge, only some algorithms have been proposed in the literature which follows permission-based or token-based approach. In this paper, we put the entire nodes into dissimilar regions. Arbitrator nodes have been introduced in this paper that forms the relationship among two neighboring regions. “Look-ahead” procedure is used which helps in dropping message complexity. We present the distributed group mutual exclusion algorithm developed for MANETs. The outcomes have been substantiated by simulations and experiments. We observed that the proposed algorithm outperforms the TQGmx algorithm in performance parameters such as synchronization delay, response time in addition to message complexity.