arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.02276eess.SP
收藏

优化多用户上行协作速率分割多址接入:高效用户配对与资源分配

Optimizing Multi-User Uplink Cooperative Rate-Splitting Multiple Access: Efficient User Pairing and Resource Allocation

Shreya Khisa, Mohamad Elhattab, Chadi Assi, Sanaa Sharafeddine

AI总结:

本文针对上行多用户协作速率分割多址接入网络,提出基于半正交用户选择和匹配博弈的用户配对方案,并结合逐次凸逼近进行功率与时隙资源分配,以最大化总速率。

摘要:

本文研究了半双工(HD)模式下上行多输入单输出(MISO)多用户协作速率分割多址接入(C-RSMA)网络中的联合用户配对、功率和时隙时长分配问题。我们假设存在两类用户:小区中心用户(CCU)和小区边缘用户(CEU);首先,我们提出了一种利用半正交用户选择(SUS)和基于匹配博弈(MG)方法的用户配对方案,其中SUS算法用于选择每对中的CCU,有助于减少对间干扰(IPI)。随后,通过考虑CCU与CEU之间的最高信道增益来选择每对中的CEU。配对完成后,通信分两个阶段进行:在第一阶段,给定配对中,CEU广播其信号,该信号被基站(BS)和CCU接收。在第二阶段,给定配对中,CCU解码来自其配对CEU的信号,叠加自身信号,并将其发送给BS。我们构建了一个联合优化问题,以在用户设备(UE)功率预算和每个UE的服务质量(QoS)要求约束下最大化总速率。由于所构建的优化问题是非凸的,我们采用双层优化使问题可处理。我们将原始问题分解为两个子问题:用户配对子问题和资源分配子问题,其中用户配对子问题独立于资源分配子问题,一旦配对确定,就针对给定配对求解资源分配子问题。资源分配子问题通过调用基于逐次凸逼近(SCA)的方法来求解。仿真结果表明,所提出的基于SUS-MG的算法结合SCA优于其他传统方案。

英文摘要:

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 which assists in reducing inter-pair interference (IPI). Afterward, the CEU in each pair is selected by considering the highest channel gain between CCU and CEU. After pairing is performed, the communication takes place 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. We formulate a joint optimization problem in order to maximize the sum rate subject to the constraints of the power budget of the user equipment (UE) and Quality of Service (QoS) 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 user pairing sub-problem is independent of resource allocation sub-problem and once pairs are identified, resource allocation sub-problem is solved for a given pair. Resource allocation sub-problem is solved by invoking a successive convex approximation (SCA)-based approach. Simulation results demonstrate that the proposed SUS-MG-based algorithm with SCA outperforms other conventional schemes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑