基于虚拟力的异构无线传感器网络覆盖优化策略  

Coverage Optimization Algorithm Based on Virtual Force for Heterogeneous Wireless Sensor Networks

作　　者：王婷婷[1] 孙彦景[1,2] 徐钊[1] 张晓光[1] 

机构地区：[1]中国矿业大学信息与电气工程学院,江苏徐州221116 [2]江苏省煤矿电气与自动化工程实验室,江苏徐州221008

出　　处：《传感技术学报》2016年第8期1253-1259,共7页Chinese Journal of Sensors and Actuators

基　　金：国家自然科学基金项目(51274202);国家自然科学基金青年项目(51504255;51504214);江苏省自然科学基金项目(BK20130199;BK20131124)

摘　　要：针对异构无线传感器网络覆盖优化过程中,固定Sink节点的虚拟作用力限制移动节点的位置移动,导致覆盖盲区得不到全局修复的问题,本文结合计算几何理论,提出基于Voronoi多边形形心引力的虚拟力覆盖优化算法(CAVFA)。虚拟力算法能有效指导移动节点的散布过程,形心引力能更好地实现全局的覆盖优化。通过合理设置虚拟力的距离阈值参数和优先级,调整固定节点对移动节点的约束。仿真表明,相比传统VFA算法和CBA算法,本文提出的CAVFA算法能够更有效地提高异构网络的覆盖率,且算法收敛速度更快。In heterogeneous wireless sensor networks with diversified mobility,the global optimization of coverage usually can’t be achieved because that the mobility of mobile sensor nodes will be constrained by the fixed ones. In order to solve this problem,we propose a Centroid-based Attractive Virtual Force Algorithm（CAVFA）inspired by computational geometry theory. The traditional Virtual Forces Algorithm（VFA）has been used to guide mobile nodes to move. And the Centroid-based algorithm（CBA）has potential to improve networks coverage in the whole in？terest of area. Also parameters including distance thresholds and priorities of virtual forces have been set to adjust the binding effect between fixed nodes and mobile ones. Simulation results are presented to demonstrate that the proposed CAVFA strategy has higher coverage rate and convergent speed than VFA and CBA strategies.

关 键 词：无线传感器网络 异构网络 网络覆盖 虚拟力 优化算法 

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