Charger placement optimization in wireless sensor networks using hybrid graph coloring and Enhanced Aquila Optimization Authors: P Neelagandan, S Balaji Published: 2026 ABSTRACT AbstractThe sustainability of wireless sensor networks critically depends on intelligent and efficient charger deployment. This paper proposes a two-stage optimization framework that determine the total number of chargers needed to recharge and the optimal position of charger. In the first stage, a hybrid algorithm combining degree-based saturation and Grundy coloring efficiently determines the minimal number of chargers required. In the second stage, an Enhanced Aquila Optimization algorithm, inspired by eagle hunting behavior, identifies optimal charger locations under coverage and power constraints. Experimental results show that the enhancement method improves coverage by 6% compared to the standard algorithm. The Enhanced Aquila Optimization achieves 99% sensor coverage with faster convergence than Raindrop (82%), Grey Wolf (85%), Black Hole (89%), Dragonfly (89%), and standard Aquila Optimization (93%). Statistical analysis confirms the significant performance difference between the proposed and existing algorithms. Overall, the proposed approach provides a practical, scalable, and energy-efficient solution for sustainable wireless sensor network deployment.Keywords: Wireless chargers, Degree of saturation, Grundy coloring, Enhanced Aquila Optimization, Optimal position of chargersSubject terms: Energy science and technology, Engineering, Mathematics and computing Introduction Wireless sensor networks (WSNs) have become fundamental infrastructure across diverse domains including environmental monitoring, industrial automation, and national security1,2. The widespread deployment of these battery-constrained devices has intensified research into sustainable energy solutions, particularly wireless rechargeable sensor networks (WRSNs)3. While recent advances in metaheuristic optimization4 and wireless power transfer5 show promise, the critical challenge of optimal charger placement remains unresolved, especially in large-scale random deployments6. The energy sustainability of WRSNs depends on two key factors: (1) minimizing the number of charging devices to reduce infrastructure costs, and (2) optimizing their spatial distribution for maximum coverage efficiency. Traditional approaches have treated these as separate problems, leading to suboptimal solutions. Evolutionary algorithms such as particle swarm optimization7 and genetic algorithms8 focus solely on placement optimization without considering the minimum charger requirement, while graph-theoretic methods address conflict resolution but neglect spatial constraints. This paper presents a novel unified framework that combines graph theory with bio-inspired optimization to simultaneously address both challenges. The research objective of this paper: A hybrid graph coloring technique that integrates degree-based saturation with the grundy method to determine the minimum number of chargers required and reducing the redundancy of charger. A hybrid graph coloring technique that integrates degree-based saturation with the grundy method to determine the minimum number of chargers required and reducing the redundancy of charger. An Enhanced Aquila Optimizer that incorporates dynamic power constraints and coverage requirements to determine optimal charger positions, achieving 6% better result than standard implementations. An Enhanced Aquila Optimizer that incorporates dynamic power constraints and coverage requirements to determine optimal charger positions, achieving 6% better result than standard implementations. To optimize charger deployment in wireless rechargeable sensor networks the proposed together approach Degree of Saturation-Grundy Coloring Algorithm (DS-GCA) and Enhanced Aquila Optimizer (EAO) form a computationally efficient framework that outperforms standalone optimization techniques in both charger reduction and placement accuracy. The practical implications of this work are significant for several application domains9. In precision agriculture, where soil sensors require frequent recharge, our method reduces infrastructure costs while maintaining complete coverage. For industrial IoT deployments, the optimized charger placement minimizes energy waste during simultaneous charging operations10. Border security networks benefit from the extended operational lifetime enabled by efficient recharge scheduling. The rest of the paper is structured as follows: “Related work” section presents the related work in wireless sensor recharging. “Problem formation” section problem formation. “Determining charger requirement using hybrid degree of saturation and grundy coloring approach” section details the DS-GCA implementation. “Aquila optimizer: biological basis and mathematical modeling” section introduces the Aquila optimizer, and “Implementation of the enhanced aquila optimizer (EAO)” section explains the enhancements proposed in Enhanced Aquila Optimization. “Simulation result” section discusses the simulation results and performance evaluation, “Statistical analysis” section analysis the statistical concept. Finally, “Conclusion” section concludes the paper and outlines future directions. Related work The problem of optimal charger placement in WSNs has been extensively studied due to its significance in prolonging network lifetime and reducing maintenance costs. Effective placement ensures that sensor nodes can be recharged wirelessly without human intervention, which is critical for large-scale and inaccessible deployments. Early foundational studies laid the groundwork for understanding energy provisioning and wireless power transfer in WSNs. Balaji and Arivudainambi11 proposed an approach using the Daubechies wavelet algorithm to optimize charger placement. This algorithm leverages the translation and dilation properties of Daubechies wavelets, allowing chargers to adjust both vertically and horizontally, as well as repositioning redundant chargers to more effective locations. The method was compared with four other wavelets: Haar, Daubechies 2 (db2), Biorthogonal 55 (bio55), and Symlets and demonstrated superior performance. He et al.12 addressed the challenge of energy scheduling and routing for mobile chargers in rechargeable networks, proposing models for efficient energy delivery. Similarly, Xie et al.13 explored static and mobile charging strategies under different constraints, highlighting trade-offs between cost, efficiency, and energy balance. As the problem grew in complexity, researchers began employing metaheuristic optimization algorithms to tackle the non-linear, multi-objective nature of charger placement. For instance, Zhang et al.14 modeled the problem as an optimization task and applied heuristic search strategies to determine optimal charger locations. Alshahrani and Shoaib15 implemented a GA to optimize placement while satisfying coverage constraints, demonstrating the potential of evolutionary strategies for this domain. Qureshi et al.16 used PSO to deploy multiple static chargers and evaluated its performance in terms of convergence rate and energy efficiency. Graph-based methods have also been explored to reduce charger redundancy by identifying recharge-compatible sensor groups. Molla and Rha17 extended this idea by combining Voronoi diagram partitioning with a hybrid GA-PSO framework to improve charger placement accuracy, especially in irregularly shaped deployment areas. Recent advancements have incorporated intelligent and adaptive techniques, such as reinforcement learning and swarm-based algorithms. Zhang et al.18 applied a deep reinforcement learning (DRL) approach for dynamic charger placement, allowing chargers to adapt their positions based on real-time sensor data. Patil and Patil19 utilized the Gray Wolf Optimizer to optimize the deployment of static chargers, achieving faster convergence and higher solution quality compared to conventional methods. Tariq et al.20 proposed an enhanced whale optimization algorithm to minimize the number of chargers and improve sensor coverage reliability. Despite these efforts, most existing methods focus solely on spatial optimization or on minimizing the number of chargers, without effectively combining both. Neelagandan et al.21 proposed a Grundy coloring algorithm to determine the minimum number of chargers and used the black hole algorithm to find their optimal placement. Neelagandan and Balaji22 proposed a Degree of Saturation approach to determine the minimum number of chargers and employed the Enhanced Grey Wolf Optimization algorithm for optimal charger placement. However, the enhancement phase in their method primarily identified ideal charger positions without considering sensors that were already covered, resulting in an incomplete enhancement process However, their results provided limited improvements compared to the outcomes presented in this work. This paper proposes an enhanced framework that achieves superior solutions by improving both the number of chargers and the placement efficiency. Furthermore, emerging metaheuristics, such as the Aquila Optimizer (AO), inspired by the hunting strategies of Aquila eagles, remain underexplored in this context. AO has shown strong global search capability and robustness in high-dimensional spaces, yet its application to charger placement is still limited. To address these gaps, the present work proposes a novel hybrid framework that integrates a graph-coloring approach (using DSATUR and Grundy heuristics) to minimize charger count and an EAO for determining their optimal spatial placement. This dual-phase method ensures both charger efficiency and optimal deployment, making it particularly well suited for dense and large-scale sensor networks Table 1. Table 1Comparison of related work on charger placement in WSNs.Author(s)Method/algorithmObjectiveKey contribution/OutcomeBalaji & Arivudainambi11Daubechies Wavelet-based methodCharger repositioning and coverageUtilized wavelet translation/dilation for effective placement; outperformed Haar, db2, bio55, and Symlets.He et al.12Energy scheduling and routing modelsEfficient energy deliveryProposed models for mobile charger scheduling and routing to extend WSN lifetime.Xie et al.13Static and mobile charging strategiesBalance cost, efficiency, energyAnalyzed trade-offs between static and mobile charging under different constraints.Zhang et al.14Heuristic searchOptimal charger placementModeled placement as optimization and applied heuristic strategies for efficiency.Alshahrani & Shoaib15Genetic Algorithm (GA)Coverage-constrained placementOptimized placement while satisfying coverage constraints; highlighted GA’s effectiveness.Qureshi et al.16Particle Swarm Optimization (PSO)Multiple charger deploymentAchieved good convergence rate and energy efficiency with PSO.Molla & Rha17Voronoi + Hybrid GA–PSOReduce charger redundancyCombined Voronoi partitioning with hybrid optimization for irregular areas.Zhang et al.18Deep Reinforcement Learning (DRL)Adaptive placementDynamic charger positioning based on real-time sensor data.Patil & Patil19Grey Wolf Optimizer (GWO)Static charger optimizationAchieved faster convergence and better solution quality.Tariq et al.20Enhanced Whale Optimization AlgorithmMinimize number of chargersImproved sensor coverage reliability and charger reduction.Neelagandan et al.21Grundy Coloring and Blackhole AlgorithmDetermine the minimum chargers needed and Charger placementGrundy Coloring Algorithm to determine minimum chargers and BH for Charger placement.Neelagandan and Balaji22Degree of saturation and Grey wolf AlgorithmDetermine the minimum chargers needed and charger placementDSA to determine minimum chargers and Enhancement in Charger placement.ProposedHybrid Graph Coloring and Enhanced AOIncorporates dynamic power and coverage constraintsDetermines optimal charger positions with 6% better coverage than standard AO. Comparison of related work on charger placement in WSNs. Problem formation Let be the set of m sensors deployed across a monitoring region of size A × A, and let be the set of n chargers available to recharge these sensors, where n FColumn 1618346.5713057.7610.85230.0001*Error143944.667281.76C. Total2022291.238 Analysis of variance (ANOVA) summary. To determine which specific algorithms differ significantly, Tukey’s HSD test was applied for all pairwise comparisons. The Tukey test identifies significant differences where the absolute mean difference exceeds the calculated critical value. Interpretation criteria include: If p < 0.05 and “Significant = Yes”, the performance difference between the pair is statistically significant. If p < 0.05 and “Significant = Yes”, the performance difference between the pair is statistically significant. If “Significant = No”, then no meaningful difference exists between the algorithm pair. If “Significant = No”, then no meaningful difference exists between the algorithm pair. The Tukey HSD results indicate that EAO_Avg significantly outperforms Rand_Avg, Rain_Avg, and DA_Avg, and shows statistically significant improvements over all other algorithms which shows in Table 13. Moreover, AO_Avg and BH_Avg also perform significantly better than baseline methods such as Random and Raindrop. As illustrated in Figs. 11 and 12, the fitness value distribution and convergence of all algorithm clearly demonstrates that the proposed EAO achieves superior performance compared to the other algorithms. These findings strongly support the use of evolutionary and hybrid metaheuristics for charger placement in expanding sensor fields, confirming their robustness and superior optimization capability under scaling conditions. Table 13Tukey HSD comparisons of EAO_Avg with other algorithms (FWER = 0.05).ComparisonMean differencep-valueSignificantEAO_Avg vs. AO_Avg6.330.04YESEAO_Avg vs. BH_Avg8.470.03YESEAO_Avg vs. DA_Avg9.030.03YESEAO_Avg vs. GWA_Avg12.170.02YESEAO_Avg vs. Rain_Avg13.600.01YESEAO_Avg vs. Rand_Avg12.130.01YES Tukey HSD comparisons of EAO_Avg with other algorithms (FWER = 0.05). Fitness value distribution of all the algorithm across sensors. Convergence of all the algorithm across sensors. Conclusion This paper presents a comprehensive two-stage optimization framework for efficient charger deployment in wireless sensor networks, addressing both the minimization of the number of chargers and their optimal placement to ensure maximum sensor coverage. The integration of degree-based saturation with Grundy coloring in the first stage successfully determines the minimal number of chargers required, reducing infrastructure costs compared to traditional methods. In the second stage, the Enhanced Aquila Optimization algorithm, inspired by the hunting strategies of eagles, effectively optimizes charger placement by minimizing energy transfer distances while satisfying coverage and power constraints. Experimental results demonstrate that Enhanced Aquila Optimization not only achieves superior sensor coverage of 99% but also converges significantly faster than other state-of-the-art metaheuristic algorithms such as Raindrop, Grey Wolf, Black Hole, Dragonfly, and the standard Aquila Optimization. Furthermore, Enhanced Aquila Optimization balances computational efficiency and solution quality, making it suitable for real-time and resource-constrained wireless sensor network environments. The proposed framework thus offers a practical, scalable, and robust solution for prolonging the network lifetime and ensuring uninterrupted sensor operation in wireless sensor networks. But in this study is based entirely on theoretical modeling and simulation to determine the minimum number of chargers and their optimal placement for recharging all sensors. A real-world testbed implementation has not yet been conducted, which is a limitation of this work. Future work may explore dynamic charger deployment adapting to network changes, fault tolerance improvements, and integration with energy harvesting techniques to further enhance wireless sensor network sustainability. Author contributions Neelagandan P and Balaji S: Conceptualization, Methodology, Formal analysis, Writing – original draft, Writing – review and editing. Both the authors contributed equally to all aspects of this work. Funding Open access funding provided by Vellore Institute of Technology. Data availability The datasets used and/or analyzed during the current study can be generated from the Matlab code provided at https://zenodo.org/ and the 10.5281/zenodo.18875353. Its open source for public. Declarations Competing interests The authors declare no competing interests. Footnotes Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations. P. Neelagandan and S. Balaji contributed equally to this work. References Associated Data Data Availability Statement The datasets used and/or analyzed during the current study can be generated from the Matlab code provided at https://zenodo.org/ and the 10.5281/zenodo.18875353. Its open source for public.