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)
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
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
SIAM Journal on Computing
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
Improved Results on Geometric Hitting Set Problems
Discrete & Computational Geometry
Algorithms for dominating set in disk graphs: breaking the log n Barrier
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Optimal deployment patterns for full coverage and k- connectivity (k ≤ 6) wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
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
Minimum-cost linear coverage by sensors with adjustable ranges
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Wireless coverage via dynamic programming
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
| Hi-index | 0.00 |
One of the most fundamental task of wireless networks is to provide coverage of a set of targets. Suppose that all nodes and targets lie in a plane, and all nodes have circular coverage ranges of arbitrary radii. The problem Minimum Wireless Cover (MWC) seeks the fewest nodes to cover the targets. If all nodes are associated with some positive prices, the problem Cheapest Wireless Cover (CWC) seeks a cheapest set of nodes to cover the targets. If all nodes have bounded lives, the problem Max-Life Wireless Cover (MLWC) seeks wireless coverage schedule of maximum life subject to the life constraints of individual nodes. In this paper, we present a polynomial time approximation scheme (PTAS) for MWC, and two randomized 2O(log* n)-approximation algorithms for CWC and MLWC respectively, where n is the number of nodes, and log* n is the iterated logarithm of n with base 2.