arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2101.07641cs.ITcs.SYeess.SYmath.IT
收藏

URLLC中基于NOMA的协作用户配对:一种最大最小公平性方法

Cooperative NOMA-Based User Pairing for URLLC: A Max-Min Fairness Approach

Fateme Salehi, Naaser Neda, Mohammad-Hassan Majidi, Hamed Ahmadi

摘要:

研究了有限块长(FBL)码短分组通信中的协作非正交多址(C-NOMA)问题。在接收机侧的解码和转发(DF)中继以及选择合并(SC)和最大比合并(MRC)策略的性能进行了检查。我们探讨联合用户配对和资源分配,以最大限度地提高公平的吞吐量在下行链路(DL)的情况。在每一对中,具有较强信道的用户(强用户)充当另一个用户(弱用户)的中继,并且分配最佳功率和块长度以实现最大-最小吞吐量。为此,首先,仅考虑一对,并探索最优资源分配。此外,一个次优算法的建议,它收敛到一个接近最优的解决方案。最后,该问题被扩展到一个一般的场景,并提出了一个次优的C-NOMA的用户配对。数值结果表明,提出的C-NOMA方案在SC和MRC策略显着提高用户的公平吞吐量相比,NOMA和OMA。它也被调查,建议的配对方案的基础上C-NOMA优于混合NOMA/OMA方案的平均吞吐量的角度来看,而公平性指标略有下降。

英文摘要:

In this paper, cooperative non-orthogonal multiple access (C-NOMA) is considered in short packet communications with finite blocklength (FBL) codes. The performance of a decode-and-forward (DF) relaying along with selection combining (SC) and maximum ratio combining (MRC) strategies at the receiver side is examined. We explore joint user pairing and resource allocation to maximize fair throughput in a downlink (DL) scenario. In each pair, the user with a stronger channel (strong user) acts as a relay for the other one (weak user), and optimal power and blocklength are allocated to achieve max-min throughput. To this end, first, only one pair is considered, and optimal resource allocation is explored. Also, a suboptimal algorithm is suggested, which converges to a near-optimal solution. Finally, the problem is extended to a general scenario, and a suboptimal C-NOMA-based user pairing is proposed. Numerical results show that the proposed C-NOMA scheme in both SC and MRC strategies significantly improves the users' fair throughput compared to the NOMA and OMA. It is also investigated that the proposed pairing scheme based on C-NOMA outperforms the Hybrid NOMA/OMA scheme from the average throughput perspective, while the fairness index degrades slightly.

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

↑