Spectrum Allocation and Power Control for Non-Orthogonal Multiple Access in HetNets

In this paper, a novel resource allocation design is investigated for non-orthogonal multiple access (NOMA) enhanced heterogeneous networks (HetNets), where small cell base stations (SBSs) are capable of communicating with multiple small cell users (SCUs) via the NOMA protocol. With the aim of maxim...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on wireless communications Ročník 16; číslo 9; s. 5825 - 5837
Hlavní autori: Jingjing Zhao, Yuanwei Liu, Kok Keong Chai, Nallanathan, Arumugam, Yue Chen, Zhu Han
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: IEEE 01.09.2017
Predmet:
Fairness
heterogeneous networks (HetNets)
Interference
matching game
NOMA
non-orthogonal multiple access (NOMA)
Power control
Protocols
Resource management
sequential convex programming
Silicon carbide
sum rate
Wireless communication
ISSN:1536-1276
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, a novel resource allocation design is investigated for non-orthogonal multiple access (NOMA) enhanced heterogeneous networks (HetNets), where small cell base stations (SBSs) are capable of communicating with multiple small cell users (SCUs) via the NOMA protocol. With the aim of maximizing the sum rate of SCUs while taking the fairness issue into consideration, a joint problem of spectrum allocation and power control is formulated. In particular, the spectrum allocation problem is modeled as a many-to-one matching game with peer effects. We propose a novel algorithm where the SBSs and resource blocks interact to decide their desired allocation. The proposed algorithm is proved to converge to a two-sided exchange-stable matching. Furthermore, we introduce the concept of `exploration' into the matching game for further improving the SCUs' sum rate. The power control of each SBS is formulated as a non-convex problem, where the sequential convex programming is adopted to iteratively update the power allocation result by solving the approximate convex problem. The obtained solution is proved to satisfy the Karush-Kuhn-Tucker conditions. We unveil that: 1) the proposed algorithm closely approaches the optimal solution within a limited number of iterations; 2) the `exploration' action is capable of further enhancing the performance of the matching algorithm; and 3) the developed NOMA-enhanced HetNets achieve a higher SCUs' sum rate compared with the conventional OMA-based HetNets.
ISSN:1536-1276
DOI:10.1109/TWC.2017.2716921