Signature-Based Nonorthogonal Massive Multiple Access for Future Wireless Networks: Uplink Massive Connectivity for Machine-Type Communications
Bibliographic record
Abstract
The problem of providing massive connectivity in the Internet of Things (IoT) with a limited number of available resources motivates nonorthogonal multiple access (NOMA) solutions. In this article, we provide a comprehensive review of the signature-based NOMA (S-NOMA) schemes as potential candidates for IoT. The signature in S-NOMA represents the way the data stream of an active device is spread over available resources in a nonorthogonal manner. It can be designed based on device-specific codebook structures, delay patterns, spreading sequences, interleaving patterns, and scrambling sequences. Additionally, we present the detection algorithms employed to decode each device's data from nonorthogonally superimposed signals at the receiver. The bit error rate (BER) of different S-NOMA schemes is simulated in impulsive noise environments, which can be important in machine-type communications (MTCs). Simulation results show that the performance of the S-NOMA schemes degrades under such conditions. Finally, research challenges in S-NOMA-oriented IoT are presented.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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".