PTAS for minimum connected dominating set with routing cost constraint in wireless sensor networks

Authors:
Hongwei Du;Qiang Ye;Jioafei Zhong;Yuexuan Wang;Wonjun Lee;Haesun Park
Affiliations:
Dept. of Computer Science and Information Science, University of Prince Edward Island, Canada;Dept. of Computer Science and Information Science, University of Prince Edward Island, Canada;Department of Computer Science, University of Texas at Dallas, Richardson, TX;Institute for Theoretical Computer Science, Tsinghua University, Beijing, P.R. China;Dept. of Computer Science and Engineering, Korea University, Seoul, Republic of Korea;School of Computational Science and Engineering, George Institute of Technology
Venue:
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Year:
2010

Citing 6
Cited 0

On calculating connected dominating set for efficient routing in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Power Efficient Topologies for Wireless Sensor Networks

ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
A greedy approximation for minimum connected dominating sets

Theoretical Computer Science
Approximation Algorithms for Connected Dominating Sets

Algorithmica
Analysis of greedy approximations with nonsubmodular potential functions

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks

ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

To reduce routing cost and to improve road load balance, we study a problem of minimizing size of connected dominating set D under constraint that for any two nodes u and v, the routing cost through D is within a factor of α from the minimum, the cost of the shortest path between u and v. We show that for α ≥ 5, this problem in unit disk graphs has a polynomial-time approximation scheme, that is, for any ε 0, there is a polynomial-time (1 + ε)-approximation.