何时到达天空?一种基于drl的非地面网络路由框架

Akanksha Sharma;Sharda Tripathi;Sandeep Joshi
{"title":"何时到达天空?一种基于drl的非地面网络路由框架","authors":"Akanksha Sharma;Sharda Tripathi;Sandeep Joshi","doi":"10.1109/LNET.2025.3529514","DOIUrl":null,"url":null,"abstract":"Non-terrestrial networks are envisioned to be an integral component of the beyond-fifth-generation wireless communication networks, catering to both conventional and emerging communication applications. In particular, a plethora of use cases are emerging for ultra-reliable low-latency communication, which require dynamic and quality of service compliant frameworks. In this letter, we formulate a binary integer non-linear programming problem to route time-critical traffic through non-terrestrial nodes. As the problem is NP-hard, we propose the solution using a deep reinforcement learning framework, taking into account the interactions between the terrestrial and various non-terrestrial nodes with an end-to-end latency target while maximizing the coverage probability. We perform simulations for multiple latency deadlines and outage thresholds and the results corroborate the efficiency of the proposed framework. Furthermore, we benchmark the proposed framework and show an improvement of 96.31% in coverage while incurring only 3.2% latency violations compared to the state-of-the-art.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"7 1","pages":"16-20"},"PeriodicalIF":0.0000,"publicationDate":"2025-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10841394","citationCount":"0","resultStr":"{\"title\":\"When to Reach for the Skies? A DRL-Based Routing Framework for Non-Terrestrial Networks\",\"authors\":\"Akanksha Sharma;Sharda Tripathi;Sandeep Joshi\",\"doi\":\"10.1109/LNET.2025.3529514\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Non-terrestrial networks are envisioned to be an integral component of the beyond-fifth-generation wireless communication networks, catering to both conventional and emerging communication applications. In particular, a plethora of use cases are emerging for ultra-reliable low-latency communication, which require dynamic and quality of service compliant frameworks. In this letter, we formulate a binary integer non-linear programming problem to route time-critical traffic through non-terrestrial nodes. As the problem is NP-hard, we propose the solution using a deep reinforcement learning framework, taking into account the interactions between the terrestrial and various non-terrestrial nodes with an end-to-end latency target while maximizing the coverage probability. We perform simulations for multiple latency deadlines and outage thresholds and the results corroborate the efficiency of the proposed framework. Furthermore, we benchmark the proposed framework and show an improvement of 96.31% in coverage while incurring only 3.2% latency violations compared to the state-of-the-art.\",\"PeriodicalId\":100628,\"journal\":{\"name\":\"IEEE Networking Letters\",\"volume\":\"7 1\",\"pages\":\"16-20\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2025-01-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10841394\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Networking Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10841394/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Networking Letters","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10841394/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

非地面网络被设想为第五代以上无线通信网络的一个组成部分,满足传统和新兴通信应用的需求。特别是,超可靠的低延迟通信的大量用例正在出现,这需要动态和服务质量兼容的框架。在这封信中,我们制定了一个二进制整数非线性规划问题,通过非地面节点路由时间关键型流量。由于问题是np困难的,我们提出了使用深度强化学习框架的解决方案,在最大化覆盖概率的同时,考虑到具有端到端延迟目标的地面和各种非地面节点之间的相互作用。我们对多个延迟截止日期和中断阈值进行了模拟,结果证实了所提出框架的有效性。此外,我们对提议的框架进行了基准测试,结果显示,与最先进的框架相比,覆盖率提高了96.31%,而延迟违规仅为3.2%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
When to Reach for the Skies? A DRL-Based Routing Framework for Non-Terrestrial Networks
Non-terrestrial networks are envisioned to be an integral component of the beyond-fifth-generation wireless communication networks, catering to both conventional and emerging communication applications. In particular, a plethora of use cases are emerging for ultra-reliable low-latency communication, which require dynamic and quality of service compliant frameworks. In this letter, we formulate a binary integer non-linear programming problem to route time-critical traffic through non-terrestrial nodes. As the problem is NP-hard, we propose the solution using a deep reinforcement learning framework, taking into account the interactions between the terrestrial and various non-terrestrial nodes with an end-to-end latency target while maximizing the coverage probability. We perform simulations for multiple latency deadlines and outage thresholds and the results corroborate the efficiency of the proposed framework. Furthermore, we benchmark the proposed framework and show an improvement of 96.31% in coverage while incurring only 3.2% latency violations compared to the state-of-the-art.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信