Algorithms for minimum m-connected k-dominating set problem

Authors:
Weiping Shang;Frances Yao;Pengjun Wan;Xiaodong Hu
Affiliations:
Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing, China and Department of Computer Science, City University of Hong Kong;Department of Computer Science, City University of Hong Kong;Department of Computer Science, Illinois Institute of Technology, Chicago;Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing, China
Venue:
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Year:
2007

Citing 8
Cited 4

Distributed construction of connected dominating set in wireless ad hoc networks

Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
On Constructing k-Connected k-Dominating Set in Wireless Networks

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
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
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks

ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Algorithms for minimum m-connected k-tuple dominating set problem

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

IEEE Transactions on Wireless Communications

Construction algorithms for k-connected m-dominating sets in wireless sensor networks

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Blackbone2, an efficient deterministic algorithm for creating 2-connected m-dominating set-based backbones in ad hoc networks

Proceedings of the 7th ACM international symposium on Mobility management and wireless access
On quantifying the quality of CDS-based virtual backbones in mobile ad hoc networks

Proceedings of the 8th ACM international workshop on Mobility management and wireless access
On the construction of k-connected m-dominating sets in wireless networks

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In wireless sensor networks, 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-dominating set problem, which is a general version of minimum CDS problem with m = 1 and k = 1. In this paper we will propose some approximation algorithms for this problem that beat the current best performance ratios.