Assigning sensors to competing missions

Hosam Rowaihy, Matthew Johnson, Amotz Bar-Noy, Theodore Brown, Thomas F. La Porta

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

14 Scopus citations

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 propose centralized and distributed schemes to assign sensors to missions. We also adapt our distributed scheme to make it energy-aware to extend network lifetime. Finally, we show simulation results comparing these solutions. We find that our greedy algorithm frequently performs near-optimally and that the distributed schemes usually perform nearly as well.

Original languageEnglish (US)
Title of host publication2008 IEEE Global Telecommunications Conference, GLOBECOM 2008
Pages44-49
Number of pages6
DOIs
Publication statusPublished - Dec 1 2008
Event2008 IEEE Global Telecommunications Conference, GLOBECOM 2008 - New Orleans, LA, United States
Duration: Nov 30 2008Dec 4 2008

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference

Other

Other2008 IEEE Global Telecommunications Conference, GLOBECOM 2008
CountryUnited States
CityNew Orleans, LA
Period11/30/0812/4/08

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

Rowaihy, H., Johnson, M., Bar-Noy, A., Brown, T., & La Porta, T. F. (2008). Assigning sensors to competing missions. In 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008 (pp. 44-49). [4697792] (GLOBECOM - IEEE Global Telecommunications Conference). https://doi.org/10.1109/GLOCOM.2008.ECP.17