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
相关论文
共 48 条
12345