Guoliang Xu, Yanyun Zhao, Yongyi Ran, Ruili Zhao, Jiangtao Luo
{"title":"低轨道卫星网络空间定位辅助全分布式动态路由研究","authors":"Guoliang Xu, Yanyun Zhao, Yongyi Ran, Ruili Zhao, Jiangtao Luo","doi":"10.1109/GLOBECOM48099.2022.10001698","DOIUrl":null,"url":null,"abstract":"As the Low Earth Orbit (LEO) satellite has extremely high moving speed and limited networking resources, designing dynamic routing has become a promising approach to improve satellite communication performance. Due to the hundreds of satellites within a constellation and the complex attributes of each satellite, traditional routing strategies based on centralized paradigm derivation face increasingly complex challenges. To address these issues, this paper jointly optimizes queuing delay and propagation delay by proposing a fully distributed routing algorithm based on deep reinforcement learning. Each satellite builds a partially observable Markov decision process (POMDP) model based on the spatial location and queue length of surrounding nodes and adaptively selects the next hop by calculating the estimated residual propagation delay between the neighboring satellites and the destination satellite. Simulation analysis shows that our proposed method has tremendous advantages and effectiveness.","PeriodicalId":313199,"journal":{"name":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Towards Spatial Location Aided Fully-Distributed Dynamic Routing for LEO Satellite Networks\",\"authors\":\"Guoliang Xu, Yanyun Zhao, Yongyi Ran, Ruili Zhao, Jiangtao Luo\",\"doi\":\"10.1109/GLOBECOM48099.2022.10001698\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As the Low Earth Orbit (LEO) satellite has extremely high moving speed and limited networking resources, designing dynamic routing has become a promising approach to improve satellite communication performance. Due to the hundreds of satellites within a constellation and the complex attributes of each satellite, traditional routing strategies based on centralized paradigm derivation face increasingly complex challenges. To address these issues, this paper jointly optimizes queuing delay and propagation delay by proposing a fully distributed routing algorithm based on deep reinforcement learning. Each satellite builds a partially observable Markov decision process (POMDP) model based on the spatial location and queue length of surrounding nodes and adaptively selects the next hop by calculating the estimated residual propagation delay between the neighboring satellites and the destination satellite. Simulation analysis shows that our proposed method has tremendous advantages and effectiveness.\",\"PeriodicalId\":313199,\"journal\":{\"name\":\"GLOBECOM 2022 - 2022 IEEE Global Communications Conference\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"GLOBECOM 2022 - 2022 IEEE Global Communications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOBECOM48099.2022.10001698\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOBECOM48099.2022.10001698","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Towards Spatial Location Aided Fully-Distributed Dynamic Routing for LEO Satellite Networks
As the Low Earth Orbit (LEO) satellite has extremely high moving speed and limited networking resources, designing dynamic routing has become a promising approach to improve satellite communication performance. Due to the hundreds of satellites within a constellation and the complex attributes of each satellite, traditional routing strategies based on centralized paradigm derivation face increasingly complex challenges. To address these issues, this paper jointly optimizes queuing delay and propagation delay by proposing a fully distributed routing algorithm based on deep reinforcement learning. Each satellite builds a partially observable Markov decision process (POMDP) model based on the spatial location and queue length of surrounding nodes and adaptively selects the next hop by calculating the estimated residual propagation delay between the neighboring satellites and the destination satellite. Simulation analysis shows that our proposed method has tremendous advantages and effectiveness.