Frugal sensor assignment

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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

Original languageEnglish (US)
Title of host publicationDistributed Computing in Sensor Systems - 4th IEEE International Conference, DCOSS 2008, Proceedings
Pages219-236
Number of pages18
DOIs
StatePublished - Jul 1 2008
Event4th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2008 - Santorini Island, Greece
Duration: Jun 11 2008Jun 14 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5067 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2008
CountryGreece
CitySantorini Island
Period6/11/086/14/08

Fingerprint

Assignment
Sensor
Sensors
Heuristic algorithms
Heuristic algorithm
Generalized Assignment Problem
Resources
Assignment Problem
Sensor networks
Sensor Networks
Conservation
Lifetime
NP-complete problem
Target
Necessary
Evaluate
Energy
Simulation
Model

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Johnson, M. P., Rowaihy, H., Pizzocaro, D., Bar-Noy, A., Chalmers, S., La Porta, T., & Preece, A. (2008). Frugal sensor assignment. In Distributed Computing in Sensor Systems - 4th IEEE International Conference, DCOSS 2008, Proceedings (pp. 219-236). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5067 LNCS). https://doi.org/10.1007/978-3-540-69170-9_15
Johnson, Matthew P. ; Rowaihy, Hosam ; Pizzocaro, Diego ; Bar-Noy, Amotz ; Chalmers, Stuart ; La Porta, Thomas ; Preece, Alun. / Frugal sensor assignment. Distributed Computing in Sensor Systems - 4th IEEE International Conference, DCOSS 2008, Proceedings. 2008. pp. 219-236 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{af0ef7c2e6c648e5a267d0c37f967f18,
title = "Frugal sensor assignment",
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 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.",
author = "Johnson, {Matthew P.} and Hosam Rowaihy and Diego Pizzocaro and Amotz Bar-Noy and Stuart Chalmers and {La Porta}, Thomas and Alun Preece",
year = "2008",
month = "7",
day = "1",
doi = "10.1007/978-3-540-69170-9_15",
language = "English (US)",
isbn = "3540691693",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "219--236",
booktitle = "Distributed Computing in Sensor Systems - 4th IEEE International Conference, DCOSS 2008, Proceedings",

}

Johnson, MP, Rowaihy, H, Pizzocaro, D, Bar-Noy, A, Chalmers, S, La Porta, T & Preece, A 2008, Frugal sensor assignment. in Distributed Computing in Sensor Systems - 4th IEEE International Conference, DCOSS 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5067 LNCS, pp. 219-236, 4th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2008, Santorini Island, Greece, 6/11/08. https://doi.org/10.1007/978-3-540-69170-9_15

Frugal sensor assignment. / Johnson, Matthew P.; Rowaihy, Hosam; Pizzocaro, Diego; Bar-Noy, Amotz; Chalmers, Stuart; La Porta, Thomas; Preece, Alun.

Distributed Computing in Sensor Systems - 4th IEEE International Conference, DCOSS 2008, Proceedings. 2008. p. 219-236 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5067 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Frugal sensor assignment

AU - Johnson, Matthew P.

AU - Rowaihy, Hosam

AU - Pizzocaro, Diego

AU - Bar-Noy, Amotz

AU - Chalmers, Stuart

AU - La Porta, Thomas

AU - Preece, Alun

PY - 2008/7/1

Y1 - 2008/7/1

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

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

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

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

U2 - 10.1007/978-3-540-69170-9_15

DO - 10.1007/978-3-540-69170-9_15

M3 - Conference contribution

AN - SCOPUS:45849133076

SN - 3540691693

SN - 9783540691693

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 219

EP - 236

BT - Distributed Computing in Sensor Systems - 4th IEEE International Conference, DCOSS 2008, Proceedings

ER -

Johnson MP, Rowaihy H, Pizzocaro D, Bar-Noy A, Chalmers S, La Porta T et al. Frugal sensor assignment. In Distributed Computing in Sensor Systems - 4th IEEE International Conference, DCOSS 2008, Proceedings. 2008. p. 219-236. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-69170-9_15