TY - GEN
T1 - Assigning sensors to competing missions
AU - Rowaihy, Hosam
AU - Johnson, Matthew
AU - Bar-Noy, Amotz
AU - Brown, Theodore
AU - Porta, Thomas La
PY - 2008/12/1
Y1 - 2008/12/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 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.
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 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.
UR - http://www.scopus.com/inward/record.url?scp=67249098601&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=67249098601&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2008.ECP.17
DO - 10.1109/GLOCOM.2008.ECP.17
M3 - Conference contribution
AN - SCOPUS:67249098601
SN - 9781424423248
T3 - GLOBECOM - IEEE Global Telecommunications Conference
SP - 44
EP - 49
BT - 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008
T2 - 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008
Y2 - 30 November 2008 through 4 December 2008
ER -