GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Approximation algorithms
Utility-based decision-making in wireless sensor networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Customer-Driven Sensor Management
IEEE Intelligent Systems
A Distributed Active Sensor Selection Scheme for Wireless Sensor Networks
ISCC '06 Proceedings of the 11th IEEE Symposium on Computers and Communications
An efficient approximation for the generalized assignment problem
Information Processing Letters
Assigning sensors to missions with demands
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
Coverage-Aware sensor engagement in dense sensor networks
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Detection and Localization Sensor Assignment with Exact and Fuzzy Locations
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
Sensor-mission assignment in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
An efficient approach for integration of sensor resources into the grid
International Journal of Networking and Virtual Organisations
Multi-layer optimization in service-oriented sensor grid
Expert Systems with Applications: An International Journal
Adaptive negotiation in managing wireless sensor networks
PRIMA'10 Proceedings of the 13th international conference on Principles and Practice of Multi-Agent Systems
A flexible layered control policy for resource allocation in a sensor grid
Journal of Parallel and Distributed Computing
A hybrid reasoning mechanism for effective sensor selection for tasks
Engineering Applications of Artificial Intelligence
Agent based sensors resource allocation in sensor grid
Applied Intelligence
| Hi-index | 0.00 |
When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match sensor resources to mission demands thus become necessary. In this paper, we consider new sensor-assignment problems motivated by frugality, i.e., the conservation of resources, for both static and dynamic settings. In general, the problems we study are NP-hard even to approximate, and so we focus on heuristic algorithms that perform well in practice. In the static setting, we propose a greedy centralized solution and a more sophisticated solution that uses the Generalized Assignment Problem model and can be implemented in a distributed fashion. In the dynamic setting, we give heuristic algorithms in which available sensors propose to nearby missions as they arrive. We find that the overall performance can be significantly improved if available sensors sometimes refuse to offer utility to missions they could help based on the value of the mission, the sensor's remaining energy, and (if known) the remaining target lifetime of the network. Finally, we evaluate our solutions through simulations.