Nature-Inspired Metaheuristics for Wireless Sensor Network Coverage Optimization

Authors:

Abstract
Network coverage is a critical issue in wireless sensor networks (WSNs), which often operate in complex, hard-to-reach environments. Sensors are typically deployed randomly—such as via aerial distribution—resulting in uneven coverage with blind spots or redundant overlap. To overcome this, node placement must be dynamically optimized. However, meeting coverage and application constraints present an NP-hard optimization challenge, due to a large search space (|search space| $=\mathrm{m}^{\mathrm{n}}$, where m is the number of candidate positions per sensor, and $\mathbf{n}$ is the number of sensors). To address this, nature-inspired metaheuristic algorithms such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), and Grey Wolf Optimizer (GWO) have been widely adopted in WSN tasks including localization, energy-efficient topology design, routing, and signal coverage. This paper focuses specifically on WSN coverage optimization and presents a systematic comparative study of four well-known nature-inspired algorithms: PSO, GWO, GA, and ACO. Their performance is assessed in terms of solution accuracy, robustness, and computational efficiency. The main contributions of this work are i) a comprehensive comparison of four popular nature-inspired metaheuristics applied to WSN coverage optimization; and ii) practical guidance for selecting the most suitable algorithm for large-scale problems involving 40 to 80 design variables representing sensor $X$ and $Y$ coordinates.

This publication has 50 references indexed in Scilit: