中文摘要：

在深入分析和研究视频传感器网络中现有的目标覆盖算法和K重覆盖算法的基础上,提出了视频传感器网络中多移动目标K级覆盖问题。针对移动目标方向随机性变化的难点,设计了一种近似评估节点覆盖概率的数学模型,改进了线性预测目标位置的局限性,充分考虑每个移动目标下一时刻所有可能的位置,提高了多目标达到K级覆盖的概率。在该模型的基础上,以传感器节点旋转角度和最小为目标提出了一种多路径K级覆盖动态优化算法。一系列仿真实验的结果显示该算法有效。

英文摘要：

On the basis of deeply analyzing and investigating the existing target covering algorithm and K level covering algorithm in video sensor networks, the problem of multiple moving targets with K level coverage in video sensor networks is introduced. Aiming at the diffi- culty that the moving direction of the moving target changes randomly, a mathematical model is designed to approximately estimate the sensor coverage probability, which improves the limitation of linear target position prediction, fully considers all the possible locations of every moving target at the next moment and increases the probability of multiple moving targets reaching K level coverage. On the basis of the mathematical model, with the goal that the sum of the rotation angles of the sensor nodes is minimum, a dynamic optimization algo- rithm for muhipath with K level coverage is proposed. A series of simulation experiments were performed, which verify the effectiveness of the proposed algorithm.