Dynamic access class barring and relay assisted radio resource allocation methods for cellular M2M 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
Cellular based M2M systems generate massive number of access requests which create congestion in the cellular network. The contention-based random access procedures are designed for cellular networks which cannot accommodate a large number of M2M traffic. Moreover, M2M systems share same radio resources with cellular users. Resource allocation problem becomes a challenging issue in cellular M2M systems. In this thesis, we address these two problems by analyzing a contention-based slotted Aloha random access procedure for M2M networks using different performance metrics. The impact of massive M2M traffic over cellular traffic is studied based on different arrival rate, random access opportunity and throughput. An analytical model of selecting a base station (eNB) along with load balancing is developed. Finally, two methods have been presented and evaluated with M2M traffic. First one is dynamic access class barring method which controls RAN level congestion by selecting an appropriate eNB and applying load balancing method. Second one is relay-assisted radio resource allocation method which maximizes the sum throughput of the system by utilizing the available radio resource blocks and relay nodes to the MTC systems. Numerical results show that frame transmission rate influences the selection probability of the base stations. Moreover, the dynamic access class barring parameter along with frame transmission rate improve the overall throughput and access success probability among base stations as well as avoid overload situation in a particular base station.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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