An Overview of Uplink Access Techniques in Machine-Type Communications
Bibliographic record
Abstract
The bright future of smart cities relies on an effective deployment of IoT technologies. Machine-type communications (MTC) is a major backbone technology that supports connectivity for the Internet of things (IoT). Cellular networks are known to be cost-effective, with ubiquitous coverage that ease the deployment of MTC. However, cellular networks were originally designed for human-centric services with high-cost devices and ever-increasing rate requirements. In contrast, MTC services need to support low-cost, low-energy, massive number of devices. This poses a number of challenges toward the adaptation of current cellular networks to accommodate MTC. This article gives an overview of the conventional random access (RA) scheme of cellular networks and its variants in the literature. However, without discounting the efforts of optimizing the RA scheme, we show that due to the increased collisions and prohibitive overhead, it falls short to support MTC with reduced latency and guaranteed reliability. Alternatively, we discuss different uplink access techniques that are found promising in tackling massive connectivity while avoiding the shortcomings of the conventional RA. Moreover, we discuss how to utilize different future 5G and beyond technologies to efficiently handle massive MTC while pointing out the promising role of machine learning techniques.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.003 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.005 | 0.003 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".