On Constructing Strongly Connected Dominating and Absorbing Set in 3-Dimensional Wireless Ad Hoc Networks

Liang, Jiarong; Yi, Meng; Zhang, Weiguang; Li, Yanyan; Liang, Xuemei; Qin, Bin

doi:10.1155/2020/9189645

Cited by 5 publications

(2 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, solving these problems attracted attention of researchers because the CDS can optimize the energy consumption, route data fast, and prolong the lifetime of the wireless sensor network. So, minimizing the size of the CDS which is denoted by the MCDS problem is an important research direction [ 4 , 14 , 15 ]. Since the MCDS problem is an NP-hard, there is no exact efficient algorithm available [ 16 ].…”

Section: Related Workmentioning

confidence: 99%

Wireless Sensor Networks Fault-Tolerance Based on Graph Domination with Parallel Scatter Search

Hedar

Abdulaziz

Mabrouk

et al. 2020

Sensors

View full text Add to dashboard Cite

In wireless sensor/ad hoc networks, all wireless nodes frequently flood the network channel by transmitting control messages causing “broadcast storm problem”. Thus, inspired by the physical backbone in wired networks, a Virtual Backbone (VB) in wireless sensor/ad hoc networks can help achieve efficient broadcasting. A well-known and well-researched approach for constructing virtual backbone is solving the Connected Dominating Set (CDS) problem. Furthermore, minimizing the size of the CDS is a significant research issue. We propose a new parallel scatter search algorithm with elite and featured cores for constructing a wireless sensor/ad hoc network virtual backbones based on finding minimum connected dominating sets of wireless nodes. Also, we addressed the problem of VB node/nodes failure by either deploying a previously computed VBs provided by the main pSSEF algorithm that does not contain the failed node/nodes, or by using our proposed FT-pSSEF algorithm repairing the broken VBs. Finally, as nodes in a VB incur extra load of communication and computation, this leads to faster power consumption compared to other nodes in the network. Consequently, we propose the virtual backbone scheduling algorithm SC-pSSEF which aims to find multiple VBs using the VBs provided by the pSSEF algorithm and switch between them periodically to prolong the network life time.

show abstract

Section: Related Workmentioning

confidence: 99%

Wireless Sensor Networks Fault-Tolerance Based on Graph Domination with Parallel Scatter Search

Hedar

Abdulaziz

Mabrouk

et al. 2020

Sensors

View full text Add to dashboard Cite

show abstract

“…Hence, when we construct an MCDS for a graph, it is necessary to consider the routing cost in the MCDS. Some research results on the MCDS problem considering the routing cost for a UDG have been obtained in [15][16][17][18][19].…”

Section: Introductionmentioning

confidence: 99%

The Construction of a Virtual Backbone with a Bounded Diameter in a Wireless Network

Liang

et al. 2020

Wireless Communications and Mobile Computing

Self Cite

View full text Add to dashboard Cite

We usually use a digraph to represent a wireless network (WN). Correspondingly, a connected dominating set (CDS) of the digraph is usually used to denote a virtual backbone (VB) of the corresponding WN. In this article, focusing on the problem of a minimum strongly connected dominating and absorbing set (MSCDAS) with a bounded diameter (or guaranteed routing cost) for a digraph, which is strongly connected, we introduce two algorithms. One is called the guaranteed routing cost strongly connected dominating and absorbing set (GOC-SCDAS), which can generate a strongly connected dominating and absorbing set (SCDAS) with a performance ratio 14.4k+1/22 in respect of the optimal solution. Another is called the α guaranteed routing cost strongly connected bidirectional dominating and absorbing set (α-GOC-SCBDAS), which can generate a strongly connected bidirectional dominating and absorbing set (SCBDAS) with a performance ratio 8.8443k+1/22k+1/22 in respect of the optimal solution and a better routing cost, where k=rmax/rmin and rmin,rmax is the transmission range of nodes in the network. Through the simulation experiments, we obtain the conclusion that in terms of the diameter and average routing path length (ARPL) of CDS, the outputs of our algorithms are better than those of the algorithm in (Du et al. 2006).

show abstract

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

Arapoglu,

Cabuk,

Dagdeviren

et al. 2024

IEEE Access

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

On Constructing Strongly Connected Dominating and Absorbing Set in 3-Dimensional Wireless Ad Hoc Networks

Cited by 5 publications

References 31 publications

Wireless Sensor Networks Fault-Tolerance Based on Graph Domination with Parallel Scatter Search

Wireless Sensor Networks Fault-Tolerance Based on Graph Domination with Parallel Scatter Search

The Construction of a Virtual Backbone with a Bounded Diameter in a Wireless Network

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

Contact Info

Product

Resources

About