A Token-Based Solution to Group Local Mutual Exclusion Problem In Mobile Ad Hoc Networks

摘要

The article presents a generalization of the group mutual exclusion (GME) problem, called group local mutual exclusion (GLME), henceforth. In GLME, the activities of neighboring nodes need to be synchronized; however, no such synchronization is required between non-neighbors. The neighborhood is defined based on the location of the shared resources. A token-based solution to the GLME problem has also been proposed. The solution satisfies the correctness criteria for group mutual exclusion, i.e., safety, starvation freedom, and concurrent occupancy. The illustration includes simulation extensive results to estimate message overhead, latency, concurrency, and session switch complexity. The simulation results prove that the proposed algorithm demonstrates better performance when compared with the closest work in the literature. The token loss problem has also been handled. To the best of our knowledge, the algorithm presented in the paper is the first token-based algorithm to solve the GLME problem in MANETs.