School of Computer Science and Engineering, Anhui University of Science and Technology, Huainan 232001, China.
Sensors (Basel). 2023 Apr 20;23(8):4124. doi: 10.3390/s23084124.
To address the problems of low monitoring area coverage rate and the long moving distance of nodes in the process of coverage optimization in wireless sensor networks (WSNs), a multi-strategy improved sparrow search algorithm for coverage optimization in a WSN (IM-DTSSA) is proposed. Firstly, Delaunay triangulation is used to locate the uncovered areas in the network and optimize the initial population of the IM-DTSSA algorithm, which can improve the convergence speed and search accuracy of the algorithm. Secondly, the quality and quantity of the explorer population in the sparrow search algorithm are optimized by the non-dominated sorting algorithm, which can improve the global search capability of the algorithm. Finally, a two-sample learning strategy is used to improve the follower position update formula and to improve the ability of the algorithm to jump out of the local optimum. Simulation results show that the coverage rate of the IM-DTSSA algorithm is increased by 6.74%, 5.04% and 3.42% compared to the three other algorithms. The average moving distance of nodes is reduced by 7.93 m, 3.97 m, and 3.09 m, respectively. The results mean that the IM-DTSSA algorithm can effectively balance the coverage rate of the target area and the moving distance of nodes.
为了解决无线传感器网络(WSN)中覆盖优化过程中监测区域覆盖率低和节点移动距离长的问题,提出了一种用于 WSN 覆盖优化的多策略改进麻雀搜索算法(IM-DTSSA)。首先,利用 Delaunay 三角剖分定位网络中的未覆盖区域,并对 IM-DTSSA 算法的初始种群进行优化,从而提高算法的收敛速度和搜索精度。其次,通过非支配排序算法对麻雀搜索算法中的探索者种群的质量和数量进行优化,从而提高算法的全局搜索能力。最后,采用两样本学习策略改进跟随者位置更新公式,提高算法跳出局部最优的能力。仿真结果表明,与其他三种算法相比,IM-DTSSA 算法的覆盖率分别提高了 6.74%、5.04%和 3.42%。节点的平均移动距离分别减少了 7.93m、3.97m 和 3.09m。结果表明,IM-DTSSA 算法可以有效地平衡目标区域的覆盖率和节点的移动距离。