A fault-resilient ℓ-exclusion algorithm for mobile ad hoc networks

Due to brisk expansion of portable computing technology, the classical dilemma of mutual exclusion in mobile ad hoc networks has drawn a substantial attention from the research community in recent years. The problem aims to provide access to shared critical resources among users regardless of their physical locations. To our knowledge, few distributed mutual exclusion algorithms using tokens are available for mobile ad hoc networks in the literature. This paper presents a consensus-based ℓ-exclusion algorithm that explicitly copes with mobility associated with such networks. This paper also presents proofs of correctness and compares this ℓ-exclusion algorithm with existing ones. Moreover, the algorithm is fault-resilient in the sense that it can tolerate loss of messages, link failures, and sudden crash or recovery of mobile nodes.