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
Eliminating interference between concurrently executing activities through mutual exclusion is one o...
Mutual exclusion among the nodes waiting for critical resources is considered as one of the major ar...
This paper presents a token-based K-mutual exch-sion algorithm. The algorithm uses K tokens and a dy...
A distributed mutual exclusion algorithm based on to-ken exchange and well suited for mobile ad-hoc ...
This paper reports a distributed mutual exclusion algorithm for mobile Ad-hoc networks. The network ...
A fault-tolerant distributed mutual exclusion algorithm which adjusts to node mobility is presented,...
Locate full-text(opens in a new window)|NILDE - Document delivery(opens in a new window)|View at Pub...
The k-local mutual exclusion is a generalization of local mutual exclusion problem introduced by Att...
Mobile ad hoc networks (MANETs) introduce new challenges to designing algorithms for solving the dis...
Abstract—Resource sharing is a major advantage of distributed computing. However, a distributed comp...
The group mutual exclusion (GME) problem is a variant of the mutual exclusion problem. In the presen...
In this paper, we propose a permission-based message efficient mutual exclusion (MUTEX) algorithm fo...
Abstract. A fault-tolerant distributed mutual exclusion algorithm that adjusts to node mobility is p...
This paper aims towards designing a new token-based mutual exclusion algorithm for distributed syste...
Eliminating interference between concurrently executing activities through mutual exclusion is one o...
Eliminating interference between concurrently executing activities through mutual exclusion is one o...
Mutual exclusion among the nodes waiting for critical resources is considered as one of the major ar...
This paper presents a token-based K-mutual exch-sion algorithm. The algorithm uses K tokens and a dy...
A distributed mutual exclusion algorithm based on to-ken exchange and well suited for mobile ad-hoc ...
This paper reports a distributed mutual exclusion algorithm for mobile Ad-hoc networks. The network ...
A fault-tolerant distributed mutual exclusion algorithm which adjusts to node mobility is presented,...
Locate full-text(opens in a new window)|NILDE - Document delivery(opens in a new window)|View at Pub...
The k-local mutual exclusion is a generalization of local mutual exclusion problem introduced by Att...
Mobile ad hoc networks (MANETs) introduce new challenges to designing algorithms for solving the dis...
Abstract—Resource sharing is a major advantage of distributed computing. However, a distributed comp...
The group mutual exclusion (GME) problem is a variant of the mutual exclusion problem. In the presen...
In this paper, we propose a permission-based message efficient mutual exclusion (MUTEX) algorithm fo...
Abstract. A fault-tolerant distributed mutual exclusion algorithm that adjusts to node mobility is p...
This paper aims towards designing a new token-based mutual exclusion algorithm for distributed syste...
Eliminating interference between concurrently executing activities through mutual exclusion is one o...
Eliminating interference between concurrently executing activities through mutual exclusion is one o...
Mutual exclusion among the nodes waiting for critical resources is considered as one of the major ar...
This paper presents a token-based K-mutual exch-sion algorithm. The algorithm uses K tokens and a dy...