Radio Resource Allocation For Downlink Non-Orthogonal Multiple Access (Noma) Networks Using Matching Theory

In this paper, we study the resource allocation and scheduling problem for a downlink non-orthogonal multiple access (NOMA) network where the base station (BS) allocates the spectrum resources and power to the set of users. We aim to optimize the sub-channel assignment and power allocation to achieve a balance between the number of scheduled users and total sum-rate maximization. To solve the above problem, we propose a many-to-many two-sided user-subchannel matching algorithm in which the set of users and sub-channels are considered as two sets of players pursuing their own interests. The algorithm converges to a pair-wise stable matching after a limited number of iterations. Simulation results show that the proposed algorithm can approach the performance of the upper bound and greatly outperforms the OFDMA scheme.