|
Title
|
|
|
|
ACapDS : an energy-efficient and fault-tolerant distributed capacitated dominating set algorithm for industrial IoT
| |
|
Author
|
|
|
|
| |
|
Abstract
|
|
|
|
| Design and analysis of energy-efficient and fault-tolerant dominating set (DS) algorithms are vital tasks for Industrial Internet of Things (IIoT) scenarios as operational efficiency is a key objective in most industries. Such algorithms must maintain topology control, clustering, routing, and data aggregation. An IIoT deployment is said to pose the self-stabilization property if it can always recover to a steady state in a bounded time without any interruption whenever it is started at an unstable state. Self-stabilization is a fruitful principle for building fault-tolerant IIoT deployments. This paper proposes a novel distributed fault-tolerant capacitated DS (capDS) algorithm for IIoT systems. The algorithm is the first self-stabilizing capDS approach to the best of our knowledge. Proofs concerning the asynchronous behaviors of the algorithm, as well as the self-stabilization feature with regard to convergence and closure properties, are provided. Besides, our theoretical analysis showed that the algorithm’s approximation ratio is 6 for IIoT setups implemented as unit disk graphs. Measurements made using our testbed of 40 IRIS motes and the extensive TOSSIM simulations revealed that the proposed algorithm is up to 55% better in terms of coefficient of variation, requires up to 61% fewer moves, causes up to 13% less data traffic, and consumes up to 14% less energy when compared to a randomized approach and a minimum ID priority-based approach. |
| |
|
Language
|
|
|
|
English
| |
|
Source (journal)
|
|
|
|
IEEE access. - New York, N.Y., 2013, currens
| |
|
Publication
|
|
|
|
New York, N.Y.
:
IEEE
,
2024
| |
|
ISSN
|
|
|
|
2169-3536
| |
|
DOI
|
|
|
|
10.1109/ACCESS.2024.3374409
| |
|
Volume/pages
|
|
|
|
12
(2024)
, p. 38816-38829
| |
|
Article Reference
|
|
|
|
10462082
| |
|
ISI
|
|
|
|
001189820500001
| |
|
Full text (Publisher's DOI)
|
|
|
|
| |
|
Full text (open access)
|
|
|
|
| |
|