Connectivity Performance Evaluation for Grant-Free Narrowband IoT With Widely Linear Receivers
Bibliographic record
Abstract
Future wireless cellular communication networks are expected to provide connectivity for massive machine-type communication (mMTC) devices. The main challenge of supporting mMTC traffic for a cellular network lies in the high density of these devices, which individually have relatively little data to transmit. This suggests the use of low overhead, grant-free access scheme for uplink data transmission, which, however, suffers from packet collisions when devices attempt to access the channel. In this article, we suggest the use of real-valued transmission together with widely linear (WL) reception for improving resource access and thus data throughput in the uplink of mMTC traffic scenarios. We show that not surprisingly, the WL scheme can virtually double the number of receive antennas at the base station (BS). We analyze the effect of this on the supported user density and data throughput for grant-free uplink transmission. As a specific example, we consider the narrowband Internet-of-Things (NB-IoT) cellular communication system, which already includes real-valued modulation modes. Our numerical results show that the supported user density and data throughput of grant-free NB-IoT systems can be significantly improved due to the use of WL receivers. For example, considering an NB-IoT system with 1% packet drop probability, we obtain a tenfold (for single-antenna BS) and a sixfold (for dual-antenna BS) increase in the supported user density by using WL receivers instead of their conventional linear counterparts.
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.004 |
| 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.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".