Distributed Self-Stabilizing Capacitated Maximal Independent Set Construction in Wireless Sensor Networks

Arapoglu, Ozkan; Dağdeviren, Orhan

doi:10.1007/s11277-020-07528-3

Cited by 2 publications

(3 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• Although finding dominating sets of a graph is a comprehensively studied problem since the graph theory emerged [17], [20]- [30], as far as we know, a selfstabilizing distributed algorithm for the CapDS problem was not developed. Hereby, we proposed the first capacitated MIS and capacitated CDS algorithms in earlier works [31], [32]. Note that any maximal independent set is also a dominating set.…”

Section: Introductionmentioning

confidence: 99%

ACapDS: An Energy-Efficient and Fault-Tolerant Distributed Capacitated Dominating Set Algorithm for Industrial IoT

Arapoglu,

Cabuk,

Dagdeviren

et al. 2024

IEEE Access

Self Cite

View full text Add to dashboard Cite

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 faulttolerant 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.INDEX TERMS Industrial Internet of Things, IIoT, minimum capacitated dominating set, distributed algorithms, self-stabilizing algorithms, fault tolerance.

show abstract

Section: Introductionmentioning

confidence: 99%

ACapDS: An Energy-Efficient and Fault-Tolerant Distributed Capacitated Dominating Set Algorithm for Industrial IoT

Arapoglu,

Cabuk,

Dagdeviren

et al. 2024

IEEE Access

Self Cite

View full text Add to dashboard Cite

show abstract

“…7 In the WSNs, sensor nodes gather, 8,9 transmit, 10,11 and fuse data. [12][13][14][15] But limited energy and other factors limit the normal operation of WSNs. 16 A challenge in WSNs is to reduce communication and computational costs and ensure a high level of coverage 17 and connectivity.…”

Section: Introductionmentioning

confidence: 99%

“…18 In order to solve this problem and make the network work longer, 19,20 many different methods have been studied. Some of these methods propose more reasonable energy management schemes, [21][22][23] some study clustering schemes 24 , some research new topologies, 25,26 and some study communication protocols. 27,28 In addition, the uncertain factors such as uncertain environment also affect WSNs.…”

Section: Introductionmentioning

confidence: 99%

An attack-defense game based reliability analysis approach for wireless sensor networks

Jiang

Deng

2019

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Wireless sensor networks play an important role in daily life and have been applied in diverse fields. In practice, malware tries to infect sensor nodes, while wireless sensor network prevents from attacking. This article establishes a new attack-defense game based on Stackelberg game. In this game, malware selects its strategy of attacking first, and then wireless sensor network makes decision after observing the action of malware. This game considers the situation in which malware is more dominant than wireless sensor network. Then this game is solved and an equilibrium solution is calculated, which is the best strategy for malware and wireless sensor network to maximize their payoffs. With infection probability and defense probability, mean time to failure of a sensor node is computed and is used to analyze the reliability of wireless sensor network. The experiments show the influence of true-positive rate and false-positive rate on the equilibrium solution of game and the reliability of wireless sensor network. Finally, the proposed method is compared with the existing method based on a simultaneous game.

show abstract

Distributed Self-Stabilizing Capacitated Maximal Independent Set Construction in Wireless Sensor Networks

Cited by 2 publications

References 44 publications

ACapDS: An Energy-Efficient and Fault-Tolerant Distributed Capacitated Dominating Set Algorithm for Industrial IoT

ACapDS: An Energy-Efficient and Fault-Tolerant Distributed Capacitated Dominating Set Algorithm for Industrial IoT

An attack-defense game based reliability analysis approach for wireless sensor networks

Contact Info

Product

Resources

About