Uniqueness-Based Resource Allocation for M2M Communications in Narrowband IoT Networks
Bibliographic record
Abstract
Machine-type Communications (MTC) are expected to dominate cellular networks traffic by the end of this decade.This makes the radio resource allocation, i.e. scheduling, on these networks, a challenging task. The limited radio resources may not be sufficient for the data transmissions of all the MTC devices (MTCDs) especially in case of massive M2M deployments. Hence, it is essential to allocate radio resources to the MTCDs that send non-redundant or unique data since they are considered to have higher importance. In this paper, we introduce a novel Machine-to-Machine (M2M) resource allocation metric that we term the statistical priority. Statistical priority evaluates the importance of data sent by MTCDs. The importance of a data unit is quantified based on some statistical functions such as, comparison with upper and lower thresholds, difference with earlier data units, and detecting an increasing or decreasing trend when combined with previous data units for prioritizing the allocation of the scarce radio resources to MTCDs sending unique data. Performance evaluation shows that our proposed metric helps achieve effective resource utilization by letting MTCDs send a reduced set of their data that constitute the most important data units that can fully represent the full set of data units.
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.002 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| 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".