Optimized Sparrow Search-based Multiplexing of eMBB and URLLC in 5G/B5G Networks

Mengqiu Tian, Changle Li, Yilong Hui, Nan Cheng, Maofeng Luo
{"title":"Optimized Sparrow Search-based Multiplexing of eMBB and URLLC in 5G/B5G Networks","authors":"Mengqiu Tian, Changle Li, Yilong Hui, Nan Cheng, Maofeng Luo","doi":"10.1109/GLOBECOM48099.2022.10001001","DOIUrl":null,"url":null,"abstract":"In 5G/B5G networks, the preemptive scheduling provides an efficient solution to the coexistence problem of eMBB/URLLC services. Current works usually assume that the downlink transmission duration of each URLLC service is within one mini-slot, which ignores the different requirements of URLLC users and may lead to the severe data rate loss of eMBB services and low resource utilization efficiency. To deal with above problem, we propose a novel URLLC preemptive strategy, where the arriving URLLC services could cross through multiple mini-slots rather than only one to puncture resources on demand. With the proposed strategy, considering the heterogeneous delay requirements of URLLC services and the preemptive influence on eMBB services, an efficient algorithm based on optimized sparrow search is also proposed. Through allocating time and frequency resources occupied by each URLLC service on de-mand, the number of URLLC services supported by the gNB is maximized while the satisfaction of eMBB services is ensured. The simulation results indicate that the proposed algorithm can achieve better performance compared with the benchmark schemes.","PeriodicalId":313199,"journal":{"name":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","volume":"144 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOBECOM48099.2022.10001001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In 5G/B5G networks, the preemptive scheduling provides an efficient solution to the coexistence problem of eMBB/URLLC services. Current works usually assume that the downlink transmission duration of each URLLC service is within one mini-slot, which ignores the different requirements of URLLC users and may lead to the severe data rate loss of eMBB services and low resource utilization efficiency. To deal with above problem, we propose a novel URLLC preemptive strategy, where the arriving URLLC services could cross through multiple mini-slots rather than only one to puncture resources on demand. With the proposed strategy, considering the heterogeneous delay requirements of URLLC services and the preemptive influence on eMBB services, an efficient algorithm based on optimized sparrow search is also proposed. Through allocating time and frequency resources occupied by each URLLC service on de-mand, the number of URLLC services supported by the gNB is maximized while the satisfaction of eMBB services is ensured. The simulation results indicate that the proposed algorithm can achieve better performance compared with the benchmark schemes.
5G/B5G网络中基于麻雀搜索的eMBB和URLLC复用优化
在5G/B5G网络中,抢占式调度为eMBB/URLLC业务共存问题提供了有效的解决方案。目前的工作通常假设每个URLLC业务的下行传输时长在一个mini-slot内,忽略了URLLC用户的不同需求,可能导致eMBB业务数据速率丢失严重,资源利用效率低下。为了解决上述问题,我们提出了一种新颖的URLLC抢占策略,即到达的URLLC服务可以通过多个小槽而不是只有一个来按需穿刺资源。在此策略下,考虑URLLC业务的异构时延需求和eMBB业务的抢占影响,提出了一种基于优化麻雀搜索的高效算法。通过按需分配各URLLC业务占用的时间和频率资源,实现gNB支持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学术文献互助群
群 号:604180095
Book学术官方微信