The DOI matches its Crossref record.
Fairness of User Clustering in MIMO Non-Orthogonal Multiple Access Systems
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Nonorthogonal Multiple Access for 5G and Beyond
Liu, Y., Qin, Z., Elkashlan, M., Ding, Z., Nallanathan, A., & Hanzo, L. (2017) · Proceedings of the IEEE · doi:10.1109/jproc.2017.2768666 · Cited by 1,369
Self-citationA Survey of Non-Orthogonal Multiple Access for 5G
Dai, L., Wang, B., Ding, Z., Wang, Z., Chen, S., & Hanzo, L. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2835558 · Cited by 1,327
Self-citationMassive Access for 5G and Beyond
Chen, X., Ng, D. W. K., Yu, W., Larsson, E. G., Al-Dhahir, N., & Schober, R. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.3019724 · Cited by 681
“A possible solution to overcome these challenges is to perform device clustering [135], [136].”
BackgroundEnhancing the Physical Layer Security of Non-Orthogonal Multiple Access in Large-Scale Networks
Liu, Y., Qin, Z., Elkashlan, M., Gao, Y., & Hanzo, L. (2017) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2017.2650987 · Cited by 613
Self-citationEvolution of NOMA Toward Next Generation Multiple Access (NGMA) for 6G
Liu, Y., Zhang, S., Mu, X., Ding, Z., Schober, R., Al-Dhahir, N., Hossain, E., & Shen, X. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2022.3145234 · Cited by 595
Self-citationModulation and Multiple Access for 5G Networks
Cai, Y., Qin, Z., Cui, F., Li, G. Y., & McCann, J. A. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2766698 · Cited by 516
Exploiting Intelligent Reflecting Surfaces in NOMA Networks: Joint Beamforming Optimization
Mu, X., Liu, Y., Guo, L., Lin, J., & Al-Dhahir, N. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.3006915 · Cited by 408
Self-citationA Survey of Rate-Optimal Power Domain NOMA With Enabling Technologies of Future Wireless Networks
Maraqa, O., Rajasekaran, A. S., Al-Ahmadi, S., Yanikomeroglu, H., & Sait, S. M. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.3013514 · Cited by 406
Resource Allocation in Intelligent Reflecting Surface Assisted NOMA Systems
Zuo, J., Liu, Y., Qin, Z., & Al-Dhahir, N. (2020) · IEEE Transactions on Communications · doi:10.1109/tcomm.2020.3016742 · Cited by 259
Self-citation
Metadata
- Authors
- Liu, Y., Elkashlan, M., Ding, Z., & Karagiannidis, G. K.
- Venue
- IEEE Communications Letters
- Published
- 2016
- Pages
- 1-1
- ISSN
- 1089-7798 (ISSN-L)
- OpenAlex
- W2342651886
- Cited by
- 194
- References
- 0
- FWCI
- 15.70
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.