Joint access class barring and timing advance model for machine-type communications
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
The existing wireless cellular networks can provide machine-to-machine (M2M) service to machine-type communication (MTC) devices deployed in large coverage areas. However, the current Long Term Evolution (LTE) cellular networks designed for human users may not be able to handle a large number of bursty random access requests from MTC devices. In this paper, we propose to jointly use access class barring (ACB) and timing advance (TA) command to reduce the random access overload. In our proposed scheme, the expected number of MTC devices served in one random access slot is determined by the coverage of the base station, total number of devices to be served, the number of preambles, and ACB parameter. By choosing the optimal ACB parameter, we can maximize the number of MTC devices being served in each random access slot. The total number of random access slots required by an LTE base station to serve all MTC devices can be minimized. Simulation results show that in typical LTE cellular networks, our proposed scheme can reduce at least a half of the total slots required by the base station to serve all MTC devices.
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.000 | 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