A DRL-based Partial Charging Algorithm for Wireless Rechargeable Sensor Networks

Author:

Chen Jiangyuan1ORCID,Hawbani Ammar2ORCID,Xu Xiaohua1ORCID,Wang Xingfu1ORCID,Zhao Liang3ORCID,Liu Zhi4ORCID,Alsamhi Saeed5ORCID

Affiliation:

1. School of Computer Science and Technology, University of Science and Technology of China, Hefei, China

2. School of Computer Science, Shenyang Aerospace University, Hefei, China

3. School of Computer Science, Shenyang Aerospace University, Shenyang, China

4. Department of Computer and Network Engineering, University of Electro-Communications, Chofu Japan

5. Insight Centre for Data Analytics, University of Galway, Galway, Ireland

Abstract

Breakthroughs in Wireless Energy Transfer technologies have revitalized Wireless Rechargeable Sensor Networks. However, how to schedule mobile chargers rationally has been quite a tricky problem. Most of the current work does not consider the variability of scenarios and how many mobile chargers should be scheduled as the most appropriate for each dispatch. At the same time, the focus of most work on the mobile charger scheduling problem has always been on reducing the number of dead nodes, and the most critical metric of network performance, packet arrival rate, is relatively neglected. In this article, we develop a DRL-based Partial Charging algorithm. Based on the number and urgency of charging requests, we classify charging requests into four scenarios. And for each scenario, we design a corresponding request allocation algorithm. Then, a Deep Reinforcement Learning algorithm is employed to train a decision model using environmental information to select which request allocation algorithm is optimal for the current scenario. After the allocation of charging requests is confirmed, to improve the Quality of Service, i.e., the packet arrival rate of the entire network, a partial charging scheduling algorithm is designed to maximize the total charging duration of nodes in the ideal state while ensuring that all charging requests are completed. In addition, we analyze the traffic information of the nodes and use the Analytic Hierarchy Process to determine the importance of the nodes to compensate for the inaccurate estimation of the node’s remaining lifetime in realistic scenarios. Simulation results show that our proposed algorithm outperforms the existing algorithms regarding the number of alive nodes and packet arrival rate.

Funder

Innovation Team and Talents Cultivation Program of the National Administration of Traditional Chinese Medicine

Open Fund of Anhui Engineering Research Center for Intelligent Applications and Security of Industrial Internet

Shenyang Aerospace University Talent Research Start-up Fund

National Natural Science Foundation of China

Anhui Provincial Key R&D Program

Research Launch Project of University of Science and Technology of Chin

Publisher

Association for Computing Machinery (ACM)

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3