A Statistical Priority-Based Scheduling Metric for M2M Communications in LTE Networks
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
Resource allocation, or scheduling, is one of the main challenges that face supporting machine-to-machine (M2M) communications on long term evolution networks. M2M traffic has unique characteristics. It generally consists of a large number of small data packets, with specific deadlines, generated by a potentially massive number of devices contending over the scarce radio resources. In this paper, we introduce a novel M2M scheduling metric that we term the “statistical priority”. Statistical priority is a term that indicates the uniqueness of the information carried by certain data packets sent by machine-type communications devices (MTCDs). If an MTCD data unit is significantly dissimilar to the previously sent data, it is considered to carry non-redundant information. Consequently, it would be assigned higher statistical priority, and this MTCD should then be given higher priority in the scheduling process. Using this proposed metric in scheduling, the scarce radio resources would be used for transmitting statistically important information rather than repetitive data, which is a common situation in M2M communications. Simulation results show that our proposed statistical priority-based scheduler outperforms the other baseline schedulers in terms of having the least number of deadline misses (less than 4%) for critical data packets. In addition, our scheduler outperforms the other baseline schedulers in non-redundant data transmission as it achieves a success ratio of at least 70%.
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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| 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