A Group k-Mutual Exclusion Algorithm for Mobile Ad Hoc Networks

Authors:
Ousmane Thiare;Mohamed Naimi
Affiliations:
Department of Computer Science, Gaston Berger University, Saint-Louis Senegal;Department of Computer Science, University of Cergy-Pontoise, Cergy-Pontoise, France LICP EA2175
Venue:
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
Year:
2009

Citing 14
Cited 0

Detecting termination by weight-throwing in a faulty distributed system

Journal of Parallel and Distributed Computing
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
Asynchronous group mutual exclusion (extended abstract)

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Leader election algorithms for mobile ad hoc networks

DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
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
A note on group mutual exclusion

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A highly concurrent group mutual l-exclusion algorithm0

Proceedings of the twenty-first annual symposium on Principles of distributed computing
A simple group mutual l-exclusion algorithm

Information Processing Letters
Quorum-Based Algorithms for Group Mutual Exclusion

DISC '01 Proceedings of the 15th International Conference on Distributed Computing
A distributed K-mutual exclusion algorithm

ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Mutual Exclusion on Multihop, Mobile Wireless Networks

Mutual Exclusion on Multihop, Mobile Wireless Networks
Resource allocation with immunity to limited process failure

SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.