A new constant factor approximation for computing 3-connected m-dominating sets in homogeneous wireless networks

Authors:
Donghyun Kim;Wei Wang;Xianyue Li;Zhao Zhang;Weili Wu
Affiliations:
Department of Computer Science, The University of Texas at Dallas, Richardson, Texas;Department of Mathematics, Xi'an Jiaotong University, Xi'an, P.R. of China;School of Mathematics and Statistics, Lanzhou University, Lanzhou, Gansu, P.R. of China;College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang, P.R. of China;Department of Computer Science, The University of Texas at Dallas, Richardson, Texas
Venue:
INFOCOM'10 Proceedings of the 29th conference on Information communications
Year:
2010

Citing 14
Cited 3

Unit disk graphs

Discrete Mathematics - Topics on domination
The broadcast storm problem in a mobile ad hoc network

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
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
A Study of Recent Research Trends and Experimental Guidelines in Mobile Ad Hoc Networks

AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
Minimum connected dominating sets and maximal independent sets in unit disk graphs

Theoretical Computer Science
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges

IEEE Transactions on Mobile Computing
On approximation algorithms of k-connected m-dominating sets in disk graphs

Theoretical Computer Science
Approximation Algorithms for Connected Dominating Sets

Algorithmica
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
Trade-off scheme for fault tolerant connected dominating sets on size and diameter

Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
On the construction of 2-connected virtual backbone in wireless networks

IEEE Transactions on Wireless Communications
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences
A survey on sensor networks

IEEE Communications Magazine

Load-balanced CDS construction in wireless sensor networks via genetic algorithm

International Journal of Sensor Networks
Mitigating the impact of node mobility using mobile backbone for heterogeneous MANETs

Computer Communications
Review: Connected dominating sets in wireless ad hoc and sensor networks - A comprehensive survey

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the problem of constructing quality fault-tolerant Connected Dominating Sets (CDSs) in homogeneous wireless networks, which can be defined as minimum k-Connected m-Dominating Set ((k,m)-CDS) problem in Unit Disk Graphs (UDGs). We found that every existing approximation algorithm for this problem is incomplete for k ≥ 3 in a sense that it does not generate a feasible solution in some UDGs. Based on these observations, we propose a new polynomial time approximation algorithm for computing (3, m)-CDSs. We also show that our algorithm is correct and its approximation ratio is a constant.