基于粒子均衡的移动传感器网络覆盖控制研究

现代仪器正在向着网络化和智能化方向发展,传感器网络则是具体体现之一,各个传感器测量的数据可以通过网络以单跳或多跳方式传送到控制节点,从而实现网络化的智能测量。传感器网络中各节点能否覆盖全区域,直接决定了测量结果是否为全样本覆盖集。本文在经典的虚拟力算法思想基础上,研究了基于粒子均衡的移动传感器网络覆盖控制性能,具体针对同构节点、异构节点、非规则区域等各种应用场合进行了分析和算法改进,利用仿真实验的方法验证了其性能。仿真实验证明,该算法对于同构节点和非规则区域均可以取得较好的覆盖效果和网络生命周期;对于异构网络则需要进行适当调整,将邻居区域的概念由同构节点网络中的两倍于感知范围扩展为最大的联合感知范围,使得节点在其邻居节点范围内能够维护最低限度的通信链路,就可以使其远离邻居节点,从达到预期的网络性能。同时研究了在实际应用中算法的鲁棒性,主要针对在部分节点丧失通信能力以及节点丧失移动能力时算法的性能,实验表明仍能表现出较好的网络覆盖度。

Study on equilibrium of particle based coverage control for mobile sensor network

Modern instruments are developing towards networking and intelligentization direction, and sensor network is one of the specific embodiments. The sensor measured data can be transmitted to the control node through the network in a single hop or multiple hops to achieve networked intelligent measurement. Whether the nodes in the sensor network can cover the whole region directly determine if the measurement results cover the whole sample set. Based on the classic virtual force algorithm, the coverage control performance of the equilibrium of particle based mobile sensor network is studied. The control capabilities for a variety of applications, such as homogeneous nodes, heterogeneous nodes and irregular regions are analyzed; the algorithm is improved. Simulation experiment was conducted to verify the performance of the algorithm. The simulation experiment results show that for the homogeneous nodes and irregular regions the algorithm can achieve better coverage effect and network life cycle; for the heterogeneous networks appropriate adjustments are needed. The concept of neighboring region is expanded from the range two times of the sensing range in the homogeneous network to the maximum joint sensing range, so that the node can maintain minimal communication link within the scope of its neighbor nodes, which can keep the node away from the neighbor nodes, and achieve the desired network performance. The robustness of the algorithm in actual applications is also studied, which mainly aims at the performance of the algorithm when some nodes lose their communication capability or some nodes lose their mobile capability; experiments show that under these conditions the algorithm still can achieve good network coverage.