The problem of mutual exclusion is a highly focused area in the distributed architecture. To
avoid inconsistency in data, mutual exclusion ensures that no two processes running on …

The problem of mutual exclusion has been extensively studied in distributed systems. The
proposed solutions can be mainly classified in consensus based and token based protocols …

Abstract The Local Mutual Exclusion (LME) problem is a variant of classical Mutual
Exclusion (ME) problem and can be considered as an extension of dining philosopher …

A distributed mutual exclusion algorithm based on token exchange and well suited for
mobile ad-hoc networks is presented along with a simulation study. The algorithm is based …

Mutual exclusion (ME) is a highly researched problem in distributed computing systems. In
the mutual exclusion problem, no two nodes can use critical resource simultaneously …

In this paper, we propose a permission-based message efficient mutual exclusion (MUTEX)
algorithm for mobile ad hoc networks (MANETs). To reduce messages cost, the algorithm …

In a mobile ad hoc network, nodes that are geographically close may need to compete for
exclusive access to a shared resource. This paper proposes an abstraction of this problem …

Resource allocation involves deciding how to divide a resource of limited availability across
multiple demands in a way that optimizes current objectives (eg, allocating a processor's …

Emerging edge and IoT networks are characterized by churn, wherein nodes join, leave,
and fail continuously. Together with flaky network links and delays in edge and IoT systems …

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 …