A Distributed h-out of -k Mutual Exclusion Algorithm for Ad Hoc Mobile Networks

Authors:
Jehn-Ruey Jiang
Affiliations:
-
Venue:
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Year:
2002

Citing 3
Cited 1

k-Arbiter: a safe and general scheme for h-out of-k mutual exclusion

Theoretical Computer Science
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
(h-k)-arbiter for h-out of-k Mutual Exclusion Problem

ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems

A distributed token based h-out of-k Mutual Exclusion protocol for mobile ad hoc networks

International Journal of Ad Hoc and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a distributed algorithm for solving the h-out of-k mutual exclusion problem for ad hoc mobile networks. The h-out of-k mutual exclusion problem is also known us the h-out of-k resource allocation problem. It concerns with how to control nodes in a distributed system so that each node can access h resources out of totally k shared resources, l 驴 h 驴 k, with the constraint that no more than k resources can be accessed concurrently. We have also proved the correctness of the proposed algorithm. The proposed algorithm is sensitive to link forming and link breaking and thus is suitable for ad hoc mobile networks.