{"title":"Enhancing Wireless Sensor Durability via On-Demand Mobile Charging and Energy Estimation","authors":"Dinesh Dash, Rupayan Das, Chandra Bhushan Kumar Yadav","doi":"10.1002/cpe.70205","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>In wireless rechargeable sensor networks (WRSN), wireless energy charging (WEC) is a potential approach to extend sensor lifetime. To continuously provide electric charge to sensors, WEC uses a mobile charger (MC). All things considered, creating a charging plan that works for the MC is difficult because it depends on various aspects such the amount of energy left, the location of the limitations, and the time of day. The purpose of this work is to offer a novel and efficient charging process to extend the life of sensors in WRSN. According to this algorithm, the sensors periodically transmit to the service station (SS) the energy spending rate and their remaining energy. The SS estimates how long the sensors will last, and if it falls below a predetermined level, that sensor is taken into consideration for charging and is placed in a serving queue. After that, the SS schedules MC using a suggested priority function. Comparing the suggested method to baseline charging techniques, simulation experiments show that it performs better in terms of charging, especially in terms of prolonging the lifetime of sensors. The experimental results demonstrate that the suggested method outperforms the state-of-the-art approaches, in achieving a superior average dead period for sensors.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 18-20","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70205","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0
Abstract
In wireless rechargeable sensor networks (WRSN), wireless energy charging (WEC) is a potential approach to extend sensor lifetime. To continuously provide electric charge to sensors, WEC uses a mobile charger (MC). All things considered, creating a charging plan that works for the MC is difficult because it depends on various aspects such the amount of energy left, the location of the limitations, and the time of day. The purpose of this work is to offer a novel and efficient charging process to extend the life of sensors in WRSN. According to this algorithm, the sensors periodically transmit to the service station (SS) the energy spending rate and their remaining energy. The SS estimates how long the sensors will last, and if it falls below a predetermined level, that sensor is taken into consideration for charging and is placed in a serving queue. After that, the SS schedules MC using a suggested priority function. Comparing the suggested method to baseline charging techniques, simulation experiments show that it performs better in terms of charging, especially in terms of prolonging the lifetime of sensors. The experimental results demonstrate that the suggested method outperforms the state-of-the-art approaches, in achieving a superior average dead period for sensors.
期刊介绍:
Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of:
Parallel and distributed computing;
High-performance computing;
Computational and data science;
Artificial intelligence and machine learning;
Big data applications, algorithms, and systems;
Network science;
Ontologies and semantics;
Security and privacy;
Cloud/edge/fog computing;
Green computing; and
Quantum computing.