By Topic

A prioritized h-out of-k mutual exclusion algorithm with maximum degree of concurrency for mobile ad hoc networks and distributed systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Jehn-Ruey Jiang ; Dept. of Inf. Manage., Hsuan Chuang Univ., Hsin-Chu, Taiwan

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. If we do not consider the link breaking and forming, 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. For nonreal-time applications, we may associate the priority with the number of requested resources to achieve the maximum degree of concurrency.

Published in:

Parallel and Distributed Computing, Applications and Technologies, 2003. PDCAT'2003. Proceedings of the Fourth International Conference on

Date of Conference:

27-29 Aug. 2003