无小区大规模多输入多输出系统中 URLLC 的联合功率优化和子载波分配

IF 3.7 3区 计算机科学 Q2 TELECOMMUNICATIONS
Longlong Cao;Jiaxing Fang;Yan Wang;Pengcheng Zhu
{"title":"无小区大规模多输入多输出系统中 URLLC 的联合功率优化和子载波分配","authors":"Longlong Cao;Jiaxing Fang;Yan Wang;Pengcheng Zhu","doi":"10.1109/LCOMM.2024.3452754","DOIUrl":null,"url":null,"abstract":"In this letter, we propose a joint power optimization and subcarrier allocation algorithm for cell-free massive multiple-input multiple-output systems in the ultra-reliable and low-latency communication (URLLC) scenario. Considering the bursty and stochastic character of URLLC traffic, we employ a proactive packet dropping mechanism to address the queueing issue of URLLC packets within deep fading channels, where the required transmit power to guarantee queueing delay and transmission error probability becomes unbounded. Therefore, we formulate an optimization problem to minimize the required maximal transmit power and the queueing delay by optimizing the packet loss policy, power, and bandwidth allocation policies. Simulation results validate our analysis and show that the proposed algorithm can effectively reduce the required maximal transmit power to meet the requirements of URLLC, and that spatial diversity contributes to reducing the complexity of the proposed algorithm.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 10","pages":"2323-2327"},"PeriodicalIF":3.7000,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Joint Power Optimization and Subcarrier Allocation for URLLC in Cell-Free Massive MIMO System\",\"authors\":\"Longlong Cao;Jiaxing Fang;Yan Wang;Pengcheng Zhu\",\"doi\":\"10.1109/LCOMM.2024.3452754\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this letter, we propose a joint power optimization and subcarrier allocation algorithm for cell-free massive multiple-input multiple-output systems in the ultra-reliable and low-latency communication (URLLC) scenario. Considering the bursty and stochastic character of URLLC traffic, we employ a proactive packet dropping mechanism to address the queueing issue of URLLC packets within deep fading channels, where the required transmit power to guarantee queueing delay and transmission error probability becomes unbounded. Therefore, we formulate an optimization problem to minimize the required maximal transmit power and the queueing delay by optimizing the packet loss policy, power, and bandwidth allocation policies. Simulation results validate our analysis and show that the proposed algorithm can effectively reduce the required maximal transmit power to meet the requirements of URLLC, and that spatial diversity contributes to reducing the complexity of the proposed algorithm.\",\"PeriodicalId\":13197,\"journal\":{\"name\":\"IEEE Communications Letters\",\"volume\":\"28 10\",\"pages\":\"2323-2327\"},\"PeriodicalIF\":3.7000,\"publicationDate\":\"2024-09-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Communications Letters\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10662959/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"TELECOMMUNICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Communications Letters","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10662959/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

在这封信中,我们针对超可靠和低延迟通信(URLLC)场景中的无小区大规模多输入多输出系统提出了一种联合功率优化和子载波分配算法。考虑到 URLLC 流量的突发性和随机性,我们采用了一种主动丢包机制,以解决深衰落信道中 URLLC 数据包的排队问题。因此,我们提出了一个优化问题,通过优化丢包策略、功率和带宽分配策略,最小化所需的最大发射功率和队列延迟。仿真结果验证了我们的分析,并表明所提算法能有效降低所需的最大发射功率,以满足 URLLC 的要求,而且空间分集有助于降低所提算法的复杂性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Joint Power Optimization and Subcarrier Allocation for URLLC in Cell-Free Massive MIMO System
In this letter, we propose a joint power optimization and subcarrier allocation algorithm for cell-free massive multiple-input multiple-output systems in the ultra-reliable and low-latency communication (URLLC) scenario. Considering the bursty and stochastic character of URLLC traffic, we employ a proactive packet dropping mechanism to address the queueing issue of URLLC packets within deep fading channels, where the required transmit power to guarantee queueing delay and transmission error probability becomes unbounded. Therefore, we formulate an optimization problem to minimize the required maximal transmit power and the queueing delay by optimizing the packet loss policy, power, and bandwidth allocation policies. Simulation results validate our analysis and show that the proposed algorithm can effectively reduce the required maximal transmit power to meet the requirements of URLLC, and that spatial diversity contributes to reducing the complexity of the proposed algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Communications Letters
IEEE Communications Letters 工程技术-电信学
CiteScore
8.10
自引率
7.30%
发文量
590
审稿时长
2.8 months
期刊介绍: The IEEE Communications Letters publishes short papers in a rapid publication cycle on advances in the state-of-the-art of communication over different media and channels including wire, underground, waveguide, optical fiber, and storage channels. Both theoretical contributions (including new techniques, concepts, and analyses) and practical contributions (including system experiments and prototypes, and new applications) are encouraged. This journal focuses on the physical layer and the link layer of communication systems.
×
引用
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学术官方微信