Sensor-mission assignment in constrained environments

Matthew P. Johnson, Hosam Rowaihy, Diego Pizzocaro, Amotz Bar-Noy, Stuart Chalmers, Thomas F. La Porta, Alune Preece

Research output: Contribution to journalArticle

21 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Article number5416696
Pages (from-to)1692-1705
Number of pages14
JournalIEEE Transactions on Parallel and Distributed Systems
Volume21
Issue number11
DOIs
StatePublished - Aug 24 2010

Fingerprint

Sensors
Heuristic algorithms
Sensor networks
Conservation
Decision making

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

Johnson, M. P., Rowaihy, H., Pizzocaro, D., Bar-Noy, A., Chalmers, S., La Porta, T. F., & Preece, A. (2010). Sensor-mission assignment in constrained environments. IEEE Transactions on Parallel and Distributed Systems, 21(11), 1692-1705. [5416696]. https://doi.org/10.1109/TPDS.2010.36
Johnson, Matthew P. ; Rowaihy, Hosam ; Pizzocaro, Diego ; Bar-Noy, Amotz ; Chalmers, Stuart ; La Porta, Thomas F. ; Preece, Alune. / Sensor-mission assignment in constrained environments. In: IEEE Transactions on Parallel and Distributed Systems. 2010 ; Vol. 21, No. 11. pp. 1692-1705.
@article{6e52f85069eb45bc9d24a5ec1f8a697a,
title = "Sensor-mission assignment in constrained environments",
abstract = "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.",
author = "Johnson, {Matthew P.} and Hosam Rowaihy and Diego Pizzocaro and Amotz Bar-Noy and Stuart Chalmers and {La Porta}, {Thomas F.} and Alune Preece",
year = "2010",
month = "8",
day = "24",
doi = "10.1109/TPDS.2010.36",
language = "English (US)",
volume = "21",
pages = "1692--1705",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "11",

}

Johnson, MP, Rowaihy, H, Pizzocaro, D, Bar-Noy, A, Chalmers, S, La Porta, TF & Preece, A 2010, 'Sensor-mission assignment in constrained environments', IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 11, 5416696, pp. 1692-1705. https://doi.org/10.1109/TPDS.2010.36

Sensor-mission assignment in constrained environments. / Johnson, Matthew P.; Rowaihy, Hosam; Pizzocaro, Diego; Bar-Noy, Amotz; Chalmers, Stuart; La Porta, Thomas F.; Preece, Alune.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 21, No. 11, 5416696, 24.08.2010, p. 1692-1705.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Sensor-mission assignment in constrained environments

AU - Johnson, Matthew P.

AU - Rowaihy, Hosam

AU - Pizzocaro, Diego

AU - Bar-Noy, Amotz

AU - Chalmers, Stuart

AU - La Porta, Thomas F.

AU - Preece, Alune

PY - 2010/8/24

Y1 - 2010/8/24

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77957750161&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77957750161&partnerID=8YFLogxK

U2 - 10.1109/TPDS.2010.36

DO - 10.1109/TPDS.2010.36

M3 - Article

AN - SCOPUS:77957750161

VL - 21

SP - 1692

EP - 1705

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 11

M1 - 5416696

ER -

Johnson MP, Rowaihy H, Pizzocaro D, Bar-Noy A, Chalmers S, La Porta TF et al. Sensor-mission assignment in constrained environments. IEEE Transactions on Parallel and Distributed Systems. 2010 Aug 24;21(11):1692-1705. 5416696. https://doi.org/10.1109/TPDS.2010.36