低轨道卫星网络中电池寿命最大化的动态路由算法

F. Chen, Qianzhu Wang, Yongyi Ran
{"title":"低轨道卫星网络中电池寿命最大化的动态路由算法","authors":"F. Chen, Qianzhu Wang, Yongyi Ran","doi":"10.1109/ICCC56324.2022.10065623","DOIUrl":null,"url":null,"abstract":"Battery pack is the core component of the low orbit (LEO) satellite energy storage system. The rapid depletion of satellite node battery energy due to overload in the network and the increase in depth of discharge (DOD) will shorten the battery life cycle and severely reduce the satellite operational life. This paper proposes a dynamic routing algorithm to maximize satellite battery life in LEO satellite networks. By building a multi-objective optimization problem aimed at maximizing the satellite battery life and minimizing the end - to-end delay and packet loss rate. Satellite network routing is considered as a Markov Decision Process (MDP), while combining deep learning with reinforcement learning to learn a routing strategy by utilizing the former's powerful perception capability and the latter's decision making capability to balance the inter-satellite battery usage and reduce the satellite battery cycle life consumption. Simulation results show that the proposed algorithm can avoid over-discharge of satellites throughout the satellite network cycle, effectively extend the satellite lifetime, and ensure low end-to-end delay and packet loss rate.","PeriodicalId":263098,"journal":{"name":"2022 IEEE 8th International Conference on Computer and Communications (ICCC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dynamic Routing Algorithm for Maximizing Battery Life in LEO Satellite Networks\",\"authors\":\"F. Chen, Qianzhu Wang, Yongyi Ran\",\"doi\":\"10.1109/ICCC56324.2022.10065623\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Battery pack is the core component of the low orbit (LEO) satellite energy storage system. The rapid depletion of satellite node battery energy due to overload in the network and the increase in depth of discharge (DOD) will shorten the battery life cycle and severely reduce the satellite operational life. This paper proposes a dynamic routing algorithm to maximize satellite battery life in LEO satellite networks. By building a multi-objective optimization problem aimed at maximizing the satellite battery life and minimizing the end - to-end delay and packet loss rate. Satellite network routing is considered as a Markov Decision Process (MDP), while combining deep learning with reinforcement learning to learn a routing strategy by utilizing the former's powerful perception capability and the latter's decision making capability to balance the inter-satellite battery usage and reduce the satellite battery cycle life consumption. Simulation results show that the proposed algorithm can avoid over-discharge of satellites throughout the satellite network cycle, effectively extend the satellite lifetime, and ensure low end-to-end delay and packet loss rate.\",\"PeriodicalId\":263098,\"journal\":{\"name\":\"2022 IEEE 8th International Conference on Computer and Communications (ICCC)\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 8th International Conference on Computer and Communications (ICCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCC56324.2022.10065623\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 8th International Conference on Computer and Communications (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCC56324.2022.10065623","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

电池组是低轨道卫星储能系统的核心部件。卫星节点电池能量因网络过载而迅速耗竭,放电深度(DOD)增加,将缩短电池寿命周期,严重降低卫星的使用寿命。针对低轨道卫星网络中卫星电池寿命最大化的问题,提出了一种动态路由算法。通过建立以最大卫星电池寿命、最小端到端时延和丢包率为目标的多目标优化问题。将卫星网络路由视为马尔可夫决策过程(Markov Decision Process, MDP),将深度学习与强化学习相结合,利用深度学习强大的感知能力和强化学习的决策能力来学习路由策略,平衡卫星间电池的使用,降低卫星电池的循环寿命消耗。仿真结果表明,该算法在整个卫星网络周期内避免了卫星的过放电,有效延长了卫星的寿命,保证了较低的端到端时延和丢包率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dynamic Routing Algorithm for Maximizing Battery Life in LEO Satellite Networks
Battery pack is the core component of the low orbit (LEO) satellite energy storage system. The rapid depletion of satellite node battery energy due to overload in the network and the increase in depth of discharge (DOD) will shorten the battery life cycle and severely reduce the satellite operational life. This paper proposes a dynamic routing algorithm to maximize satellite battery life in LEO satellite networks. By building a multi-objective optimization problem aimed at maximizing the satellite battery life and minimizing the end - to-end delay and packet loss rate. Satellite network routing is considered as a Markov Decision Process (MDP), while combining deep learning with reinforcement learning to learn a routing strategy by utilizing the former's powerful perception capability and the latter's decision making capability to balance the inter-satellite battery usage and reduce the satellite battery cycle life consumption. Simulation results show that the proposed algorithm can avoid over-discharge of satellites throughout the satellite network cycle, effectively extend the satellite lifetime, and ensure low end-to-end delay and packet loss rate.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信