Issue No. 11 - November (2010 vol. 21)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2010.36
Matthew P. Johnson , City University of New York, New York
Hosam Rowaihy , King Fahd University of Petroleum and Minerals (KFUPM), Dhahran
Diego Pizzocaro , Cardiff University, Cardiff
Amotz Bar-Noy , City University of New York, New York
Stuart Chalmers , University of Aberdeen, Aberdeen
Thomas F. La Porta , The Pennsylvania State Univeristy, University Park
Alun Preece , Cardiff University, Cardiff
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 the most general setting, 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 what we call the dynamic setting, missions arrive over time and have different durations. For this 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, making this decision 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.
Wireless sensor networks, resource allocation, mission assignment.
S. Chalmers et al., "Sensor-Mission Assignment in Constrained Environments," in IEEE Transactions on Parallel & Distributed Systems, vol. 21, no. , pp. 1692-1705, 2010.