{"title":"Revolutionizing Wireless Rechargeable Sensor Networks: Speed Optimization-based Charging Scheduling Scheme (SOCSS) for efficient multi-node energy transfer","authors":"Riya Goyal, Abhinav Tomar","doi":"10.1016/j.swevo.2025.101961","DOIUrl":null,"url":null,"abstract":"<div><div>Benefiting from the breakthrough of Wireless Energy Transfer (WET) technology, scheduling multiple Mobile Chargers (MCs) to charge sensor nodes can significantly prolong the lifetime of Wireless Rechargeable Sensor Networks (WRSNs). While previous studies have primarily focused on on-demand recharging within WRSNs, more consideration must be given to utilizing multi-node energy transfer with optimal charging locations to devise efficient charging schedules for requesting sensor nodes. Moreover, existing approaches assume a constant travel speed for MCs and utilize omnidirectional WET, leading to increased energy consumption for MCs and consequently affecting overall charging efficiency. To address these challenges, we propose a novel Speed Optimization-based Charging Scheduling Scheme (SOCSS) for multiple MCs in WRSNs. The initial phase of SOCSS involves clique-based network partitioning to identify minimum cliques and determine optimal charging locations to perform efficient multi-node energy transfer for sensor nodes. The subsequent phase encompasses scheduling and path planning, where the charging schedule is established using efficient Quantum-inspired Particle Swarm Optimization. By integrating speed optimization with the charging schedule, the energy consumption of the MCs is minimized, leading to cost-effective planning of the charging path for energy-constrained MCs. Extensive simulations are conducted to showcase the supremacy of SOCSS across a range of network parameters compared to prior art. In particular, SOCSS has achieved an impressive average reduction of 36.2% in the number of stopping points for MCs, a remarkable 38.9% decrease in the total travel distance, and a 15.7% reduction in the charging delay.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"96 ","pages":"Article 101961"},"PeriodicalIF":8.2000,"publicationDate":"2025-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225001191","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Benefiting from the breakthrough of Wireless Energy Transfer (WET) technology, scheduling multiple Mobile Chargers (MCs) to charge sensor nodes can significantly prolong the lifetime of Wireless Rechargeable Sensor Networks (WRSNs). While previous studies have primarily focused on on-demand recharging within WRSNs, more consideration must be given to utilizing multi-node energy transfer with optimal charging locations to devise efficient charging schedules for requesting sensor nodes. Moreover, existing approaches assume a constant travel speed for MCs and utilize omnidirectional WET, leading to increased energy consumption for MCs and consequently affecting overall charging efficiency. To address these challenges, we propose a novel Speed Optimization-based Charging Scheduling Scheme (SOCSS) for multiple MCs in WRSNs. The initial phase of SOCSS involves clique-based network partitioning to identify minimum cliques and determine optimal charging locations to perform efficient multi-node energy transfer for sensor nodes. The subsequent phase encompasses scheduling and path planning, where the charging schedule is established using efficient Quantum-inspired Particle Swarm Optimization. By integrating speed optimization with the charging schedule, the energy consumption of the MCs is minimized, leading to cost-effective planning of the charging path for energy-constrained MCs. Extensive simulations are conducted to showcase the supremacy of SOCSS across a range of network parameters compared to prior art. In particular, SOCSS has achieved an impressive average reduction of 36.2% in the number of stopping points for MCs, a remarkable 38.9% decrease in the total travel distance, and a 15.7% reduction in the charging delay.
期刊介绍:
Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.