An O(EV log V) algorithm for finding a maximal weighted matching in general graphs
SIAM Journal on Computing
Discrete Mathematics - Topics on domination
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Hierarchically specified unit disk graphs
Theoretical Computer Science
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs
Journal of Algorithms
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Utility-based decision-making in wireless sensor networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
An efficient distributed algorithm for constructing small dominating sets
Distributed Computing - Special issue: Selected papers from PODC '01
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Combinatorial Auctions: A Survey
INFORMS Journal on Computing
Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines
Journal of Scheduling
Tight approximation algorithms for maximum general assignment problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Customer-Driven Sensor Management
IEEE Intelligent Systems
On the complexity of approximating k-set packing
Computational Complexity
A Distributed Active Sensor Selection Scheme for Wireless Sensor Networks
ISCC '06 Proceedings of the 11th IEEE Symposium on Computers and Communications
A survey of energy-efficient scheduling mechanisms in sensor networks
Mobile Networks and Applications
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Coverage-Aware sensor engagement in dense sensor networks
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Journal of Parallel and Distributed Computing
Efficient allocation of resources in multiple heterogeneous Wireless Sensor Networks
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
When a sensor network is deployed, it is typically required to support multiple simultaneous missions. Schemes that assign sensing resources to missions thus become necessary. In this article, we formally define the sensor-mission assignment problem and discuss some of its variants. In its most general form, this problem is NP-hard. We propose algorithms for the different variants, some of which include approximation guarantees. We also propose distributed algorithms to assign sensors to missions which we adapt to include energy-awareness to extend network lifetime. Finally, we show comprehensive simulation results comparing these solutions to an upper bound on the optimal solution.