Assigning Sensors to Competing Missions
Authors:
- Hosam RowaihyHRHosam Rowaihy
- Matthew JohnsonMJMatthew Johnson
- Amotz Bar-NoyABAmotz Bar-Noy
- Theodore BrownTBTheodore Brown
- Thomas La PortaTPThomas La Porta
- 1 January 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1930529X,p. 1-6
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.Keywords
This publication has 5 references indexed in Scilit:
- Assigning Sensors to Competing Missions2008
- Global node selection for localization in a distributed sensor networkIEEE Transactions on Aerospace and Electronic Systems, 2006
- Optimal sensor management under energy and reliability constraints2004
- Utility-based decision-making in wireless sensor networks2002
- Information-driven dynamic sensor collaborationIEEE Signal Processing Magazine, 2002