The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Sub-Channel Assignment, Power Allocation, and User Scheduling for Non-Orthogonal Multiple Access Networks
Open accessAbstract
In this paper, we study the resource allocation and user scheduling problem for a downlink non-orthogonal multiple access network where the base station allocates spectrum and power resources to a set of users. We aim to jointly optimize the sub-channel assignment and power allocation to maximize the weighted total sum-rate while taking into account user fairness. We formulate the sub-channel allocation problem as equivalent to a many-to-many two-sided user-subchannel matching game in which the set of users and sub-channels are considered as two sets of players pursuing their own interests. We then propose a matching algorithm, which converges to a two-side exchange stable matching after a limited number of iterations. A joint solution is thus provided to solve the sub-channel assignment and power allocation problems iteratively. Simulation results show that the proposed algorithm greatly outperforms the orthogonal multiple access scheme and a previous non-orthogonal multiple access scheme.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Fundamentals of Wireless Communication
Tse, D., & Viswanath, P. (2005) · doi:10.1017/cbo9780511807213 · Cited by 13,162
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
Integer and Combinatorial Optimization
Williams, H. P., Nemhauser, G. L., & Wolsey, L. A. (1990) · Journal of the Operational Research Society · doi:10.2307/2583737 · Cited by 5,485
Jain, R., Chiu, D. M., & Hawe, W. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/9809099 · Cited by 3,523
Dai, L., Wang, B., Yuan, Y., Han, S., Chih-lin, I., & Wang, Z. (2015) · IEEE Communications Magazine · doi:10.1109/mcom.2015.7263349 · Cited by 2,943
Charging and rate control for elastic traffic
Kelly, F. (1997) · European Transactions on Telecommunications · doi:10.1002/ett.4460080106 · Cited by 2,936
Introduction to the Theory of Computation
Sipser, M. (1996) · ACM SIGACT News · doi:10.1145/230514.571645 · Cited by 2,784
Non-Orthogonal Multiple Access (NOMA) for Cellular Future Radio Access
Saito, Y., Kishiyama, Y., Benjebbour, A., Nakamura, T., Li, A., & Higuchi, K. (2013) · 2013 IEEE 77th Vehicular Technology Conference (VTC Spring) · doi:10.1109/vtcspring.2013.6692652 · Cited by 2,453
On the Performance of Non-Orthogonal Multiple Access in 5G Systems with Randomly Deployed Users
Ding, Z., Yang, Z., Fan, P., & Poor, H. V. (2014) · IEEE Signal Processing Letters · doi:10.1109/lsp.2014.2343971 · Cited by 1,828
Cited by
A Survey on Non-Orthogonal Multiple Access for 5G Networks: Research Challenges and Future Trends
Ding, Z., Lei, X., Karagiannidis, G. K., Schober, R., Yuan, J., & Bhargava, V. K. (2017) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2017.2725519 · Cited by 2,392
Di, B., Zhang, H., Song, L., Li, Y., Han, Z., & Poor, H. V. (2020) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.3000813 · Cited by 544
Self-citationDynamic Task Offloading and Resource Allocation for Ultra-Reliable Low-Latency Edge Computing
Liu, C.-F., Bennis, M., Debbah, M., & Poor, H. V. (2019) · IEEE Transactions on Communications · doi:10.1109/tcomm.2019.2898573 · Cited by 435
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
Ultra-Dense LEO: Integrating Terrestrial-Satellite Networks Into 5G and Beyond for Data Offloading
Di, B., Zhang, H., Song, L., Li, Y., & Li, G. Y. (2019) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2018.2875980 · Cited by 286
Self-citation
Metadata
- Authors
- Di, B., Song, L., & Li, Y.
- Venue
- IEEE Transactions on Wireless Communications
- Published
- 2016-11
- Volume
- 15
- Issue
- 11
- Pages
- 7686-7698
- ISSN
- 1536-1276 (ISSN-L)
- OpenAlex
- W2507748565
- Cited by
- 444
- References
- 34
- FWCI
- 25.46
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Sub-Channel Assignment, Power Allocation, and User Scheduling for Non-Orthogonal Multiple Access Networks. https://app.cochat.ai/papers/10.1109/twc.2016.2606100
- The paper
- Di, B., Song, L., & Li, Y. (2016). Sub-Channel Assignment, Power Allocation, and User Scheduling for Non-Orthogonal Multiple Access Networks. IEEE Transactions on Wireless Communications. https://doi.org/10.1109/twc.2016.2606100
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.
