Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
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
Covering points by unit disks of fixed location
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
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
Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
| Hi-index | 0.01 |
One of the most fundamental tasks of wireless sensor networks is to provide coverage of the deployment region. In this paper, we study the coverage of a line segment with a set of wireless sensors with adjustable coverage ranges. Each coverage range of a sensor is an interval centered at that sensor whose length is decided by the power the sensor chooses. The objective is to find a range assignment with the minimum cost. There are two variants of the optimization problem. In the discrete variant, each sensor can only choose from a finite set of powers while in the continuous variant, each sensor can choose power from a given interval. For the discrete variant of the problem, we present a polynomial-time exact algorithm. For the continuous variant of the problem, we develop constant-approximation algorithms when the cost for all sensors is proportional to rk for some constant k ≥ 1, where r is the covering radius corresponding to the chosen power. Specifically, if k = 1, we give a simple 1.25-approximation algorithm and a fully polynomial-time approximation scheme (FPTAS); if k 1, we give a simple 2-approximation algorithm.