JOURNAL ARTICLE

An Improved Grey Wolf Optimizer with Multi-Strategies Coverage in Wireless Sensor Networks

Yun OuFeng QinKai-Qing ZhouPengfei YinLiping MoAzlan Mohd Zain

Year: 2024 Journal:   Symmetry Vol: 16 (3)Pages: 286-286   Publisher: Multidisciplinary Digital Publishing Institute

Abstract

For wireless sensor network (WSN) coverage problems, since the sensing range of sensor nodes is a circular area with symmetry, taking symmetry into account when deploying nodes will help simplify problem solving. In addition, in view of two specific problems of high node deployment costs and insufficient effective coverage in WSNs, this paper proposes a WSN coverage optimization method based on the improved grey wolf optimizer with multi-strategies (IGWO-MS). As far as IGWO-MS is concerned, first of all, it uses Sobol sequences to initialize the population so that the initial values of the population are evenly distributed in the search space, ensuring high ergodicity and diversity. Secondly, it introduces a search space strategy to increase the search range of the population, avoid premature convergence, and improve search accuracy. And then, it combines reverse learning and mirror mapping to expand the population richness. Finally, it adds Levy flight to increase the disturbance and improve the probability of the algorithm jumping out of the local optimum. To verify the performance of IGWO-MS in WSN coverage optimization, this paper rasterizes the coverage area of the WSN into multiple grids of the same size and symmetry with each other, thereby transforming the node coverage problem into a single-objective optimization problem. In the simulation experiment, not only was IGWO-MS selected, but four other algorithms were also selected for comparison, namely particle swarm optimization (PSO), grey wolf optimizer (GWO), grey wolf optimization based on drunk walk (DGWO), and grey wolf optimization led by two-headed wolves (GWO-THW). The experimental results demonstrate that when the number of nodes for WSN coverage optimization is 20 and 30, the optimal coverage rate and average coverage rate using IGWO-MS are both improved compared to the other four comparison algorithms. To make this clear, in the case of 20 nodes, the optimal coverage rate of IGWO-MS is increased by 13.19%, 1.68%, 4.92%, and 3.62%, respectively, compared with PSO, GWO, DGWO, and GWO-THW; while IGWO-MS performs even better in terms of average coverage rate, which is 16.45%, 3.13%, 11.25%, and 6.19% higher than that of PSO, GWO, DGWO, and GWO-THW, respectively. Similarly, in the case of 30 nodes, compared with PSO, GWO, DGWO, and GWO-THW, the optimal coverage rate of the IGWO-MS is increased by 15.23%, 1.36%, 5.55%, and 3.66%; the average coverage rate is increased by 16.78%, 1.56%, 10.91%, and 8.55%. Therefore, it can be concluded that IGWO-MS has certain advantages in solving WSN coverage problems, which is reflected in that not only can it effectively improve the coverage quality of network nodes, but it also has good stability.

Keywords:
Particle swarm optimization Computer science Population Wireless sensor network Node (physics) Range (aeronautics) Mathematical optimization Optimization problem Convergence (economics) Algorithm Mathematics Engineering Computer network

Metrics

46
Cited By
29.38
FWCI (Field Weighted Citation Impact)
26
Refs
0.99
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Metaheuristic Optimization Algorithms Research
Physical Sciences →  Computer Science →  Artificial Intelligence
Energy Efficient Wireless Sensor Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
Advanced Multi-Objective Optimization Algorithms
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
© 2026 ScienceGate Book Chapters — All rights reserved.