Paper Info
Title
A Group k-Mutual Exclusion Algorithm for Mobile Ad Hoc Networks
Abstract
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 Gk -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.
Year
DOI
Venue
2009
10.1007/978-3-642-02481-8_9
IWANN (2)
Keywords
Field
DocType
mobile node,static network,concurrent access,k node,mobile ad hoc networks,group k,mutual exclusion algorithm,rl algorithm,group k-mutual exclusion algorithm,me problem,proposed algorithm,mutual exclusion,mobile ad hoc network,ad hoc network
Mobile ad hoc network,Delay-tolerant networking,Computer science,Computer network,Algorithm,Ad hoc wireless distribution service,Adaptive quality of service multi-hop routing,Optimized Link State Routing Protocol,Wireless ad hoc network,Geocast,Vehicular ad hoc network,Distributed computing
Conference
Volume
ISSN
Citations 
5518
0302-9743
0
PageRank 
References 
Authors
0.34
16
2
Name
Order
Citations
PageRank
Ousmane Thiare1115.75
Mohamed Naimi219616.15