无线传感器网络启发式移动轨迹策略的研究

秦宁宁; 张林; 山秀明; 徐保国

doi:10.3724/SP.J.1146.2006.01324

无线传感器网络启发式移动轨迹策略的研究

doi: 10.3724/SP.J.1146.2006.01324

基金项目:

国家自然科学基金项目(60672107)和国家863计划项目(10A3, 10Z2)资助课题

计量
- 文章访问数: 3139
- HTML全文浏览量: 83
- PDF下载量: 701
- 被引次数: 0
出版历程
- 收稿日期: 2006-09-06
- 修回日期: 2007-04-06
- 刊出日期: 2008-03-19

A Heuristic Track Strategy for Wireless Sensor Networks

摘要

摘要: 从进攻方的角度出发，该文研究目标如何以尽可能低的发现概率，消耗尽可能少的时间穿越已被传感器节点监控的区域。基于此研究目标，提出一种兼顾安全和时效性能的SS(Security and Speed)启发式的移动轨迹策略和相应的评价指标综合增益Integrated Gain (IG)。此策略无需全网拓扑信息的支持，能动态地反映目标对安全和时效两种性能的不同需求。通过仿真试验证明，该策略对网络中节点密度和分布有更低的敏感性；和经典的Voronoi算法相比，该策略克服Voronoi中存在的工作盲区和轨迹蔓延的问题，平均综合增益更加接近理想算法的结果，而计算复杂度却远远低于理想算法。
- 无线传感器网络; 栅栏覆盖控制; 启发式移动轨迹
Abstract: The coverage problem has been expanded with presenting the reverse problem which has not yet been thoroughly studied, i.e., given an intrusion detecting WSN, how to design an object locomotion track with high security and fast speed. Based on this goal, a heuristic algorithm, namely, the SS (shortened Security and Speed) algorithm is introduced to build the corresponding tracks with adjusting the secure and speedy parameters under the varying application demands without the support of the global topology information. And the corresponding Integrated Gain (IG) will be posed to measure the SS ability. Simulations show that, the SS algorithm is not sensitive to the density and distribution of sensors, and solves the defects of working blind spot and track flooding. Compared with the traditional Voronoi algorithm, the proposed SS algorithm matches the results of the optimal more closely and has the smaller complexity than the optimal approach.

HTML全文

参考文献(1)

Meguerdichian S, Koushanfar F, Potkonjak M, andSrivastava M B. Coverage problems in wireless ad-hoc sensornetworks [C]. Proc. IEEE Inforcom 2001, Anchorage, USA,Apr. 2001, vol 3: 1380-1387.[2]Kumar S, Lai T H, and Arora A. Barrier coverage withwireless sensors [C].[J]. MobiCom0.2005,Cologne:-[3]Meguerdichian S, Koushanfar F, Potkonjak M, andSrivastava M B. Worst and best-case coverage in sensornet-works [J].IEEE Trans. on Mobile Computing.2005, 4(1):84-92[4]Veltri G, Huang Q, Qu G, and Potkonjak M. Minimal andmaximal exposure path algorithms for wireless embeddedsensor networks [C]. Proc. ACM Int1 SENSYS, L.A., Calif.,USA, Nov. 2003: 40-50.[5]Corts J, Martnez S, Karatas T, and Bull F. Coverage controlfor mobile sensing networks [C][J].IEEE Trans. on Roboticsand Automation.2004, 20(2):243-255[6]Li X Y, Wan P J , and Frieder O. Coverage in wireless ad hocsensor networks [C]. IEEE Trans. on Computers, 2003, 52(6):115-121.[7]Meguerdichian S, Koushanfar F, Qu G, and Potkonjak M.Exposure in wireless ad hoc sensor networks [C]. Proc.ACMInternational Conference on Mobile Computing andNetworking (MobiCom), Rome, Italy, Jul. 2001: 139-150.[8]Adlakha S and Srivastava M. Critical density thresholds forcoverage in wireless sensor networks [C][J].Proc. IEEEWCNC2003, New Orleans, La., USA, Mar.2003, vol.3:1615-1620[9]Zhang H and Hou J C. Maintaining sensing coverage andconnectivity in large sensor networks [J]. Wireless Ad Hocand Sensor Networks, 2005, 1(1/2): 89-124.[10]Tian D and Georganas N D. Connectivity maintenanceandcoverage preservation in wireless sensor networks [J]. Ad Hocnetwork Journal, 2005, 3(5): 744-761.[11]Qin N N and Xu B G. An attacking track in wireless sensornetwork[C]. ChianCOM 2006, Beijing, China, 2006: 1-5.

施引文献

资源附件(0)

访问统计