Advanced adaptive call admission control for mobile cellular networks
Bibliographic record
Abstract
The crucial issues for service providers in wireless cellular networks include providing guaranteed quality of service (QoS), minimizing dropping rate (DR) for handoff calls, reducing the blocking rate (BR) for new calls and most importantly ensuring efficient utilization of network resources to maximize profits. This paper proposes an adaptive call admission control (CAC) algorithm for a wideband code division multiple access (WCDMA) network. The proposed algorithm utilizes three major concepts: cell breathing by considering the distance of a new and handoff call from a base station, bandwidth degradation of multimedia calls to provide priority for voice and video calls and transfer of ongoing calls to other cells to provide the highest priority to voice calls. This work is useful in the case when a voice or video call cannot be accepted into a cell due to unavailability of bandwidth and also when a new or handoff voice call cannot be accepted because the cell has already reached its maximum number of calls. Simulation results are presented for relations between call blocking, dropping probability and bandwidth utilization for different types of traffic (i.e. multimedia, video and voice calls).
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 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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".