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

Authors:
Weiping Shang;Pengjun Wan;Frances Yao;Xiaodong Hu
Affiliations:
Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 10080, China and Department of Computer Science, City University of Hong Kong, Hong Kong;Department of Computer Science, Illinois Institute of Technology, Chicago, IL 60616, USA;Department of Computer Science, City University of Hong Kong, Hong Kong;Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 10080, China
Venue:
Theoretical Computer Science
Year:
2007

Citing 6
Cited 8

Hardness results and approximation algorithms of k-tuple domination in graphs

Information Processing Letters
Distributed construction of connected dominating set in wireless ad hoc networks

Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Deploying sensor networks with guaranteed capacity and fault tolerance

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
On greedy construction of connected dominating sets in wireless networks: Research Articles

Wireless Communications & Mobile Computing - RRM for Next-Generation Wireless and Mobile Communication Systems
Minimum connected dominating sets and maximal independent sets in unit disk graphs

Theoretical Computer Science
On the construction of 2-connected virtual backbone in wireless networks

IEEE Transactions on Wireless Communications

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

Theoretical Computer Science
Algorithms for minimum m-connected k-dominating set problem

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Deploying sensor networks with guaranteed fault tolerance

IEEE/ACM Transactions on Networking (TON)
Two algorithms for minimum 2-connected r-hop dominating set

Information Processing Letters
Polynomial time approximation schemes for minimum disk cover problems

Journal of Combinatorial Optimization
Note: On the (h,k)-domination numbers of iterated line digraphs

Discrete Applied Mathematics
Review: Broadcasting based on dominated connecting sets with MPR in a realistic environment for WSNs & ad hoc

Journal of Network and Computer Applications
Randomized algorithms and upper bounds for multiple domination in graphs and networks

Discrete Applied Mathematics

Quantified Score

Hi-index	5.23

Visualization

Abstract

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.