Resource Allocation for URLLC and eMBB Traffic in Uplink Wireless Networks

D. Lee, Cheng-Shang Chang, Ruhui Zhang, Mao-Pin Lee
{"title":"Resource Allocation for URLLC and eMBB Traffic in Uplink Wireless Networks","authors":"D. Lee, Cheng-Shang Chang, Ruhui Zhang, Mao-Pin Lee","doi":"10.2139/ssrn.4220800","DOIUrl":null,"url":null,"abstract":"In this paper we consider two resource allocation problems of URLLC traffic and eMBB traffic in uplink 5G networks. We propose to divide frequencies into a common region and a grant-based region. Frequencies in the grant-based region can only be used by eMBB traffic, while frequencies in the common region can be used by eMBB traffic as well as URLLC traffic. In the first resource allocation problem we propose a two-player game to address the size of the grant-based region and the size of the common region. We show that this game has specific pure Nash equilibria. In the second resource allocation problem we determine the number of packets that each eMBB user can transmit in a request-grant cycle. We propose a constrained optimization problem to minimize the variance of the number of packets granted to the eMBB users. We show that a water-filling algorithm solves this constrained optimization problem. From simulation, we show that our scheme, consisting of resource allocation according to Nash equilibria of a game, persistent random retransmission of URLLC packets and allocation of eMBB packets by a water-filling algorithm, works better than four other heuristic methods.","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Perform. Evaluation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.4220800","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper we consider two resource allocation problems of URLLC traffic and eMBB traffic in uplink 5G networks. We propose to divide frequencies into a common region and a grant-based region. Frequencies in the grant-based region can only be used by eMBB traffic, while frequencies in the common region can be used by eMBB traffic as well as URLLC traffic. In the first resource allocation problem we propose a two-player game to address the size of the grant-based region and the size of the common region. We show that this game has specific pure Nash equilibria. In the second resource allocation problem we determine the number of packets that each eMBB user can transmit in a request-grant cycle. We propose a constrained optimization problem to minimize the variance of the number of packets granted to the eMBB users. We show that a water-filling algorithm solves this constrained optimization problem. From simulation, we show that our scheme, consisting of resource allocation according to Nash equilibria of a game, persistent random retransmission of URLLC packets and allocation of eMBB packets by a water-filling algorithm, works better than four other heuristic methods.
无线上行网络中URLLC和eMBB业务的资源分配
本文研究了5G上行网络中URLLC业务和eMBB业务的资源分配问题。我们建议将频率划分为公共区域和基于授权的区域。授权区域的频率只能由eMBB流量使用,而公共区域的频率可以由eMBB流量和URLLC流量使用。在第一个资源分配问题中,我们提出了一个双人博弈来解决基于拨款的区域的大小和公共区域的大小。我们证明了这个博弈有特定的纯纳什均衡。在第二个资源分配问题中,我们确定每个eMBB用户在请求授予周期中可以传输的数据包数量。我们提出了一个约束优化问题,以最小化授予eMBB用户的数据包数量的方差。我们证明了一种充水算法解决了这个约束优化问题。仿真结果表明,基于博弈纳什均衡的资源分配、URLLC报文的持续随机重传和灌水算法的eMBB报文分配方案比其他四种启发式方法效果更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信