Distributed mutual exclusion algorithms in mobile ad hoc networks

Benchaïba, Mahfoud; Bouabdallah, Abdelmadjid; Badache, Nadjib; Ahmed-Nacer, Mehdi

doi:10.1145/974104.974111

Cited by 34 publications

(6 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, the mutual exclusion problem received an interest for mobile ad hoc networks [3,4,9,18,20]. To the best of our knowledge, few algorithms have been proposed in the literature and all of them are token-based approaches.…”

Section: Expanding the Algorithm To New Applicationmentioning

confidence: 99%

A hybrid token-based distributed mutual exclusion algorithm using wraparound two-dimensional array logical topology

Taheri

Neamatollahi

Naghibzadeh

2011

Information Processing Letters

View full text Add to dashboard Cite

Section: Expanding the Algorithm To New Applicationmentioning

confidence: 99%

A hybrid token-based distributed mutual exclusion algorithm using wraparound two-dimensional array logical topology

Taheri

Neamatollahi

Naghibzadeh

2011

Information Processing Letters

View full text Add to dashboard Cite

“…There are many well-understood MANET algorithms. An overview of mutual exclusion protocols for MANETs is given in [9,10]. The vehicular ad hoc network (VANET) [11] is a variant of MANET, where each vehicle is a wireless network enabled node.…”

Section: Introductionmentioning

confidence: 99%

A Token Based Protocol for Mutual Exclusion in Mobile Ad Hoc Networks

Sharma¹,

Bhatia²,

Singh³

2014

Journal of Information Processing Systems

View full text Add to dashboard Cite

Abstract-Resource sharing is a major advantage of distributed computing. However, a distributed computing system may have some physical or virtual resource that may be accessible by a single process at a time. The mutual exclusion issue is to ensure that no more than one process at a time is allowed to access some shared resource. The article proposes a token-based mutual exclusion algorithm for the clustered mobile ad hoc networks (MANETs). The mechanism that is adapted to handle token passing at the inter-cluster level is different from that at the intra-cluster level. It makes our algorithm message efficient and thus suitable for MANETs. In the interest of efficiency, we implemented a centralized token passing scheme at the intra-cluster level. The centralized schemes are inherently failure prone. Thus, we have presented an intracluster token passing scheme that is able to tolerate a failure. In order to enhance reliability, we applied a distributed token circulation scheme at the inter-cluster level. More importantly, the message complexity of the proposed algorithm is independent of N, which is the total number of nodes in the system. Also, under a heavy load, it turns out to be inversely proportional to n, which is the (average) number of nodes per each cluster. We substantiated our claim with the correctness proof, complexity analysis, and simulation results. In the end, we present a simple approach to make our protocol fault tolerant.

show abstract

“…Wireless networks let its users to access services along with information irrespective of their topographical position [1]. Wireless networks can be classified into two types: infrastructureless (ad-hoc) networks and infrastructure network (having Access Points).…”

Section: Introductionmentioning

confidence: 99%

An efficient permission-cum-cluster based distributed mutual exclusion algorithm for mobile adhoc networks

Anchal

Saini

Krishna

2014

2014 International Conference on Parallel, Distributed and Grid Computing

View full text Add to dashboard Cite

Mutual exclusion (Mutex) is a major coordination problem in distributed systems. To handle Mutex, the corresponding solutions are mainly classified into permissionbased, token-based and quorum-based protocols. Mobile Adhoc Networks referred as MANETs introduce new obstacles for designing algorithms that help in solving distributed mutual exclusion problem. To our knowledge, few algorithms have been proposed in the literature which follows token-based or permission-based approach. In this paper, we propose an efficient permission-cum-cluster based distributed mutual exclusion algorithm for mobile adhoc networks. The significant motivation for our algorithm is to ensure that every node should transmit the lowest number of effective messages in the underlying network. Moreover, it will lead to reduced communication delay in order to retrieve the required permissions. We observed that the proposed algorithm outperforms the Mobile_RA algorithm in performance parameters such as synchronization delay, response time as well as message complexity. The results have been substantiated by simulation experiments.

show abstract

Distributed mutual exclusion algorithms in mobile ad hoc networks

Cited by 34 publications

References 25 publications

A hybrid token-based distributed mutual exclusion algorithm using wraparound two-dimensional array logical topology

A hybrid token-based distributed mutual exclusion algorithm using wraparound two-dimensional array logical topology

A Token Based Protocol for Mutual Exclusion in Mobile Ad Hoc Networks

An efficient permission-cum-cluster based distributed mutual exclusion algorithm for mobile adhoc networks

Contact Info

Product

Resources

About