基于深度强化学习的URLLC和eMBB复用优化

Yang Li, Chunjing Hu, Jun Wang, Mingfeng Xu
{"title":"基于深度强化学习的URLLC和eMBB复用优化","authors":"Yang Li, Chunjing Hu, Jun Wang, Mingfeng Xu","doi":"10.1109/ICCChinaW.2019.8850168","DOIUrl":null,"url":null,"abstract":"In 5G mobile networks, multiple scenarios have emerged to meet different services requirement. The limited spectrum resource becoming more and more crowed to meet different requirements. To improve the limited transmission resource (spectrum, time, power etc.) utilization while meet the different needs of users, we introduce the reward function as a measure of different allocate policies. Then we calculate the reward that different allocation policies might gain. The arrived state is a Markov Process which means the next coming state is only determined by the current state. To solve the optimization problem, we introduce the Q-Iearning algorithm. Due to the state space is enormous, this paper strives to illustrate a DQN (Deep Q-Network) based resource allocation algorithm. Numerical experiments provided in this paper show the performance of the proposed algorithms by comparing with two baselines.","PeriodicalId":252172,"journal":{"name":"2019 IEEE/CIC International Conference on Communications Workshops in China (ICCC Workshops)","volume":"196 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Optimization of URLLC and eMBB Multiplexing via Deep Reinforcement Learning\",\"authors\":\"Yang Li, Chunjing Hu, Jun Wang, Mingfeng Xu\",\"doi\":\"10.1109/ICCChinaW.2019.8850168\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In 5G mobile networks, multiple scenarios have emerged to meet different services requirement. The limited spectrum resource becoming more and more crowed to meet different requirements. To improve the limited transmission resource (spectrum, time, power etc.) utilization while meet the different needs of users, we introduce the reward function as a measure of different allocate policies. Then we calculate the reward that different allocation policies might gain. The arrived state is a Markov Process which means the next coming state is only determined by the current state. To solve the optimization problem, we introduce the Q-Iearning algorithm. Due to the state space is enormous, this paper strives to illustrate a DQN (Deep Q-Network) based resource allocation algorithm. Numerical experiments provided in this paper show the performance of the proposed algorithms by comparing with two baselines.\",\"PeriodicalId\":252172,\"journal\":{\"name\":\"2019 IEEE/CIC International Conference on Communications Workshops in China (ICCC Workshops)\",\"volume\":\"196 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE/CIC International Conference on Communications Workshops in China (ICCC Workshops)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCChinaW.2019.8850168\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE/CIC International Conference on Communications Workshops in China (ICCC Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCChinaW.2019.8850168","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

摘要

在5G移动网络中,出现了多种场景,以满足不同的业务需求。为了满足不同的需求,有限的频谱资源变得越来越拥挤。为了提高有限的传输资源(频谱、时间、功率等)的利用率,同时满足用户的不同需求,我们引入了奖励函数作为不同分配策略的度量。然后我们计算不同分配策略可能获得的回报。到达的状态是一个马尔可夫过程,这意味着下一个到来的状态仅由当前状态决定。为了解决优化问题,我们引入了q -学习算法。由于状态空间非常大,本文试图阐述一种基于深度q网络(Deep Q-Network)的资源分配算法。本文提供的数值实验通过与两个基线的比较,验证了所提算法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimization of URLLC and eMBB Multiplexing via Deep Reinforcement Learning
In 5G mobile networks, multiple scenarios have emerged to meet different services requirement. The limited spectrum resource becoming more and more crowed to meet different requirements. To improve the limited transmission resource (spectrum, time, power etc.) utilization while meet the different needs of users, we introduce the reward function as a measure of different allocate policies. Then we calculate the reward that different allocation policies might gain. The arrived state is a Markov Process which means the next coming state is only determined by the current state. To solve the optimization problem, we introduce the Q-Iearning algorithm. Due to the state space is enormous, this paper strives to illustrate a DQN (Deep Q-Network) based resource allocation algorithm. Numerical experiments provided in this paper show the performance of the proposed algorithms by comparing with two baselines.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Space Propagation Model for Wireless Power Transfer System of Dual Transmitter Signal Detection for Batteryless Backscatter Systems with Multiple-Antenna Tags Research on wireless sensor network location based on Improve Pigeon-inspired optimization A novel spinal codes based on chaotic Kent mapping Spectrum usage model for smart spectrum
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1