Network Sum-Rate Maximization for Network-Coded Uplink Clustered NOMA Relay Networks

In this paper, network sum-rate maximization (NSR-MAX) for network-coded uplink clustered non-orthogonal multiple-Access (NOMA) relay networks is considered. In particular, the goal is to maximize network sum-rate via optimal power allocation, where the user clusters communicate with the base-station over an amplify-And-forward relay, subject to quality-of-service (QoS) constraints. Two NOMA transmission models are proposed, where in the first model, network-coding (NC) is applied at the relay only, while the second model applies NC for user clusters' transmissions and at the relay to minimize the transmission delay. The formulated NSR-MAX problem happens to be non-convex, and hence, is computationally-intensive. Thus, a low-complexity iterative two-layer algorithm (ITLA) is devised, which decouples the formulated problem and efficiently solves its over two-layers. Specifically, the inner-layer solves the NSR-MAX problem to obtain the optimal relay transmit power, while the outer-layer determines the optimal users' transmit powers. Numerical results are presented, which illustrate that the proposed ITLA yields near-optimal solutions for all transmission models, in comparison to the formulated NSR-MAX problem (solved via global optimization package) as well as outperforming its OMA-based counterparts.