Sub-channel Assignment, Power Allocation and User Scheduling for Non-Orthogonal Multiple Access Networks

TL;DR

This paper presents a joint sub-channel assignment and power allocation algorithm for NOMA networks that maximizes sum-rate while ensuring fairness, using a matching game approach with proven convergence.

Contribution

It introduces a novel matching-based algorithm for joint resource allocation in NOMA networks, improving performance over existing schemes.

Findings

Proposed algorithm outperforms orthogonal multiple access schemes.

The matching algorithm converges to a stable solution efficiently.

Simulation results demonstrate significant sum-rate improvements.

Abstract

In this paper, we study the resource allocation and user scheduling problem for a downlink nonorthogonal multiple access network where the base station allocates spectrum and power resources to a set of users. We aim to jointly optimize the sub-channel assignment and power allocation to maximize the weighted total sum-rate while taking into account user fairness. We formulate the sub-channel allocation problem as equivalent to a many-to-many two-sided user-subchannel matching game in which the set of users and sub-channels are considered as two sets of players pursuing their own interests. We then propose a matching algorithm which converges to a two-side exchange stable matching after a limited number of iterations. A joint solution is thus provided to solve the sub-channel assignment and power allocation problems iteratively. Simulation results show that the proposed algorithm greatly outperforms the orthogonal multiple access scheme and a previous non-orthogonal multiple access scheme.