Prioritized h-out of-k mutual exclusion for mobile ad hoc networks and distributed systems

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

Abstract

In this paper, we propose a distributed prioritized h-out of-k mutual exclusion algorithm for a mobile ad hoc network (MANET) with real-time or prioritized applications. The h-out of-k mutual exclusion problem is a generalization of the k-mutual exclusion problem and the mutual exclusion problem. The proposed algorithm is sensitive to link forming and link breaking and thus is suitable for a MANET. It is worthwhile to mention that the proposed algorithm can also be applied to distributed systems consisting of stationary nodes that communicate with each other by exchanging messages over wired links.

Original languageEnglish
Title of host publicationProceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Sytems
EditorsT. Gonzalez
Pages159-164
Number of pages6
Edition1
StatePublished - 2003
EventProceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Systems - Marina del Rey, CA, United States
Duration: 3 Nov 20035 Nov 2003

Publication series

NameProceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems
Number1
Volume15

Conference

ConferenceProceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Systems
Country/TerritoryUnited States
CityMarina del Rey, CA
Period3/11/035/11/03

Keywords

  • Distributed systems
  • Mobile ad hoc network (MANET)
  • Mutual exclusion
  • Prioritized systems
  • Real-time systems
  • Resource allocation

Fingerprint

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

Cite this