Assigning Sensors to Competing Missions
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 schem...
Saved in:
Published in | IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference pp. 1 - 6 |
---|---|
Main Authors | , , , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.11.2008
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
ISBN: | 9781424423248 1424423244 |
ISSN: | 1930-529X 2576-764X |
DOI: | 10.1109/GLOCOM.2008.ECP.17 |