A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
A Heuristically-Aided Algorithm for Mutual Exclusion in Distributed Systems
IEEE Transactions on Computers
A distributed mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Cross-Layer Design for Data Accessibility in Mobile Ad Hoc Networks
Wireless Personal Communications: An International Journal
An Architecture for Survivable Coordination in Large Distributed Systems
IEEE Transactions on Knowledge and Data Engineering
Fault tolerant mutual and k-mutual exclusion algorithms for single-hop mobile ad hoc networks
International Journal of Ad Hoc and Ubiquitous Computing
An algorithm for k-mutual exclusion in decentralized systems
Computer Communications
Token based algorithm for supporting mutual exclusion in opportunistic networks
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
DMX in MANETs: major research trends since 2004
ACAI '11 Proceedings of the International Conference on Advances in Computing and Artificial Intelligence
A token based distributed algorithm for supporting mutual exclusion in opportunistic networks
Pervasive and Mobile Computing
| Hi-index | 0.00 |
In this paper, we propose a new architecture to solve the problem of mutual exclusion in mobile ad hoc networks (MANET). The architecture is composed of two layers: (i) a middleware layer that contains a token-based distributed mutual exclusion algorithm (DMEA) and (ii) a network layer that includes two routing forwarding strategies: one to route request messages and the other to route the token message. We also propose a request ordering policy that ensures the usual mutual exclusion properties and reduces the number of hops traversed per critical section (CS) access. The paper also addresses the problem of network partitioning and unreachable nodes. The proposed mutual exclusion algorithm is further enhanced to provide fault tolerance by preventing the loss of the token and generating a new token if the token loss event occurs. The performance complexity as well as the experimental results show that the proposed algorithm experiences low number of hops per CS access.