4.6 Article

A Multi-Strategy Improved Sparrow Search Algorithm for Coverage Optimization in a WSN

Journal

SENSORS
Volume 23, Issue 8, Pages -

Publisher

MDPI
DOI: 10.3390/s23084124

Keywords

wireless sensor network; coverage optimization; sparrow search algorithm; non-dominated sorting; two-sample learning strategy

Ask authors/readers for more resources

To address the issues of low monitoring area coverage rate and long node moving distance in wireless sensor networks (WSNs), a multi-strategy improved sparrow search algorithm (IM-DTSSA) for coverage optimization is proposed. It uses Delaunay triangulation to locate uncovered areas and optimize the algorithm's initial population, and employs non-dominated sorting algorithm to enhance the global search capability. Additionally, a two-sample learning strategy is used to improve follower position update formula. Simulation results demonstrate that IM-DTSSA improves coverage rate by 6.74%, 5.04%, and 3.42% compared to other algorithms, and reduces average node moving distance by 7.93 m, 3.97 m, and 3.09 m.
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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available