基于集合最大流算法的WSN栅栏修复方法研究

无线传感器网络栅栏覆盖在入侵检测方面发挥着重要作用，如何修复栅栏间隙是该领域重点研究问题之一。栅栏将监测区域划分为二部分，任何入侵目标从一个区域穿越到另外一个区域都会被栅栏中至少一个传感器节点监测到。栅栏中的节点由于某些原因过早死亡导致栅栏出现间隙，监测目标可以通过间隙而不被栅栏监测到。提出一种利用移动节点修复栅栏间隙的方法，该方法采用基于集合的最大流算法计算出能修复间隙的数量并且具有较高的效率，然后利用移动节点修复栅栏，修复过程中，移动节点的总移动距离最短。最后仿真实验验证了该方法的有效性。

Repairing Barrier Gaps in WSN Using Set-based Max-flow Algorithm

In wireless sensor networks(WSNs),barrier coverage is a typical coverage model and is of paramount im?portance for intrusion detection. A barrier divides the area of interest into two regions such that any intruder pene?trates from one region to another is guaranteed to be detected by one or more sensor nodes in the barrier. The emer?gence of a gap in the barrier,which is caused by running out of energy or other reasons,may leads to the penetration without being detected. Therefore,the functions of WSNs will be seriously influenced. A mobile nodes based gap healing method is proposed in this paper. The set-based max-flow algorithm is introduced to efficiently carry out the number of existed gaps and then the mobile nodes are scheduled to the right position to heal the gap under the con?dition of minimizing the total moving distance. Some experiments are conducted and shows the effectiveness of the proposed method.