A Novel Analytical Framework for Massive Grant-Free NOMA
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
In this paper, we consider a massive grant-free non-orthogonal multiple access (GF-NOMA) scheme, where devices have strict latency requirements and no retransmission opportunities are available. Each device chooses a pilot sequence from a predetermined set as its signature and transmits its selected pilot and data simultaneously. A collision occurs when two or more devices choose the same pilot sequence. Existing GF-NOMA schemes assume that a collision of at least one pair of users entails a collision for all simultaneously transmitting users, which is sub-optimal in terms of individual outage and system throughput. For that, we propose a novel framework, where collisions are treated as interference to the remaining received signals. With the aid of Poisson point processes and ordered statistics, we derive simplified expressions that can well approximate the outage probability and throughput of the system for both successive joint decoding (SJD) and successive interference cancellation (SIC). Numerical results verify the accuracy of our analytical expressions. For low data rate transmissions, results show that the performance of SIC is close to that of SJD in terms of outage probability, for packet arrival rates up to 10 packets per slot. However, SJD can achieve almost double the throughput of SIC and is, thus, far more superior.
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
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
Cited by
Cellular, Wide-Area, and Non-Terrestrial IoT: A Survey on 5G Advances and the Road Toward 6G
Vaezi, M., Azari, A., Khosravirad, S. R., Shirvanimoghaddam, M., Azari, M. M., Chasaki, D., & Popovski, P. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3151028 · Cited by 631
Self-citationGrant-Free Non-Orthogonal Multiple Access for IoT: A Survey
Shahab, M. B., Abbas, R., Shirvanimoghaddam, M., & Johnson, S. J. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2996032 · Cited by 453
Self-citationAnalyzing Grant-Free Access for URLLC Service
Liu, Y., Deng, Y., Elkashlan, M., Nallanathan, A., & Karagiannidis, G. K. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.3018822 · Cited by 174
Toward immersive communications in 6G
Shen, X. (., Gao, J., Li, M., Zhou, C., Hu, S., He, M., & Zhuang, W. (2023) · Frontiers in Computer Science · doi:10.3389/fcomp.2022.1068478 · Cited by 124
Distributed Q-Learning Aided Uplink Grant-Free NOMA for Massive Machine-Type Communications
Liu, J., Shi, Z., Zhang, S., & Kato, N. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3078496 · Cited by 53
“Similar to the existing literatures [9]–[11], [14], [20], we ignore the possibility that some signals in collision can be decoded successfully due to capture effects [9], [22].”
Result
Metadata
- Authors
- Abbas, R., Shirvanimoghaddam, M., Li, Y., & Vucetic, B.
- Venue
- IEEE Transactions on Communications
- Published
- 2019-03
- Volume
- 67
- Issue
- 3
- Pages
- 2436-2449
- ISSN
- 0090-6778 (ISSN-L)
- 1558-0857
- OpenAlex
- W2900584518
- Cited by
- 126
- References
- 1
- FWCI
- 5.93
- 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
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.