Ad hoc distributed mutual exclusion algorithm based on token-asking

Wang, Zheng; Liu, Song; Li, Meian

doi:10.1016/s1004-4132(07)60104-2

Cited by 9 publications

(2 citation statements)

References 6 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

“…The problem with mutual exclusion which occurs is when some two or more processes or devices try to work at same instant of time simultaneously [1]. When they compete for the critical section at the same time, no one of the devices get chance to share resources, and none of them can't use it fruitfully [2,3,4].So, to prevent from this issue, a distributed algorithms is designed to manage the critical region [5]. Critical section (CS) is a code in which sharing of resources is done or accessed.…”

Section: Introductionmentioning

confidence: 99%

Literature Survey on Distributed Mutual Exclusion Algorithm for Mobile Ad-Hoc Network

Singh¹,

Naag²

2015

IJERT

View full text Add to dashboard Cite

In a distributed system several devices are connected to each other to share resources like software's or hardware's, which makes Mutual Exclusion essential for distributed system during the sharing process. The region where all the sharing takes place is the Critical region. Mutual Exclusion on Distributed system allows critical resource to be shared between different mobile nodes in a Mobile Ad-Hoc Network. In this the region is divided and in a logical way sharing is done. Critical section can be defined as a state when a node or device is actually sharing or using the resources which are required in the process of communicating with each other. A request is involved for making decision regarding that which node or device would enter critical section. This request can be made to neighboring nodes or by imposing any algorithm which can make it possible the sharing process to be fair for each node i.e. no node should wait for an infinite time for its turn or no node should get infinite access to resources. In this paper, several mutual exclusion algorithms are discussed by comparing their advantages and disadvantages. Section 1 includes the introduction of the Distributed Mutual Exclusion problem and its categories. In Section 2 the basic requirements for a system to attain mutual exclusion. In section 3 discussions of all the algorithms is covered.

show abstract

Handling of resource allocation in flying ad hoc network through dynamic graph modeling

Parihar

Chakraborty

2022

Multimed Tools Appl

View full text Add to dashboard Cite

Ad hoc distributed mutual exclusion algorithm based on token-asking

Cited by 9 publications

References 6 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

Literature Survey on Distributed Mutual Exclusion Algorithm for Mobile Ad-Hoc Network

Handling of resource allocation in flying ad hoc network through dynamic graph modeling

Contact Info

Product

Resources

About