A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
A token based k-resilient mutual exclusion algorithm for distributed systems
Information Processing Letters
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
Cohorts Structures for Fault-Tolerant k Entries to a Critical Section
IEEE Transactions on Computers
k-Arbiter: a safe and general scheme for h-out of-k mutual exclusion
Theoretical Computer Science
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A mutual exclusion algorithm for ad hoc mobile networks
Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
A Distributed Solution to the k-out of-M Resources Allocation Problem
ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
A Distributed h-out of -k Mutual Exclusion Algorithm for Ad Hoc Mobile Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A Distributed Mutual Exclusion Algorithm for Mobile Ad-Hoc Networks
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
(h, k)-Arbiters for h-out-of-k mutual exclusion problem
Theoretical Computer Science
Distributed mutual exclusion algorithms in mobile ad hoc networks: an overview
ACM SIGOPS Operating Systems Review
Hi-index | 0.00 |
This paper describes a new distributed token based h-out of-k Mutual Exclusion (h-k-ME) protocol for mobile ad hoc networks. This protocol uses neither the routing layer nor a logical structure and agrees requests based on their distances to the token, their ages and their resources numbers. A request is sent within a dynamical radius computed so as to reach a part of nodes. The protocol is fault tolerant and manages one token with k resources in each partition. The mobility has little effect on the protocol's performances especially for medium and heavy loads.