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 nodes1 with wireless interfaces and has an arbitrary dynamic topology. The networks suffers from frequent link formation and disruption due to the mobility of the nodes. In this paper we present a token based algorithm for Group Mutual Exclusion in ad hoc mobile networks. The proposed algorithm is adapted from the RL algorithm in [1]. The algorithm requires nodes to communicate with only their current neighbors. The algorithm ensures the mutual exclusion, the bounded delay, and the concurrent entering properties. © 2007 Springer.
CITATION STYLE
Thiare, O., Naimi, M., & Gueroui, M. (2007). A group mutual exclusion algorithm for mobile ad hoc networks. In Innovations and Advanced Techniques in Computer and Information Sciences and Engineering (pp. 373–377). Kluwer Academic Publishers. https://doi.org/10.1007/978-1-4020-6268-1_67
Mendeley helps you to discover research relevant for your work.