Coordinated Device-to-Device Communication With Non-Orthogonal Multiple Access in Future Wireless Cellular Networks

We study the problem of user clustering and power assignment for a network comprised of cellular users and underlay device-to-device (D2D) users operating under a non-orthogonal multiple access (NOMA) scheme. Our goal is to maximize the sum-rate of the network by jointly optimizing the user clusteri...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access 2018-01, Vol.6, p.39860-39875
Main Authors: Kazmi, S. M. Ahsan, Tran, Nguyen H., Tai Manh Ho, Manzoor, Aunas, Niyato, Dusit, Choong Seon Hong
Format: Article
Language:English
Subjects:
Cellular communication
Cellular networks
Clustering
Device-to-device (D2D) communication
Device-to-device communication
Frequency division multiple access
Games
Interference
Iterative algorithms
Matching
matching theory
Mathematical programming
Mixed integer
NOMA
non-orthogonal multiple access (NOMA)
Nonorthogonal multiple access
Optimization
power assignment
Receivers
Resource management
user clustering
Wireless networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study the problem of user clustering and power assignment for a network comprised of cellular users and underlay device-to-device (D2D) users operating under a non-orthogonal multiple access (NOMA) scheme. Our goal is to maximize the sum-rate of the network by jointly optimizing the user clustering and power assignment. Moreover, we also aim to provide interference protection for the cellular users. The formulated optimization problem is a mixed-integer non-convex problem. Thus, the original problem is decomposed into two subproblems. The first subproblem of user clustering is formulated as a matching game with externalities, where this matching game is solved sequentially while the second subproblem pertaining to power assignment is solved using complementary Geometric programming. Finally, an efficient joint iterative algorithm is proposed that can achieve a suboptimal solution for the mix integer non-convex NP-hard problem. Simulation results show that the proposed algorithm can achieve up to 70% and 92% of performance gains in terms of the average sum-rate in comparison with the general NOMA and traditional orthogonal frequency-division multiple access (OFDMA) schemes, respectively. Moreover, our results show that the proposed scheme significantly enhances the network connectivity in terms of the number of admitted users compared with the traditional OFDMA, NOMA, and D2D schemes.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2018.2850924