The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Optimal Power Allocation and Scheduling for Non-Orthogonal Multiple Access Relay-Assisted Networks
Abstract
The emerging non-orthogonal multiple access (NOMA), which enables mobile users (MUs) to share same frequency channel simultaneously, has been considered as a spectrum-efficient multiple access scheme to accommodate tremendous traffic growth in future cellular networks. In this paper, we investigate the NOMA downlink relay-transmission, in which the macro base station (BS) first uses NOMA to transmit to a group of relays, and all relays then use NOMA to transmit their respectively received data to an MU. In specific, we propose an optimal power allocation problem for the BS and relays to maximize the overall throughput delivered to the MU. Despite the non-convexity of the problem, we adopt the vertical decomposition and propose a layered-algorithm to efficiently compute the optimal power allocation solution. Numerical results show that the proposed NOMA relay-transmission can increase the throughput up to 30 percent compared with the conventional time division multiple access (TDMA) scheme, and we find that increasing the relays' power capacity can increase the throughput gain of the NOMA relay against the TDMA relay. Furthermore, to improve the throughput under weak channel power gains, we propose a hybrid NOMA (HB-NOMA) relay that adaptively exploits the benefit of NOMA relay and that of the interference-free TDMA relay. By using the throughput provided by the HB-NOMA relay for each individual MU, we study the multi-MUs scenario and investigate the multi-MUs scheduling problem over a long-term period to maximize the overall utility of all MUs. Numerical results demonstrate the performance advantage of the proposed multi-MUs scheduling that adopts the HB-NOMA relay-transmission.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
Power-Domain Non-Orthogonal Multiple Access (NOMA) in 5G Systems: Potentials and Challenges
Islam, S. M. R., Avazov, N., Dobre, O. A., & Kwak, K.-S. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2621116 · Cited by 2,458
V2X Meets NOMA: Non-Orthogonal Multiple Access for 5G-Enabled Vehicular Networks
Di, B., Song, L., Li, Y., & Han, Z. (2017) · IEEE Wireless Communications · doi:10.1109/mwc.2017.1600414 · Cited by 186
Cited by
Evolution 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-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
A Secure Charging Scheme for Electric Vehicles With Smart Communities in Energy Blockchain
Su, Z., Wang, Y., Xu, Q., Fei, M., Tian, Y.-C., & Zhang, N. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2869297 · Cited by 380
Joint Trajectory and Precoding Optimization for UAV-Assisted NOMA Networks
Zhao, N., Pang, X., Li, Z., Chen, Y., Li, F., Ding, Z., & Alouini, M.-S. (2019) · IEEE Transactions on Communications · doi:10.1109/tcomm.2019.2895831 · Cited by 323
Wu, Y., Ni, K., Zhang, C., Qian, L. P., & Tsang, D. H. K. (2018) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2018.2875337 · Cited by 292
Self-citation
Metadata
- Authors
- Wu, Y., Qian, L. P., Mao, H., Yang, X., Zhou, H., & Shen, X.
- Venue
- IEEE Transactions on Mobile Computing
- Published
- 2018-11-01
- Volume
- 17
- Issue
- 11
- Pages
- 2591-2606
- ISSN
- 1536-1233 (ISSN-L)
- 1558-0660
- 2161-9875
- OpenAlex
- W2789414605
- Cited by
- 161
- References
- 2
- FWCI
- 9.22
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Optimal Power Allocation and Scheduling for Non-Orthogonal Multiple Access Relay-Assisted Networks. https://app.cochat.ai/papers/10.1109/tmc.2018.2812722
- The paper
- Wu, Y., Qian, L. P., Mao, H., Yang, X., Zhou, H., & Shen, X. (2018). Optimal Power Allocation and Scheduling for Non-Orthogonal Multiple Access Relay-Assisted Networks. IEEE Transactions on Mobile Computing. https://doi.org/10.1109/tmc.2018.2812722
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.