| 本文已被：浏览 4714次 下载 7359次 |
码上扫一扫！ |
|
|
| 一种无线传感器网络中目标移动轨迹算法 |
|
马寅1,2,3, 王汝传1,2,3, 孙力娟1,2,3, 黄海平1,2,3
|
|
1.南京邮电大学 计算机学院, 江苏 南京 210003;2.南京邮电大学 江苏省无线传感网高技术研究重点实验室, 江苏 南京 210003;3.南京邮电大学 宽带无线通信与传感网技术教育部重点实验室, 江苏 南京 210003
|
|
| 摘要: |
| 无线传感器网络一般用于监控传感区域中发生的各种事件;在对立面上,智能移动目标着力于寻找曝光量尽可能低的轨迹来通过传感区域,以免被监测到.针对智能移动目标寻找合适移动轨迹的问题,分析了目前已有的移动轨迹算法的不足,提出了一种通过选择合适前进方向来生成移动轨迹的AFMP(angle first moving path)算法.理论分析与仿真结果表明,AFMP算法无需全局节点信息,对节点的感知半径无同构要求,对节点部署密度和分布有较低的敏感度,特别适用于只知节点局部信息的情况且算法复杂度也低于Voronoi算法和理想网格算法. |
| 关键词: 无线传感器网络 移动轨迹 栅栏覆盖 |
| DOI： |
| 分类号: |
| 基金项目:国家自然科学基金(60973139,61003039,61003236);江苏省科技支撑计划(工业)(BE2010197,BE2010198);江苏省级现代服务业发展专项资金;江苏省高校自然科学基础研究项目(10KJB520013,10KJB520014);高校科研成果产业化推进工程项目(JH10-14);江苏省博士后基金(20090451240,20090451241);江苏高校科技创新计划项目(CX09B-153Z,CX10B-197Z,CX10B-200Z);江苏省六大高峰人才项目(2008118) |
|
| Target Moving Path Algorithm in Wireless Sensor Networks |
|
MA Yin1,2,3, WANG Ru-Chuan1,2,3, SUN Li-Juan1,2,3, HUANG Hai-Ping1,2,3
|
|
1.College of Computer, Nanjing University of Posts and Telecommunications, Nanjing 210003, China;2.Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks, Nanjing University of Posts andTelecommunications, Nanjing 210003, China;3.Key Labor
|
| Abstract: |
| Wireless sensor networks are widely used to monitor various kinds of events that happened in the sensing area.On the contrary,in order to avoid being detected,intelligent mobile targets are exerting themselves to seek paths with the least exposure passing the sensing area.Looking at the issue of intelligent moving targets seeking the appropriate moving path,the study analyzed the defects of existing moving path algorithms and proposed the AFMP(Angle First Moving Path)algorithm that generates a moving path via choosing the appropriate direction.Theoretical analysis and simulation results illustrate that the AFMP algorithm does not require global node information and isomorphic sensing radius of nodes.Also,it has a lower sensitivity when compared to the node deployment density and distribution.Therefore,the algorithm is especially suitable for the case when only local node information is known.Moreover,the complexity of the algorithm is lower than that of the Voronoi algorithm and the ideal grid algorithm. |
| Key words: wireless sensor network moving path barrier coverage |
