Probabilistic analysis of upper bounds for 2-connected distance k-dominating sets in graphs

被引：0
|
作者：
Liu, Zi-Long [1 ]
Tian, Fang [2 ]
Xu, Jun-Ming [3 ]
机构：
[1] Shanghai Univ Sci & Technol, Sch Elect & Comp Engn, Shanghai 200093, Peoples R China
[2] Shanghai Univ Finance & Econ, Dept Appl Math, Shanghai 200433, Peoples R China
[3] Univ Sci & Technol China, Dept Math, Hefei 230026, Peoples R China
来源：
THEORETICAL COMPUTER SCIENCE | 2009年 / 410卷 / 38-40期
关键词：
Connected dominating set; Wireless networks; Fault tolerance; Chernoff inequality; WIRELESS AD HOC; NUMBERS; ALGORITHMS; NETWORKS;
D O I：
10.1016/j.tcs.2009.05.028
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A small virtual backbone which is modeled as the minimum connected dominating set (CDS) problem has been proposed to alleviate the broadcasting storm for efficiency in wireless ad hoc networks. In this paper, we consider a general fault tolerant CDS problem, called an h-connected distance k-dominating set (HCKDS) to balance high efficiency and fault tolerance, and study the upper bound for HCKDS with a probabilistic method for small h and improve the current best results. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码：3804 / 3813
页数：10
相关论文
共 49 条
  • [21] Spanning 2-forests and resistance distance in 2-connected graphs
    Barrett, Wayne
    Evans, Emily J.
    Francis, Amanda E.
    Kempton, Mark
    Sinkovic, John
    DISCRETE APPLIED MATHEMATICS, 2020, 284 : 341 - 352
  • [22] K-dominating sets of P2k+2 x Pn and Pm x Pn
    Klobucar, A
    ARS COMBINATORIA, 2001, 58 : 279 - 288
  • [23] Upper bounds of k-Limited Dominating Broadcasts for Some Grid Graphs
    Chiangpradit, Monchaya
    Noppakaew, Passawan
    Sakuntasathien, Sawanya
    Sanguanphanich, Natwarat
    Sawangtong, Kanisorn
    INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE, 2025, 20 (01): : 151 - 156
  • [24] CONNECTED, LOCALLY 2-CONNECTED, K1,3-FREE GRAPHS ARE PANCONNECTED
    KANETKAR, SV
    RAO, PR
    JOURNAL OF GRAPH THEORY, 1984, 8 (03) : 347 - 353
  • [25] 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
  • [26] An adaptive focal distance tabu search approach for the minimum 2-connected dominating set problem
    Luo, Mao
    Liu, Xianhong
    Wu, Xinyun
    Xiong, Caiquan
    Ke, Yuanzhi
    JOURNAL OF SUPERCOMPUTING, 2025, 81 (03):
  • [27] Analysis on Probabilistic Construction of Connected Dominating Sets over Regular Graph Ensembles
    Nakano, Takafumi
    Wadayama, Tadashi
    PROCEEDINGS OF 2018 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA2018), 2018, : 247 - 251
  • [28] The total-rainbow k-connection of 2-connected graphs
    Liu, Sujuan
    Liu, Yinli
    Xing, Huaming
    An, Mingqiang
    Li, Jing
    ARS COMBINATORIA, 2019, 143 : 237 - 246
  • [29] PATH EXTENSIBILITY OF CONNECTED,LOCALLY 2-CONNECTED K1,3-FREE GRAPHS
    WANG Jianglu(Department of Mathematics
    Systems Science and Mathematical Sciences, 1997, (03) : 267 - 274
  • [30] HAMILTONICITY IN 2-CONNECTED {K1,3 F}-FREE GRAPHS
    LI Guojun(Mathematics Depertment of Yantai Teacher’s College
    SystemsScienceandMathematicalSciences, 1996, (04) : 295 - 305
12345