Discrete Mathematics - Topics on domination
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Maximum Lifetime of Sensor Networks with Adjustable Sensing Range
SNPD-SAWN '06 Proceedings of the Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
SIAM Journal on Computing
Coverage problems in wireless sensor networks: designs and analysis
International Journal of Sensor Networks
A 5+epsilon (Porson)-approximation algorithm for minimum weighted dominating set in unit disk graph
Theoretical Computer Science
Lifetime maximization for connected target coverage in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
On the set multi-cover problem in geometric settings
Proceedings of the twenty-fifth annual symposium on Computational geometry
Approximating node-weighted multicast trees in wireless ad-hoc networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Energy-Efficient Composite Event Detection in Wireless Sensor Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
An improved LP-based approximation for steiner tree
Proceedings of the forty-second ACM symposium on Theory of computing
Lifetime maximization of monitoring sensor networks
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
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
Improved approximation algorithms for (budgeted) node-weighted steiner problems
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
We study the problem of maximising the lifetime of a sensor network for fault-tolerant target coverage in a setting with composite events. Here, a composite event is the simultaneous occurrence of a combination of atomic events, such as the detection of smoke and high temperature. We are given sensor nodes that have an initial battery level and can monitor certain event types, and a set of points at which composite events need to be detected. The points and sensor nodes are located in the Euclidean plane, and all nodes have the same sensing radius. The goal is to compute a longest activity schedule with the property that at any point in time, each event point is monitored by at least two active sensor nodes. We present a (6+ε)-approximation algorithm for this problem by devising an approximation algorithm with the same ratio for the dual problem of minimising the weight of a fault-tolerant sensor cover and applying the Garg-Könemann algorithm. Our algorithm for the minimum-weight fault-tolerant sensor cover problem generalises previous approximation algorithms for geometric set cover with weighted unit disks and is obtained by enumerating properties of the optimal solution that guide a dynamic programming approach.