优化多用户上行合作分频多址:基于梯度元学习的高效用户配对和资源分配

IF 8.4 2区 计算机科学 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC IEEE Transactions on Communications Pub Date : 2025-09-01 Epub Date: 2025-03-11 DOI:10.1109/TCOMM.2025.3550371
Shreya Khisa;Mohamed Elhattab;Chadi Assi;Sanaa Sharafeddine
{"title":"优化多用户上行合作分频多址:基于梯度元学习的高效用户配对和资源分配","authors":"Shreya Khisa;Mohamed Elhattab;Chadi Assi;Sanaa Sharafeddine","doi":"10.1109/TCOMM.2025.3550371","DOIUrl":null,"url":null,"abstract":"This paper investigates joint user pairing, power, and time slot duration allocation in the uplink multiple-input single-output (MISO) multi-user cooperative rate-splitting multiple access (C-RSMA) networks in half-duplex (HD) mode. We assume two types of users: cell-center users (CCU) and cell-edge users (CEU); first, we propose a user pairing scheme utilizing a semi-orthogonal user selection (SUS) and a matching-game (MG)-based approach where the SUS algorithm is used to select CCU in each pair. Afterward, the CEU in each pair is selected by considering the highest channel gain between CCU and CEU. After pairing is performed, the communication occurs in two phases: in the first phase, in a given pair, CEUs broadcast their signal, which is received by the base station (BS) and CCUs. In the second phase, in a given pair, the CCU decodes the signal from its paired CEU, superimposes its own signal, and transmits it to the BS. Moreover, utilizing uplink RSMA principle, only the CCUs split their messages into two sub-messages. Meanwhile, the messages of CEUs are kept without splitting. We formulate a joint optimization problem in order to maximize the sum rate subject to the power budget constraints of the user equipment (UE) and minimum data rate requirements at each UE. Since the formulated optimization problem is non-convex, we adopt a bi-level optimization to make the problem tractable. We decompose the original problem into two sub-problems: the user pairing sub-problem and the resource allocation sub-problem, where the user pairing sub-problem is independent of the resource allocation sub-problem, and once pairs are identified, the resource allocation sub-problem is solved for a given pair. The resource allocation sub-problem is solved by invoking a low-complexity pre-training free gradient-based meta-learning (GML) algorithm. Simulation results demonstrate that our proposed C-RSMA scheme can achieve around 100%, 51%, 53%, and 215% improvement over C-NOMA with fixed time slot allocation, RSMA, NOMA, and C-RSMA random pairing, respectively at CEU power budget of 17 dBm.","PeriodicalId":13041,"journal":{"name":"IEEE Transactions on Communications","volume":"73 9","pages":"7366-7380"},"PeriodicalIF":8.4000,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimizing Multi-User Uplink Cooperative Rate-Splitting Multiple Access: Efficient User Pairing and Resource Allocation With Gradient-Based Meta Learning\",\"authors\":\"Shreya Khisa;Mohamed Elhattab;Chadi Assi;Sanaa Sharafeddine\",\"doi\":\"10.1109/TCOMM.2025.3550371\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper investigates joint user pairing, power, and time slot duration allocation in the uplink multiple-input single-output (MISO) multi-user cooperative rate-splitting multiple access (C-RSMA) networks in half-duplex (HD) mode. We assume two types of users: cell-center users (CCU) and cell-edge users (CEU); first, we propose a user pairing scheme utilizing a semi-orthogonal user selection (SUS) and a matching-game (MG)-based approach where the SUS algorithm is used to select CCU in each pair. Afterward, the CEU in each pair is selected by considering the highest channel gain between CCU and CEU. After pairing is performed, the communication occurs in two phases: in the first phase, in a given pair, CEUs broadcast their signal, which is received by the base station (BS) and CCUs. In the second phase, in a given pair, the CCU decodes the signal from its paired CEU, superimposes its own signal, and transmits it to the BS. Moreover, utilizing uplink RSMA principle, only the CCUs split their messages into two sub-messages. Meanwhile, the messages of CEUs are kept without splitting. We formulate a joint optimization problem in order to maximize the sum rate subject to the power budget constraints of the user equipment (UE) and minimum data rate requirements at each UE. Since the formulated optimization problem is non-convex, we adopt a bi-level optimization to make the problem tractable. We decompose the original problem into two sub-problems: the user pairing sub-problem and the resource allocation sub-problem, where the user pairing sub-problem is independent of the resource allocation sub-problem, and once pairs are identified, the resource allocation sub-problem is solved for a given pair. The resource allocation sub-problem is solved by invoking a low-complexity pre-training free gradient-based meta-learning (GML) algorithm. Simulation results demonstrate that our proposed C-RSMA scheme can achieve around 100%, 51%, 53%, and 215% improvement over C-NOMA with fixed time slot allocation, RSMA, NOMA, and C-RSMA random pairing, respectively at CEU power budget of 17 dBm.\",\"PeriodicalId\":13041,\"journal\":{\"name\":\"IEEE Transactions on Communications\",\"volume\":\"73 9\",\"pages\":\"7366-7380\"},\"PeriodicalIF\":8.4000,\"publicationDate\":\"2025-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Communications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10922765/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2025/3/11 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Communications","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10922765/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/3/11 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了半双工(HD)模式下上行多输入单输出(MISO)多用户合作分频多址(C-RSMA)网络中的联合用户配对、功率和时隙持续时间分配。我们假设两种类型的用户:蜂窝中心用户(CCU)和蜂窝边缘用户(CEU);首先,我们提出了一种利用半正交用户选择(SUS)和基于匹配博弈(MG)的方法的用户配对方案,其中使用SUS算法在每对中选择CCU。然后,根据CCU和CEU之间的最高通道增益来选择每对中的CEU。配对完成后,通信分为两个阶段:第一阶段,在给定的一对中,ceu广播其信号,由基站(BS)和ccu接收。在第二阶段,在给定的一对中,CCU解码来自配对的CEU的信号,叠加自己的信号,并将其传输到BS。此外,利用上行链路RSMA原理,只有ccu将其消息分成两个子消息。同时,ceu的消息保持不分裂。为了在用户设备(UE)的功率预算约束和每个UE的最小数据速率要求下最大化总速率,我们制定了一个联合优化问题。由于所提出的优化问题是非凸的,我们采用了双层优化,使问题易于处理。我们将原问题分解为用户配对子问题和资源分配子问题两个子问题,其中用户配对子问题独立于资源分配子问题,一旦识别出对,就求解给定对的资源分配子问题。资源分配子问题通过调用低复杂度的预训练免费梯度元学习(GML)算法来解决。仿真结果表明,在CEU功率预算为17 dBm时,采用固定时隙分配、RSMA、NOMA和C-RSMA随机配对的C-NOMA方案比C-NOMA方案分别提高了100%、51%、53%和215%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimizing Multi-User Uplink Cooperative Rate-Splitting Multiple Access: Efficient User Pairing and Resource Allocation With Gradient-Based Meta Learning
This paper investigates joint user pairing, power, and time slot duration allocation in the uplink multiple-input single-output (MISO) multi-user cooperative rate-splitting multiple access (C-RSMA) networks in half-duplex (HD) mode. We assume two types of users: cell-center users (CCU) and cell-edge users (CEU); first, we propose a user pairing scheme utilizing a semi-orthogonal user selection (SUS) and a matching-game (MG)-based approach where the SUS algorithm is used to select CCU in each pair. Afterward, the CEU in each pair is selected by considering the highest channel gain between CCU and CEU. After pairing is performed, the communication occurs in two phases: in the first phase, in a given pair, CEUs broadcast their signal, which is received by the base station (BS) and CCUs. In the second phase, in a given pair, the CCU decodes the signal from its paired CEU, superimposes its own signal, and transmits it to the BS. Moreover, utilizing uplink RSMA principle, only the CCUs split their messages into two sub-messages. Meanwhile, the messages of CEUs are kept without splitting. We formulate a joint optimization problem in order to maximize the sum rate subject to the power budget constraints of the user equipment (UE) and minimum data rate requirements at each UE. Since the formulated optimization problem is non-convex, we adopt a bi-level optimization to make the problem tractable. We decompose the original problem into two sub-problems: the user pairing sub-problem and the resource allocation sub-problem, where the user pairing sub-problem is independent of the resource allocation sub-problem, and once pairs are identified, the resource allocation sub-problem is solved for a given pair. The resource allocation sub-problem is solved by invoking a low-complexity pre-training free gradient-based meta-learning (GML) algorithm. Simulation results demonstrate that our proposed C-RSMA scheme can achieve around 100%, 51%, 53%, and 215% improvement over C-NOMA with fixed time slot allocation, RSMA, NOMA, and C-RSMA random pairing, respectively at CEU power budget of 17 dBm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Communications
IEEE Transactions on Communications 工程技术-电信学
CiteScore
16.10
自引率
8.40%
发文量
528
审稿时长
4.1 months
期刊介绍: The IEEE Transactions on Communications is dedicated to publishing high-quality manuscripts that showcase advancements in the state-of-the-art of telecommunications. Our scope encompasses all aspects of telecommunications, including telephone, telegraphy, facsimile, and television, facilitated by electromagnetic propagation methods such as radio, wire, aerial, underground, coaxial, and submarine cables, as well as waveguides, communication satellites, and lasers. We cover telecommunications in various settings, including marine, aeronautical, space, and fixed station services, addressing topics such as repeaters, radio relaying, signal storage, regeneration, error detection and correction, multiplexing, carrier techniques, communication switching systems, data communications, and communication theory. Join us in advancing the field of telecommunications through groundbreaking research and innovation.
期刊最新文献
Joint Optimization Design for Fluid Antenna Empowered RIS-Aided Symbiotic Radio Systems Constructing Angular-Domain CKM via Subregion-based Interpolation and Sequential Sampling Optimization Scalable GNN-Based Power Allocation for Rate-Splitting Cell-Free Massive MIMO Systems RIS-Enabled Symbiotic Modulation: An S-UFCP Approach ORBGRAND Is Exactly Capacity-achieving via Rank Companding
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1