Constructing d-Robust Connected Dominating Sets in Wireless Sensor Networks With Unstable Transmission Ranges

A connected dominating set (CDS) can act as a virtual backbone (VB) in a wireless sensor network (WSN). The overhead in a WSN is usually determined by the size of the corresponding VB. However, the construction of minimum CDSs (MCDSs) has been proven to be an NP-hard problem. Thus, most researchers...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications Vol. 69; no. 1; pp. 398 - 415
Main Authors: Liang, Xinyu, Liang, Jiarong, Zhang, Weiguang
Format: Journal Article
Language:English
Published: New York IEEE 01.01.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
approximation algorithm
Approximation algorithms
connected dominating set
Environmental factors
Interference
NP-hard problem
Optimized production technology
Robustness
unstable transmission ranges
Wireless networks
Wireless sensor network
Wireless sensor networks
ISSN:0090-6778, 1558-0857
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A connected dominating set (CDS) can act as a virtual backbone (VB) in a wireless sensor network (WSN). The overhead in a WSN is usually determined by the size of the corresponding VB. However, the construction of minimum CDSs (MCDSs) has been proven to be an NP-hard problem. Thus, most researchers use approximation algorithms to find smaller CDSs. In certain applications, the transmission radii of some nodes in the network are unstable due to certain environmental factors such as obstacles, signal interference and node movement. Thus, the robustness of VBs in WSNs should be considered. In this paper, we propose the concept of a <inline-formula> <tex-math notation="LaTeX">d </tex-math></inline-formula>-robust CDS and corresponding algorithms to construct <inline-formula> <tex-math notation="LaTeX">d </tex-math></inline-formula>-robust CDSs in WSNs with unstable transmission ranges. We propose algorithms for a <inline-formula> <tex-math notation="LaTeX">d </tex-math></inline-formula>-robust CDS that is bounded by <inline-formula> <tex-math notation="LaTeX">[{40.68/(1-d)^{2}+10.17}]\cdot opt+[{31.32/(1-d)^{2}+7.83}] </tex-math></inline-formula>, where <inline-formula> <tex-math notation="LaTeX">opt </tex-math></inline-formula> is the size of the MCDS and <inline-formula> <tex-math notation="LaTeX">d \in [0,1 </tex-math></inline-formula>). Through simulations, we show the relationship between the size of the <inline-formula> <tex-math notation="LaTeX">d </tex-math></inline-formula>-robust CDS and the value of <inline-formula> <tex-math notation="LaTeX">d </tex-math></inline-formula> and compare our algorithms with existing algorithms in terms of the robustness degree of the CDS. The results show that the CDSs produced by our algorithms exhibit better robustness.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2020.3030930