一种WSN栅栏间隙修复优化方法  

An Optimization Method for WSN Barrier Gap Repair

作　　者：赵小敏[1] 方丁 毛科技[1] ZHAO Xiaomin;FANG Ding;MAO Keji(College of Computer Science and Technology,Zhejiang University of Technology,Hangzhou 310023,China)

机构地区：[1]浙江工业大学计算机科学与技术学院,杭州310023

出　　处：《传感技术学报》2018年第10期1566-1572,共7页Chinese Journal of Sensors and Actuators

基　　金：浙江省公益性技术应用研究计划项目(LGG18F020018)

摘　　要：无线传感器网络栅栏覆盖对目标穿越保护区域时进行有效监测,如果栅栏出现间隙可能会使监测失效,因而需要及时修复。现有的栅栏间隙修复方法存在可移动节点的总移动距离长导致代价高的问题。提出一种WSN栅栏间隙修复优化方法,将实际节点拓扑图转化为可移动节点数量需求拓扑图,利用KSP算法计算修复栅栏间隙需要的最少可移动节点数量,采用匈牙利算法派遣可移动节点,并对修复路径进行优化,使可移动节点修复栅栏间隙的移动距离总和最短。仿真实验结果表明该方法能够花费较小代价完成栅栏间隙的修复工作。The barrier coverage of the wireless sensor network can effectively monitor target passing through protected area.If there is a gap in the barrier,the monitoring will be invalid.Therefore,it is necessary to repair in time.The existing barrier gap repair methods have the problem of high cost due to the long distance of mobile nodes.An optimization method for WSN barrier gap repair is proposed,which transforms the actual node topology into the requirements topology of the number of movable node,and uses the KSP algorithm to calculate the minimum number of movable nodes to repair the barrier gap.The Hungarian algorithm is used to dispatch movable nodes and the repair path is optimized so that the sum of the moving distance of the movable nodes to repair the barrier gap is the shortest.The simulation results show that this method can repair the barrier gap at a low cost.

关 键 词：WSN 栅栏修复 KSP算法 匈牙利算法 较小代价 

分 类 号：TN393[电子电信—物理电子学]