A Greedy Algorithm on Constructing the Minimum Connected Dominating Set in Wireless Network-Reference-Cited by-同舟云学术

A Greedy Algorithm on Constructing the Minimum Connected Dominating Set in Wireless Network

Published:2016-07-01 Issue:7 Volume:12 Page:1703201
ISSN:1550-1477
Container-title:International Journal of Distributed Sensor Networks
language:en
Short-container-title:International Journal of Distributed Sensor Networks

Author:

Fu Deqian¹²^ORCID,Han Lihua¹,Yang Zifen¹,Jhang Seong Tae³^ORCID

Affiliation:

1. School of Informatics, Linyi University, Linyi 276005, China

2. Provincial Key Laboratory for Network Based Intelligent Computing, University of Jinan, Jinnan 250022, China

3. Department of Computer, The University of Suwon, Hwaseong-si, Gyeonggi-do 445-743, Republic of Korea

Abstract

In the past 20 years, the connected dominating set (CDS) as a virtual backbone network has been widely used in the wireless networks. Many researchers have been devoted to designing approximate algorithms for CDS problem since constructing the minimum CDS (MCDS) is NP-hard problem. Different from the most existing algorithms with two phases, we employ greedy strategy to design a centralized algorithm GR_CDS in only one phase to get MCDS, with the time complexity of [Formula: see text]. Afterwards, another algorithm P_CDS is designed for pruning redundant nodes in the obtained MCDS with the time complexity of [Formula: see text].

Publisher

SAGE Publications

Subject

Computer Networks and Communications,General Engineering

Link

http://journals.sagepub.com/doi/pdf/10.1177/155014771703201

Reference24 articles.

1. Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks

2. A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks

3. A design concept for reliable mobile radio networks with frequency hopping signaling

4. Multi-resolution state retrieval in sensor networks

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Dynamic Topology Optimization Method for Tactical Edge Networks Based on Virtual Backbone Networks;Sensors;2024-08-24

2. Adaptive $ D$-Hop Connected Dominating Set in Highly Dynamic Flying Ad-Hoc Networks;IEEE Transactions on Network Science and Engineering;2021-07-01

3. Feature Engineering for Machine Learning and Deep Learning Assisted Wireless Communication;Metaheuristics in Machine Learning: Theory and Applications;2021

4. An Efficient Energy Aware Semigraph-Based Total Edge Domination Routing Algorithm in Wireless Sensor Networks;Wireless Personal Communications;2020-11-23

5. DCA-DS: A Distributed Clustering Algorithm Based on Dominating Set for Internet of Vehicles;Wireless Personal Communications;2020-06-23