一种高效强K—栅栏覆盖构建算法

K－栅栏覆盖是无线传感器网络覆盖控制的研究热点之一。本文构建了强栅栏覆盖模型，提出了分区强K－栅栏覆盖构建算法PMNSB，用最少的节点形成强栅栏。首先把监控区域分成多个子区域，通过匈牙利算法选用移动距离之和最少的网格集合为基准1－栅栏覆盖，缺少移动节点的子区域，选择附近区域的剩余移动节点修补形成1－栅栏覆盖。水平相邻的两个子区域之间构建竖直栅栏，这些1－栅栏合起来构成强K－栅栏覆盖。仿真结果证明了该方法的有效性，本文的研究对提升无线传感器网络的性能具有重要的理论与实际意义。

A effective realization scheme of strong k-barrier coverage in WSN

K￣barrier coverage is one of the hot spot in the wireless sensor network. This paper mainly proposes PMNSB(partitioning construction of strong barrier of minimum node). First,it divides the interested area into sever￣al subareas,1￣barrier coverage benchmark are determined by Hungary algorithm in each subarea. Second,according to this benchmark,mobile nodes in this subarea move to its destination to build 1￣barrier coverage. If it is lack of mobile node in one subarea,the residual mobile node near this subarea repair the hole of barrier benchmark. Third,there is vertical barrier between two horizontal adjacent subarea. Finally,these 1￣barriers are merged into strong K￣barrier coverage. Simulation results show our method could effectively constitute K￣barrier coverage,and enhance the coverage performance of WSN. This research has important theoretical and practical significance.