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 条
  • [1] Distributed Connected Dominating Sets in Unit Square and Disk Graphs
    Gorain, Barun
    Mondal, Kaushik
    Pandit, Supantha
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2022, 2022, 13571 : 346 - 358
  • [2] Dominating Sets and Connected Dominating Sets in Dynamic Graphs
    Hjuler, Niklas
    Italiano, Giuseppe F.
    Parotsidis, Nikos
    Saulpic, David
    36TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2019), 2019,
  • [3] Minimum connected dominating sets and maximal independent sets in unit disk graphs
    Wu, WL
    Du, HW
    Jia, XH
    Li, YS
    Huang, SCH
    THEORETICAL COMPUTER SCIENCE, 2006, 352 (1-3) : 1 - 7
  • [4] Local algorithms for dominating and connected dominating sets of unit disk graphs with location aware nodes
    Czyzowicz, J.
    Dobrev, S.
    Fevens, T.
    Gonzalez-Aguilar, H.
    Kranakis, E.
    Opatrny, J.
    Urrutia, J.
    LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 : 158 - +
  • [5] New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
    Zou, Feng
    Wang, Yuexuan
    Xu, Xiao-Hua
    Li, Xianyue
    Du, Hongwei
    Wan, Pengjun
    Wu, Weili
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (03) : 198 - 208
  • [6] On approximation algorithms of k-connected m-dominating sets in disk graphs
    Thai, My T.
    Zhang, Ning
    Tiwari, Ravi
    Xu, Xiaochun
    THEORETICAL COMPUTER SCIENCE, 2007, 385 (1-3) : 49 - 59
  • [7] Approximation Algorithms for Highly Connected Multi-dominating Sets in Unit Disk Graphs
    Fukunaga, Takuro
    ALGORITHMICA, 2018, 80 (11) : 3270 - 3292
  • [8] Approximation Algorithms for Highly Connected Multi-dominating Sets in Unit Disk Graphs
    Takuro Fukunaga
    Algorithmica, 2018, 80 : 3270 - 3292
  • [9] On the number of outer connected dominating sets of graphs
    Alikhani, S.
    Akhbari, M. H.
    Eslahchi, C.
    Hasni, R.
    UTILITAS MATHEMATICA, 2013, 91 : 99 - 107
  • [10] Linear separation of connected dominating sets in graphs
    Chiarelli, Nina
    Milanic, Martin
    ARS MATHEMATICA CONTEMPORANEA, 2019, 16 (02) : 487 - 525
12345