一种基于voronoi图的WMSNs监测路径算法  

An Algorithm for the Detected Path Based on Voronoi Diagram in Wireless Multimedia Sensor Networks

作　　者：孟庆国[1] 谭瑛[1] 赵静[1] 

机构地区：[1]太原科技大学复杂系统与智能计算实验室,太原030024

出　　处：《太原科技大学学报》2012年第3期176-181,共6页Journal of Taiyuan University of Science and Technology

基　　金：山西高校科技研究开发项目(20111017);太原科技大学博士科研启动基金(20112008)

摘　　要：针对无线多媒体传感器网络在最差覆盖情况下的路径监测能力,通过Voronoi图与图形搜索算法的结合来实现监测路径的搜索。深入探讨了目标在传感器临界密度下最小覆盖路径的择选情况,从而找到网络的薄弱环节,并针对薄弱环节提出网络覆盖增强策略。算法无须复杂计算,容易实现,仿真实验结果验证了算法的可行性和适用性。Focused on the path detectability under the worst-case coverage in wireless multimedia sensor networks,a path-finding algorithm is implemented by combining Voronoi diagram and graph search algorithms.The weak region of the WMSNs is found by discussing the choice selection of the minimum coverage path under the sensor density,and a strategy of the coverage enhancement is proposed based on the weak region.The algorithm is simple and easy to be realized,and the extensive simulation with a target and a sensor network confirm the validity of the approaches.

关 键 词：无线多媒体传感器网络 最差覆盖 VORONOI图 路径监测 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]