The core challenge is deceptively simple to state: given a fixed number of sensors with a limited sensing radius, where should each one go so that the entire monitored field is observed with minimal redundancy? In practice, the problem is brutally hard. Each candidate solution encodes the Cartesian coordinates of every node, so the search space grows to 2N dimensions for N nodes. For 50 sensors that means 100 continuous decision variables, and the number of pairwise distance interactions grows quadratically. Because different spatial configurations can look locally optimal while leaving coverage holes elsewhere, the placement problem is treated as NP-hard, and deterministic search procedures become impractical at scale. This is why researchers turn to population-based metaheuristics, which explore complex landscapes without gradient information.

The team chose the Grey Wolf Optimizer as their starting point. Inspired by the social hierarchy and cooperative hunting of grey wolves, GWO guides a pack of candidate solutions using the three best agents, designated alpha, beta, and delta. Its simple structure and few control parameters make it attractive for engineering problems. But the standard algorithm has two well-documented weaknesses in sensor placement. First, purely random initialization can produce an unbalanced starting population, with some regions of the search space sampled too densely and others barely explored. Second, the position-update mechanism pulls every wolf strongly toward the alpha leader, so if alpha stagnates in a local optimum, the entire pack follows it into a suboptimal basin, losing diversity before a globally good configuration is found.

IGWO-SobolLévy attacks both weaknesses with targeted fixes. Instead of random sampling, the initial wolf population is generated from a Sobol sequence, a low-discrepancy quasi-random point set that fills the search space far more uniformly than pseudo-random numbers. This means promising placement regions are represented from the very first iteration. The second fix is more surgical: a Lévy-flight perturbation, generated with Mantegna’s algorithm to produce frequent short steps and occasional long jumps, is applied only when the alpha wolf’s fitness shows no meaningful improvement over a defined iteration window, and it is directed specifically at the alpha rather than the whole population. If the perturbed candidate outperforms the incumbent leader, greedy replacement installs it immediately within the same epoch, so the entire pack benefits from the improved direction at once.

The researchers evaluated the method in two complementary scenarios. The first varied the number of nodes from 30 to 120 within a fixed 250 by 250 meter field with a 20 meter sensing radius. The second fixed the sensor budget at 80 nodes and scaled the deployment area from 150 by 150 up to 500 by 500 square meters, with the evaluation grid resolution adapted so that spatial granularity stayed constant across all sizes. Every stochastic algorithm, including the proposed method, genetic algorithms, particle swarm optimization, the original GWO, artificial bee colony, and ant colony optimization, ran for 30 independent trials under identical budgets of 500 iterations and a population of 30, alongside a deterministic hexagonal layout called HEX-LEACH as a geometric baseline.

The results were striking. In the fixed-area scenario, IGWO-SobolLévy achieved the highest mean coverage among stochastic methods at every node count, reaching 57.79, 83.15, 96.66, and 99.76 percent for 30, 50, 80, and 120 nodes respectively. The largest gain over standard GWO appeared at 50 nodes, where coverage improved by 7.08 percentage points, a relative gain of 9.31 percent. Just as important was stability: at 50 nodes the standard deviation of the proposed method was 1.26 against 8.76 for GWO, roughly seven times less variable, and at 120 nodes the gap widened to about fifteen-fold. The authors attribute this reproducibility to Sobol initialization producing consistent population geometry across runs and to greedy replacement preventing unhelpful perturbations from degrading the current best solution.

The area-scaling scenario revealed where the method truly shines. As the monitored field grew under a fixed sensor budget, the advantage over standard GWO widened: 8.50 percent relative gain at 250 by 250 square meters, 17.62 percent at 350 by 350, and 14.10 percent at 500 by 500. At the largest area, the proposed method reduced sensing overlap by 84.10 percent compared with GWO, dropping from 4.24 percent to just 0.67 percent, while also cutting the coefficient of variation of redundancy by roughly 61 percent. This indicates the coverage gains did not come from stacking sensors over already-covered ground but from genuinely better spatial distribution. The proximity penalty in the objective function, which activates only when two nodes come closer than 15 meters, helps suppress excessive clustering and pushes the search toward wider sensing allocation.

Statistical testing backed up these observations. Friedman tests followed by Holm-corrected Wilcoxon signed-rank comparisons showed significant differences with large effect sizes between IGWO-SobolLévy and nearly all benchmarks in the harder configurations, with the proposed method claiming the best average Friedman ranks of 1.07 and 1.23 at the two largest deployment areas. An ablation study isolated each component’s contribution: Sobol initialization alone helped in easy conditions, but the full combination of stagnation detection, alpha-targeted Lévy perturbation, and greedy replacement was decisively superior as node counts and areas grew, with large effect sizes against every partial variant at 80 and 120 nodes. Convergence profiles showed a distinctive delayed-but-persistent pattern, in which the proposed method sustained useful search activity and made substantial late-stage improvements after genetic algorithms and other competitors had already plateaued.

The study is candid about limits. In regular square fields where the node budget matches a neat geometric tiling, the deterministic HEX-LEACH layout still outperformed the metaheuristic, achieving 98.88 percent coverage with lower redundancy at 80 nodes in the 250 by 250 meter configuration. Parameter sensitivity analysis showed the method is far more sensitive to the Lévy multiplier than to the stagnation limit: a multiplier of 0.01 consistently delivered the best coverage, while larger values of 0.05 and 0.10 introduced overly aggressive jumps that disrupted promising configurations. The authors therefore position IGWO-SobolLévy not as a universal replacement for deterministic layouts but as an adaptive framework for continuous deployment when the best spatial pattern is not known in advance. Future work, they note, should extend the approach toward multi-objective optimization incorporating connectivity, energy consumption, network lifetime, heterogeneous sensors, and irregular terrains, moving closer to the messy realities of real-world sensor rollouts.

Subject of Research: Optimization of wireless sensor network node placement using an enhanced Grey Wolf Optimizer with Sobol initialization and Lévy flight

Article Title: Sobol-Initialized grey wolf optimizer with Lévy flight for enhanced coverage in wireless sensor network deployment

Article References: Hartono, R., Mustika, I. W., & Sulistyo, S. (2026). Sobol-Initialized grey wolf optimizer with Lévy flight for enhanced coverage in wireless sensor network deployment. Results in Engineering, 32, Article 113307. https://doi.org/10.1016/j.rineng.2026.113307

Image Credits: AI Generated

DOI: 10.1016/j.rineng.2026.113307

Keywords: wireless sensor networks, Grey Wolf Optimizer, Sobol sequence, Lévy flight, coverage optimization, metaheuristics, Internet of Things, node deployment, swarm intelligence, NP-hard optimization, Results in Engineering, Sobol-Initialized