CoChat

Distributed Q-Learning Aided Uplink Grant-Free NOMA for Massive Machine-Type Communications

Liu, Jiajia, Shi, Zhenjiang, Zhang, Shangwei, Kato, Nei · 2021 · IEEE Journal on Selected Areas in Communications

The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.

Abstract

The explosive growth of machine-type communications (MTC) devices poses critical challenges to the existing cellular networks. Therefore, how to support massive MTC devices with limited resources is an urgent problem to be solved. Bursty traffic is an important characteristic of MTC devices, which makes it difficult for agents to learn useful experience and has a negative impact on model convergence. However, most existing reinforcement learning-based literatures assume that devices have saturate data. Towards this end, we propose two distributed Q-learning aided uplink grant-free non-orthogonal multiple access (NOMA) schemes (including all-devices distributed Q-learning (ADDQ) scheme and portion-devices distributed Q-learning (PDDQ) scheme) to maximize the number of accessible devices, where the bursty traffic of massive MTC devices is carefully considered. In order to reduce the dimension of scheduling space and mitigate the impact of bursty traffic, the idea of grouping devices as well as transmission resources and the intermittent learning mode are adopted in our schemes. Extensive numerical results demonstrate the advantages of proposed schemes from multiple perspectives.

Overview

Integrity signals

Registry

Crossref · 10.1109/jsac.2021.3078496

Cites

26 of 26 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 26 references

Research works printed but not linked: 1

  1. azar, 2011, Speedy Q-learning, Adv Neural Inf Process Syst, 24, 2411

Cited by

See all 58

Metadata

Authors
Liu, J., Shi, Z., Zhang, S., & Kato, N.
Affiliations
  • Northwestern Polytechnical University (CN)
  • Xidian University (CN)
  • Tohoku University (JP)
Venue
IEEE Journal on Selected Areas in Communications
Published
2021-07
Volume
39
Issue
7
Pages
2029-2041
ISSN
  • 0733-8716 (ISSN-L)
  • 1558-0008
OpenAlex
W3160612200
Cited by
53
References
25
Citations by year
2026: 5 · 2025: 3 · 2024: 8 · 2023: 14 · 2022: 18 · 2021: 5
FWCI
3.31
Type
journal article
Language
en
Open access
closed
Locations
IEEE Journal on Selected Areas in Communications (publishedVersion)
Funders
  • National Natural Science Foundation of China (61771374, 61771373, 61801360, 62001393)
  • Natural Science Basic Research Program of Shaanxi (2020JC-15, 2020JM-109)
  • Fundamental Research Funds for the Central Universities (31020200QD010)
  • Xi’an Unmanned System Security and Intelligent Communications ISTC Center
  • Special Funds for Central Universities Construction of World-Class Universities (Disciplines) and Special Development Guidance (0639021GH0201024)
Topics
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › IoT Networks and Protocols
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Wireless Communication Technologies
  • Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
Keywords
distributed Q-learning, grant-free access, non-orthogonal multiple access, uplink transmission, massive machine-type communications, bursty traffic, device grouping, resource scheduling

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: Distributed Q-Learning Aided Uplink Grant-Free NOMA for Massive Machine-Type Communications. https://app.cochat.ai/papers/10.1109/jsac.2021.3078496
The paper
Liu, J., Shi, Z., Zhang, S., & Kato, N. (2021). Distributed Q-Learning Aided Uplink Grant-Free NOMA for Massive Machine-Type Communications. IEEE Journal on Selected Areas in Communications. https://doi.org/10.1109/jsac.2021.3078496

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.