Fairness of user clustering in MIMO non-orthogonal multiple access systems

Liu, Yuanwei and Elkashlan, Maged and Ding, Zhiguo and Karagiannidis, George K. (2016) Fairness of user clustering in MIMO non-orthogonal multiple access systems. IEEE Communications Letters, 20 (7). pp. 1465-1468. ISSN 1089-7798

[img]
Preview
PDF (3-pdf)
3_pdf.pdf - Accepted Version

Download (104kB)

Abstract

In this letter, a downlink multiple-input-multiple-output non-orthogonal multiple access scenario is considered. We investigate a dynamic user clustering problem from a fairness perspective. In order to solve this optimization problem, three sub-optimal algorithms, namely, top-down A, top-down B, and bottom up, are proposed to realize the different tradeoffs of complexity and throughput of the worst user. In addition, for each given user clustering case, we optimize the power allocation coefficients for the users in each cluster by adopting a bisection search-based algorithm. Numerical results show that the proposed algorithms can lower the complexity with an acceptable degradation on the throughput compared with the exhaustive search method. It is worth noting that the top-down B algorithm can achieve a good tradeoff between the complexity and the throughput among the three proposed algorithms.

Item Type:
Journal Article
Journal or Publication Title:
IEEE Communications Letters
Additional Information:
©2016 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/2200/2208
Subjects:
ID Code:
80731
Deposited By:
Deposited On:
25 Aug 2016 10:42
Refereed?:
Yes
Published?:
Published
Last Modified:
07 Apr 2020 04:03