Wireless coverage via dynamic programming

Authors:
Xiaohua Xu;Zhu Wang
Affiliations:
Illinois Institute of Technology, Chicago;Illinois Institute of Technology, Chicago
Venue:
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Year:
2011

Citing 14
Cited 0

The NP-completeness column: an ongoing guide

Journal of Algorithms
Approximation schemes for covering and packing problems in image processing and VLSI

Journal of the ACM (JACM)
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Selecting forwarding neighbors in wireless ad hoc networks

Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks

Proceedings of the 3rd international symposium on Information processing in sensor networks
Coverage by randomly deployed wireless sensor networks

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
A 5+epsilon (Porson)-approximation algorithm for minimum weighted dominating set in unit disk graph

Theoretical Computer Science
A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Networks under Unit Disk Coverage Model

IEEE Transactions on Parallel and Distributed Systems
Covering points by unit disks of fixed location

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs

Theoretical Computer Science
Optimal deployment patterns for full coverage and k- connectivity (k ≤ 6) wireless sensor networks

IEEE/ACM Transactions on Networking (TON)
Wireless coverage with disparate ranges

MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
A (4+ε)-approximation for the minimum-weight dominating set problem in unit disk graphs

WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs

APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Coverage has been one of the most fundamental yet challenging issues in wireless networks and found many applications, such as routing and broadcasting. Given a set of weighted unit disks (coverage areas) and a set of nodes to be covered, we study the minimum weight coverage problem under two specific topologies. The first one assumes that the centers of the disks lie inside a strip while the nodes lie outside of this strip. The second topology assumes that the centers of the disks lie within a unit circle while the nodes lie outside of this circle. For each topology, we present a polynomial-time algorithm to find a disk subset of minimum total weight to cover all nodes. Both of our algorithms relies on dynamic programming.