Resource Allocation for the Uplink of a Multi-User Massive MIMO System

IF 9.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Mobile Computing Pub Date : 2024-12-26 DOI:10.1109/TMC.2024.3522207
Haseen Rahman;Catherine Rosenberg
{"title":"Resource Allocation for the Uplink of a Multi-User Massive MIMO System","authors":"Haseen Rahman;Catherine Rosenberg","doi":"10.1109/TMC.2024.3522207","DOIUrl":null,"url":null,"abstract":"We study the uplink resource management of a multi-user multiple-input-multiple-output single cell for Zero-Forcing receive combining transmission. We consider jointly power allocation, user selection and modulation and coding scheme selection over multiple subchannels. Our contributions are twofold: we first propose a quasi-optimal offline algorithm that provides a target performance and then design and validate an efficient online proportional fair algorithm that performs the above steps. Due to user power constraints, the offline optimization is conducted jointly for all subchannels within a time slot, a computationally intensive task, prompting the proposal of a greedy offline algorithm that we validate in two ways: 1) for a small number of users, by solving the general problem to quasi-optimality and 2) for a larger number of users, by solving again to quasi-optimality a transformed version of the general problem when the channels are assumed flat. From the offline study, we find that, given the right user selection, equal power allocation can be employed without much degradation in performance. We also see that the number of channels allocated to users varies widely depending upon their channel gains. Using these insights, we propose our efficient real-time online algorithm that has runtime competitiveness with a state-of-the-art benchmark.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 5","pages":"4326-4338"},"PeriodicalIF":9.2000,"publicationDate":"2024-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Mobile Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10815102/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

We study the uplink resource management of a multi-user multiple-input-multiple-output single cell for Zero-Forcing receive combining transmission. We consider jointly power allocation, user selection and modulation and coding scheme selection over multiple subchannels. Our contributions are twofold: we first propose a quasi-optimal offline algorithm that provides a target performance and then design and validate an efficient online proportional fair algorithm that performs the above steps. Due to user power constraints, the offline optimization is conducted jointly for all subchannels within a time slot, a computationally intensive task, prompting the proposal of a greedy offline algorithm that we validate in two ways: 1) for a small number of users, by solving the general problem to quasi-optimality and 2) for a larger number of users, by solving again to quasi-optimality a transformed version of the general problem when the channels are assumed flat. From the offline study, we find that, given the right user selection, equal power allocation can be employed without much degradation in performance. We also see that the number of channels allocated to users varies widely depending upon their channel gains. Using these insights, we propose our efficient real-time online algorithm that has runtime competitiveness with a state-of-the-art benchmark.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多用户大规模MIMO系统上行链路的资源分配
研究了零强迫接收组合传输中多用户多输入多输出单小区的上行链路资源管理。我们综合考虑了多个子信道上的功率分配、用户选择和调制和编码方案的选择。我们的贡献是双重的:我们首先提出了一个提供目标性能的准最优离线算法,然后设计并验证了一个执行上述步骤的高效在线比例公平算法。由于用户权力约束,进行离线优化联合为一个时间段内的所有子信道,计算密集型任务,促使贪婪的离线算法的提议,我们验证在两个方面:1)对于少量的用户来说,通过求解一般问题quasi-optimality和2)更大数量的用户,再通过求解quasi-optimality转换版本的一般性问题当通道被假定平的。从离线的研究中,我们发现,在正确的用户选择下,可以采用相等的功率分配,而不会对性能造成太大的影响。我们还看到,分配给用户的频道数量因其频道增益而有很大差异。利用这些见解,我们提出了高效的实时在线算法,该算法具有与最先进基准的运行时竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Mobile Computing
IEEE Transactions on Mobile Computing 工程技术-电信学
CiteScore
12.90
自引率
2.50%
发文量
403
审稿时长
6.6 months
期刊介绍: IEEE Transactions on Mobile Computing addresses key technical issues related to various aspects of mobile computing. This includes (a) architectures, (b) support services, (c) algorithm/protocol design and analysis, (d) mobile environments, (e) mobile communication systems, (f) applications, and (g) emerging technologies. Topics of interest span a wide range, covering aspects like mobile networks and hosts, mobility management, multimedia, operating system support, power management, online and mobile environments, security, scalability, reliability, and emerging technologies such as wearable computers, body area networks, and wireless sensor networks. The journal serves as a comprehensive platform for advancements in mobile computing research.
期刊最新文献
Correction to “PrivGuardInfer: Channel-Level End-Edge Collaborative Inference Strategy Protecting Original Inputs and Sensitive Attributes” 2025 Reviewers List* Fall Risk Prediction Method Based on Human Electrostatic Field and Stacking Ensemble Learning Algorithm EdgeBatch: Efficient Decentralized Batch Verification for Edge Data Integrity via Reputation-Aware Combination Selection AdaDT: Adaptive Service Provision and Digital Twin Migration for ISAC-Assisted Edge Intelligence
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1