Title: A distributed group mutual exclusion algorithm for IoT systems

Authors: Bouneb Zine El Abidine

Addresses: University of Oum El Bouaghi, Oum El Bouaghi, Algeria

Abstract: The group mutual exclusion problem is a specific instance of the ME problem. In this instance, processes that request the same resources, known as a group, are allowed to be in their critical section (CS) simultaneously. However, processes that request different resources must execute their CS in a mutually exclusive way. In this paper, we consider groups in the context of bound and unbound resources. This classification introduces a new type of distributed mutual exclusion algorithm that is based on the publish/subscribe paradigm. In this paradigm, a process can belong to multiple groups based on the requested resources.

Keywords: publish/subscribe; group mutual exclusion; distributed algorithm; maximal cliques; distributed Bron-Kerbosch algorithm; internet of things; IoT.

DOI: 10.1504/IJAISC.2023.137355

International Journal of Artificial Intelligence and Soft Computing, 2023 Vol.8 No.1, pp.42 - 61

Accepted: 14 Dec 2023
Published online: 13 Mar 2024 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article