Algorithms for minimum m-connected k-tuple dominating set problem

doi:10.1016/j.tcs.2007.04.035

CSpace > 应用数学研究所

	Algorithms for minimum m-connected k-tuple dominating set problem
	Shang, Weiping ; Wan, Pengjun ; Yao, Frances ; Hu, Xiaodong
	2007-08-22
发表期刊	THEORETICAL COMPUTER SCIENCE
ISSN	0304-3975
卷号	381 期号:1-3 页码:241-247
摘要	In wireless sensor networks, a virtual backbone has been proposed as the routing infrastructure to alleviate the broadcasting storm problem and perform some other tasks such as area monitoring. Previous work in this area has mainly focused on how to set up a small virtual backbone for high efficiency, which is modelled as the minimum Connected Dominating Set (CDS) problem. In this paper we consider how to establish a small virtual backbone to balance efficiency and fault tolerance. This problem can be formalized as the minimum m-connected k-tuple dominating set problem, which is a general version of minimum CDS problem with m = 1 and k = 1. We propose three centralized algorithms with small approximation ratios for small m and improve the current best results for small k. (c) 2007 Elsevier B.V. All rights reserved.
关键词	connected dominating set approximation algorithm k-vertex connectivity wireless sensor networks
DOI	10.1016/j.tcs.2007.04.035
语种	英语
WOS研究方向	Computer Science
WOS类目	Computer Science, Theory & Methods
WOS记录号	WOS:000248966100019
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/5060
专题	应用数学研究所
通讯作者	Shang, Weiping
作者单位	1.Chinese Acad Sci, Acad Math & Syst Sci, Inst Appl Math, Beijing 10080, Peoples R China 2.IIT, Dept Comp Sci, Chicago, IL 60616 USA 3.City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
推荐引用方式 GB/T 7714	Shang, Weiping,Wan, Pengjun,Yao, Frances,et al. Algorithms for minimum m-connected k-tuple dominating set problem[J]. THEORETICAL COMPUTER SCIENCE,2007,381(1-3):241-247.
APA	Shang, Weiping,Wan, Pengjun,Yao, Frances,&Hu, Xiaodong.(2007).Algorithms for minimum m-connected k-tuple dominating set problem.THEORETICAL COMPUTER SCIENCE,381(1-3),241-247.
MLA	Shang, Weiping,et al."Algorithms for minimum m-connected k-tuple dominating set problem".THEORETICAL COMPUTER SCIENCE 381.1-3(2007):241-247.