Optimal Access Class Barring for Stationary Machine Type Communication Devices With Timing Advance Information
Bibliographic record
Abstract
The current wireless cellular networks can be used to provide machine-to-machine (M2M) communication services. However, the Long Term Evolution (LTE) networks, which are designed for human users, may not be able to handle a large number of bursty random access requests from machine-type communication (MTC) devices. In this paper, we propose a scheme that uses both access class barring (ACB) and timing advance information to prevent random access overload in M2M systems. We formulate an optimization problem to determine the optimal ACB parameter, which maximizes the expected number of MTC devices successfully served in each random access slot. Hence, the number of random access slots required to serve all MTC devices can be minimized. To reduce the computational complexity and improve the practicability of the proposed scheme, we propose a closed-form approximate solution to the optimization problem and present an algorithm to estimate the number of active MTC devices requiring access in each random access slot. The correctness of the analytical model and the accuracy of the estimation algorithm are validated via simulations. Results show that both numerical and approximate solutions provide the same performance. Our proposed scheme can reduce nearly half of the random access slots required to serve all MTC devices compared to the existing schemes, which use timing advance information only, ACB only, or cooperative ACB.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".