User association and channel assignment in downlink multi-cell NOMA networks: A matching-theoretic approach

Abstract

Abstract This paper studies the problem of stable user association and channel assignment in downlink multi-cell non-orthogonal multiple-access (NOMA) networks. To be specific, the goal is to assign network users to the channels at each base station, while accounting for inter-user interference and maintaining quality of service (QoS) per user. To that end, a low-complexity iterative solution procedure is devised to obtain the optimal power allocation for proportional fairness signal-to-interference-plus-noise ratio (SINR)-based maximization, which is then utilized to determine the preferences of network users over the channels available at each base station and the preferences of base stations over the network users. In turn, a many-to-one matching-theoretic model based on the student-project allocation problem is applied. Particularly, two polynomial-time complexity stable matching algorithms are proposed to associate users with base stations and perform channel assignment, such that no user or base station would deviate and change its association or channel assignment unilaterally. To validate the efficacy of the proposed solution procedure and stable matching algorithms, extensive simulation results are presented to compare them to a centralized joint user association, channel assignment, and power allocation (C-J-UA-CA-PA) scheme. It is demonstrated that the proposed algorithms efficiently associate users with base stations and assign them to channels as well as efficiently yielding comparable SINR per user to the C-J-UA-CA-PA scheme, while maximizing proportional fairness and satisfying QoS constraints.

Keywords

• Channel assignment
• Matching
• Multi-cell
• Non-orthogonal multiple access
• Proportional fairness
• User association