A distributed h-out of -k mutual exclusion algorithm for ad hoc mobile networks

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

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 as 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, 1 ≤ 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.

Original languageEnglish
Title of host publicationProceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages196
Number of pages1
ISBN (Electronic)0769515738, 9780769515731
DOIs
StatePublished - 2002
Event16th International Parallel and Distributed Processing Symposium, IPDPS 2002 - Ft. Lauderdale, United States
Duration: 15 Apr 200219 Apr 2002

Publication series

NameProceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002

Conference

Conference16th International Parallel and Distributed Processing Symposium, IPDPS 2002
Country/TerritoryUnited States
CityFt. Lauderdale
Period15/04/0219/04/02

Fingerprint

Dive into the research topics of 'A distributed h-out of -k mutual exclusion algorithm for ad hoc mobile networks'. Together they form a unique fingerprint.

Cite this