Mutual Exclusion With Dynamic Request Set in Ad-Hoc Networks
Mutual exclusion and resource allocation are some of the challenging problems in mobile ad hoc network. This paper addresses the mutual exclusion problem in the mobile ad hoc environment. It involves a group of processes, each of which intermittently requires access to the only resource present in the environment, which becomes difficult due to the dynamic nature of the ad hoc environment. The proposed token based algorithm is sensitive to link forming and link breaking and thus is suitable for a MANET. The proposed algorithm uses the concept of dynamic request set. The authors prove that the proposed algorithm satisfies the mutual exclusion, the bounded delay, and the concurrent entering properties.