期刊
ACM TRANSACTIONS ON SENSOR NETWORKS
卷 6, 期 4, 页码 -出版社
ASSOC COMPUTING MACHINERY
DOI: 10.1145/1777406.1777415
关键词
Algorithms; Theory; Performance; Wireless sensor networks; resource allocation; mission assignment
资金
- U.S. Army Research Laboratory
- U.K. Ministry of Defence
- [W911NF-06-3-0001]
When a sensor network is deployed, it is typically required to support multiple simultaneous missions. Schemes that assign sensing resources to missions thus become necessary. In this article, we formally define the sensor-mission assignment problem and discuss some of its variants. In its most general form, this problem is NP-hard. We propose algorithms for the different variants, some of which include approximation guarantees. We also propose distributed algorithms to assign sensors to missions which we adapt to include energy-awareness to extend network lifetime. Finally, we show comprehensive simulation results comparing these solutions to an upper bound on the optimal solution.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据