Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks

Authors:
Hongwei Du;Qiang Ye;Jiaofei Zhong;Yuexuan Wang;Wonjun Lee;Haesun Park
Affiliations:
Department of Computer Science and Technology, Harbin Institute of Technology, Shenzhen Graduate School, China;Department of Computer Science and Information Science, University of Prince Edward Island, Canada;Department of Computer Science, University of Texas at Dallas, Richardson, TX 75080, USA;Institute for Theoretical Computer Science, Tsinghua University, Beijing, 100084, China;Department of Computer Science and Engineering, Korea University, Seoul, Republic of Korea;School of Computational Science and Engineering, George Institute of Technology, USA
Venue:
Theoretical Computer Science
Year:
2012

Citing 7
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
Efficient Algorithms for Topology Control Problem with Routing Cost Constraints in Wireless Networks

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	5.23

Visualization

Abstract

To reduce routing cost in wireless sensor networks, we study a problem of minimizing the size of connected dominating set D under constraint that for any two nodes u and v, m"D(u,v)@?@a@?m(u,v) where @a is a constant, m"D(u,v) is the number of intermediate nodes on a shortest path connecting u and v through D and m(u,v) is the number of intermediate nodes in a shortest path between u and v in a given unit disk graph. We show that for @a=5, this problem has a polynomial-time approximation scheme, that is, for any @e0, there is a polynomial-time (1+@e)-approximation.