基于WSN的二维入侵监测区域可变k覆盖优化算法及仿真

The Optimization Algorithm and Simulation for Variable k Coverage in Two-Dimensional Area Intrusion Detection Area Based on WSN

摘要: 实现不同区域、不同时间的可变覆盖需求，在区域入侵监测问题中具有重要价值。提出基于无线传感器网络WSN的二维入侵监测区域的可变k覆盖问题，提出基于划分聚类规则对传感器节点进行重新部署的CP-var(k)算法。该算法首先对区域进行网格划分，根据其覆盖度进行聚类，而后根据当前覆盖度和需求覆盖度的比较得出每个区域是有冗余节点或是覆盖度不足，最后通过对节点的重新部署实现区域内的可变覆盖。仿真实验表明，在节点数目有限的前提下，该算法可以较少的能量消耗实现区域内快速可变k覆盖效果，且以一定的满意度实现对入侵对象的监测，验证了算法的有效性。

Abstract: The realization of the variable coverage demand in different regions and different time has great value in two-dimensional area intrusion detection. In this paper, we propose a variable k coverage issue in two-dimensional intrusion detection zone based on WSN, and introduce CP-var(k) algorithm based on partition clustering rule to deploy the Location of sensor nodes. Firstly mesh the region and clusters according to its coverage, and then draw redundant nodes or inadequate coverage based on the comparison of current coverage and need coverage. Finally the variable coverage requirement is achieved through redeployment of nodes. Simulation results show that the algorithm can realize the variable k coverage in the region quickly with less energy consumption under the premise of a limited number of nodes, and it also can achieve the goal of the invasion effective with a certain satisfaction and verify the effectiveness of the proposed algorithm.