Connected dominating sets in disk graphs with bidirectional links

被引：0
|
作者：
Thai, MT [1 ]
Du, DZ [1 ]
机构：
[1] Univ Minnesota, Dept Comp Sci & Engn, Minneapolis, MN 55455 USA
来源：
IEEE COMMUNICATIONS LETTERS | 2006年 / 10卷 / 03期
关键词：
connected dominating set; independent set; disk graphs; wireless ad hoc networks;
D O I：
10.1109/LCOMM.2006.03024
中图分类号：
TN [电子技术、通信技术];
学科分类号：
0809 ;
摘要：
In this paper, we study the Connected Dominating Set (CDS) problem in disk graphs. The CDS problem has a significant impact on an efficient design of routing protocols in wireless networks. This problem has been studied extensively in unit disk graphs, in which each node has the same transmission range. However, in wireless ad hoc networks, the transmission ranges of all nodes are not necessary equal. In this paper, we introduce the CDS problem in disk graphs and present a constant approximation algorithm which can be implemented as a distributed algorithm.
引用
收藏
页码：138 / 140
页数：3
相关论文
共 50 条
  • [31] Approximation Algorithms for the Connected Dominating Set Problem in Unit Disk Graphs
    Gang Lu MingTian Zhou Yong Tang MingYuan Zhao XinZheng Niu and Kun She are with School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China
    Journal of Electronic Science and Technology of China, 2009, 7 (03) : 214 - 222
  • [32] Approximation Algorithms for the Connected Dominating Set Problem in Unit Disk Graphs
    Gang Lu
    Journal of Electronic Science and Technology, 2009, 7 (03) : 214 - 222
  • [33] Construction of distributed connected dominating sets in growth-bounded graphs
    Qian, Jiansheng
    Sun, Yanjing
    ICIEA 2008: 3RD IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS, PROCEEDINGS, VOLS 1-3, 2008, : 1430 - 1434
  • [34] Centrality-Based Connected Dominating Sets for Complex Network Graphs
    Meghanathan, Natarajan
    INTERNATIONAL JOURNAL OF INTERDISCIPLINARY TELECOMMUNICATIONS AND NETWORKING, 2014, 6 (02) : 1 - 24
  • [35] On dominating sets and independent sets of graphs
    Harant, J
    Pruchnewski, A
    Voigt, M
    COMBINATORICS PROBABILITY & COMPUTING, 1999, 8 (06): : 547 - 553
  • [36] Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs
    Xing, Kai
    Cheng, Wei
    Park, E. K.
    Rotenstreich, Shmuel
    28TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, VOLS 1 AND 2, PROCEEDINGS, 2008, : 673 - +
  • [37] Disjoint dominating and total dominating sets in graphs
    Henning, Michael A.
    Loewenstein, Christian
    Rautenbach, Dieter
    Southey, Justin
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (15) : 1615 - 1623
  • [38] A Variant of Connected Dominating Set in Unit Disk Graphs for Applications in Communication Networks
    Djenouri, Djamel
    Bagaa, Miloud
    2015 IEEE INTERNATIONAL CONFERENCE ON ELECTRO/INFORMATION TECHNOLOGY (EIT), 2015, : 457 - 461
  • [39] 2-Edge connected dominating sets and 2-Connected dominating sets of a graph
    Li, Hengzhe
    Yang, Yuxing
    Wu, Baoyindureng
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (02) : 713 - 724
  • [40] 2-Edge connected dominating sets and 2-Connected dominating sets of a graph
    Hengzhe Li
    Yuxing Yang
    Baoyindureng Wu
    Journal of Combinatorial Optimization, 2016, 31 : 713 - 724
12345