| 摘要: |
| 在异构的无线传感器网络中,组成事件的不同类型的数据之间具有较强的相关性.为了减少能量的消耗,可以通过收集组成事件的部分感知数据来近似地检测该事件.提出近似事件检测的节点调度问题.将网络中的节点分成若干个集合,每个集合轮流工作,在保证收集到的部分数据能够有效地近似检测目标事件的同时,最大化网络的生命周期.证明了近似事件检测的节点调度问题是NP完全问题,并给出了基于贪心策略的近似比为1/2的近似算法.实验结果表明,方法能够有效延长网络的生命周期. |
| 关键词: 无线传感器网络 事件检测 睡眠调度 |
| DOI： |
| 分类号: |
| 基金项目:国家自然科学基金(61033015,61190115,60831160525) |
|
| Nodes Scheduling for Approximate Event Detection in Wireless Sensor Networks |
|
GAO Jing, LI Jian-Zhong
|
|
School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China
|
| Abstract: |
| In heterogeneous wireless sensor networks, a strong relation exists among different types of data being composed into an event. Energy consumption can be reduced by collecting partial data to approximately detect the event. A node scheduling problem for approximate event detection is proposed. The nodes in the network are organized into subsets that are activated successively. The lifetime of the network is maximized on the condition that the partial data collected can be formed as an approximation of the event. The node scheduling problem for approximate event detection is proved to be NP-complete. A greedy-based approximate algorithm is devised with 1/2 as the approximate ratio. The experimental results illustrate that the lifetime of the network can be prolonged effectively. |
| Key words: wireless sensor networks event detection sleep scheduling |
