Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
A Group k-Mutual Exclusion Algorithm for Mobile Ad Hoc Networks
verfasst von : Ousmane Thiare, Mohamed Naimi
Erschienen in: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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 nodes with wireless interfaces and has an arbitrary dynamic topology. In this paper we present a toke- based group
k
-mutual exclusion algorithm for mobile ad hoc networks. The G
k
-ME problem is concerned with controlling the concurrent accesses of some resources by at most
k
nodes with the constraint that no two distinct resources can be accessed simultaneously. The proposed algorithm is adapted from the
RL
algorithm. The algorithm ensures the mutual exclusion, the bounded delay, and the
k
-concurrent entering property.