Resource allocation for non-orthogonal multiple access in heterogeneous networks

Abstract

In this paper, novel resource allocation design is investigated for NOMA-enhanced heterogeneous networks (Het-Nets), where small cell base stations (SBSs) are enabled to communicate with multiple small cell users (SCUs) via the NOMA protocol. The resource allocation problem with the aim of maximizing the sum rate of SCUs is formulated as a many-to-one matching game. Due to the existence of co-channel interference, this game is shown to belong to a class of matching games with peer effects. To solve this game, we propose a novel distributed algorithm where the SBSs and resource blocks (RBs) can interact to decide their desired allocation. The proposed algorithm is proved to converge to a two-sided exchange-stable matching with much lower complexity compared to the centralized method. Simulation results unveil that: 1) The proposed algorithm closely approaches the global optimal solution by around 92.5% within a limited number of iterations; and 2) The developed NOMA-enhanced HetNets scheme achieves a higher sum rate of SCUs compared to the traditional OMA-based HetNets scheme.