A Group Mutual Exclusion Algorithm for Ad Hoc Mobile Networks

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

9 Scopus citations

Abstract

In this paper, we propose a token based algorithm to solve the group mutual exclusion (GME) problem for ad hoc mobile networks, The proposed algorithm is adapted from the RL algorithm in [WWV98] and utilizes the concept of weight throwing in [Tse95]. We prove that the proposed algorithm satisfies the mutual exclusion, the bounded delay, and the concurrent entering properties. 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 of the 6th Joint Conference on Information Sciences, JCIS 2002
EditorsJ.H. Caulfield, S.H. Chen, H.D. Cheng, R. Duro, J.H. Caufield, S.H. Chen, H.D. Cheng, R. Duro, V. Honavar
Pages266-270
Number of pages5
StatePublished - 2002
EventProceedings of the 6th Joint Conference on Information Sciences, JCIS 2002 - Research Triange Park, NC, United States
Duration: 8 Mar 200213 Mar 2002

Publication series

NameProceedings of the Joint Conference on Information Sciences
Volume6

Conference

ConferenceProceedings of the 6th Joint Conference on Information Sciences, JCIS 2002
Country/TerritoryUnited States
CityResearch Triange Park, NC
Period8/03/0213/03/02

Keywords

  • Ad hoc networks
  • Distributed algorithms
  • Group mutual exclusion
  • Mutual exclusion

Fingerprint

Dive into the research topics of 'A Group Mutual Exclusion Algorithm for Ad Hoc Mobile Networks'. Together they form a unique fingerprint.

Cite this