DQ-Based Random Access NOMA for Massive Critical IoT Scenarios in 5G Networks
Bibliographic record
Abstract
Internet-of-Things (IoT) networks provide massive connectivity for many application scenarios. Recently, much work has been dedicated to develop spectrum access strategies for IoT networks with a massive number of nodes and sporadic data traffic behavior. The case becomes more challenging in critical applications when Ultra-Reliable Low-Latency (URLL) transmissions are required. Such networks entail spectrum-efficient transmission schemes in which Non-Orthogonal Multiple-Access (NOMA) is considered a key enabler. We proposed a Distributed Queuing (DQ) approach in NOMA for critical massive IoT (mIoT) applications. More specifically, we introduce a frame structure to support DQ-based NOMA so that dynamic NOMA clustering (at the nodes) and dynamic Successive Interference Cancellation (SIC) ordering at the Base Station (BS) are supported. We also use adaptive power back-off strategy to reduce power collisions by utilizing both nodes’ and clusters’ activation index. We investigate network performance metrics, such as reliability, delay violation probability, and effective sum rate. These metrics are derived analytically, and the effect of different network parameters such as blocklength, active node arrival rate, and the number of contention subslots on the network metrics are investigated and compared with the S-ALOHA-TD benchmark.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 teacher head, 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".