A Reconfigurable Access Scheme for Critical mMTC Networks with Unknown Event Occurrence
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This paper presents a reconfigurable access scheme for critical massive machine-type communication (mMTC) networks with mobile devices, where in-coverage devices directly connect to the access point (AP) and out-of-coverage devices transmit to the AP by two-hop relaying. Given that devices have regular and event-based alarm traffic, we combine grantfree (GF) and grant-based transmissions to acquire unknown event information and ensure high reliability to guarantee alarm packet delay constraints. Then, the average age of information (AoI) is minimized by maximizing AoI-weighted regular packet throughput. Simulation results show that the proposed algorithm outperforms random and greedy scheduling in terms of minimizing AoI and guarantees the delay constraints in contrast to the baselines without delay consideration or only using GF transmissions to obtain event information. Also, the proposed algorithm can adaptively distribute resources to serve alarm and regular packets based on the stringency of delay constraints.
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.
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.002 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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 it