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

In this article, cooperative nonorthogonal multiple access (C-NOMA) is considered in short packet communications with finite blocklength codes. The performance of a decode-and-forward 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 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 orthogonal multiple access (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.

Automated summary

This article investigates the application of C-NOMA in short packet communications by maximizing fair throughput through joint user pairing and resource allocation. The study finds that the C-NOMA scheme significantly improves users' throughput in both SC and MRC strategies.