Connected dominating sets in wireless ad hoc and sensor networks - A comprehensive survey

被引：119
|
作者：
Yu, Jiguo [1 ,2 ]
Wang, Nannan [1 ]
Wang, Guanghui [3 ]
Yu, Dongxiao [4 ]
机构：
[1] Qufu Normal Univ, Sch Comp Sci, Shandong 276826, Peoples R China
[2] Key Lab Intelligent Control Tech Shandong Prov, Shandong 276826, Peoples R China
[3] Shandong Univ, Sch Math & Syst Sci, Jinan 250100, Peoples R China
[4] Univ Hong Kong, Dept Comp Sci, Hong Kong, Peoples R China
来源：
COMPUTER COMMUNICATIONS | 2013年 / 36卷 / 02期
关键词：
Wireless network; Topology control; Virtual backbone network; Connected dominating set (CDS); APPROXIMATION ALGORITHMS; BACKBONE CONSTRUCTION; VIRTUAL BACKBONE; CDS; PARTITION;
D O I：
10.1016/j.comcom.2012.10.005
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Topology control is a fundamental issue in wireless ad hoc and sensor networks. Due to intrinsic characteristic of flatness, hierarchical topology can achieve the scalability and efficiency of a wireless network. To solve this problem, one can construct a virtual backbone network by using a connected dominating (CDS) set of a wireless network. In past few years, efficiently and fast construct a CDS in a wireless network as a virtual backbone has been the main research problem in hierarchical topology control. In this paper, we give a comprehensive survey for CDSs and related problems with various network models and specific applications. To conclude, some open problems and interesting issues in this field are proposed. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码：121 / 134
页数：14
相关论文
共 50 条
  • [21] On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks
    Wu, J
    Gao, M
    Stojmenovic, I
    [J]. PROCEEDINGS OF THE 2001 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, 2001, : 346 - 353
  • [22] On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks
    Wu, J
    Dai, F
    Gao, M
    Stojmenovic, I
    [J]. JOURNAL OF COMMUNICATIONS AND NETWORKS, 2002, 4 (01) : 59 - 70
  • [23] A distributed algorithm for connecting dominating sets in wireless ad hoc networks
    Cao Yongtao
    He Chen
    Wang Jun
    Zheng Chunlei
    [J]. 2006 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS PROCEEDINGS, VOLS 1-4: VOL 1: SIGNAL PROCESSING, 2006, : 1472 - +
  • [24] Minimum Connected Dominating Set Algorithms for Ad Hoc Sensor Networks
    Sun, Xuemei
    Yang, Yongxin
    Ma, Maode
    [J]. SENSORS, 2019, 19 (08)
  • [25] Efficient broadcast in mobile ad hoc networks using connected dominating sets
    [J]. Peng, W. ({wpeng,xclu}@nudt.edu.cn), 2001, Chinese Academy of Sciences (12):
  • [26] Connected d-hop dominating sets in mobile ad hoc networks
    Nguyen, Trac N.
    Huynh, Dung T.
    [J]. 2006 4TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC AND WIRELESS NETWORKS, VOLS 1 AND 2, 2006, : 138 - +
  • [27] Efficient Localized Protocols to Compute Connected Dominating Sets for Ad Hoc Networks
    Almahorg, Khalid Ateyia M.
    Naik, Sagar
    Shen, Xuemin
    [J]. 2010 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE GLOBECOM 2010, 2010,
  • [28] Distributed Construction of Connected Dominating Sets Optimized by Minimum-Weight Spanning Tree in Wireless Ad-hoc Sensor Networks
    Ren, Sijun
    Yi, Ping
    Hong, Dapeng
    Wu, Yue
    Zhu, Ting
    [J]. 2014 IEEE 17TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING (CSE), 2014, : 901 - 908
  • [29] Routing in ad-hoc networks using minimum connected dominating sets
    Das, B
    Bharghavan, V
    [J]. ICC'97: 1997 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS - TOWARDS THE KNOWLEDGE MILLENNIUM, CONFERENCE RECORD - VOLS 1-3, 1997, : 376 - 380
  • [30] On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
    Dai, Fei
    Wu, Jie
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2006, 66 (07) : 947 - 958
12345