WLC13-2: Reduced-Outage-Probability Algorithms for Cross-Layer Call Admission Control in CDMA Beamforming Systems
Bibliographic record
Abstract
A new call admission control (CAC) algorithm based on an approximated power control feasibility condition is proposed for the uplink of a cellular system. While power control feasibility can be expressed in closed-form for the case of single antennas, an approximated power control feasibility condition is required for multiple antenna systems. This approximation, however, increases outage probability in the physical layer. In this paper, we investigate the mitigation of the outage problem in the context of cross-layer performance, and propose CAC algorithms for code-division multiple access (CDMA) beamforming systems. More specifically, these new methods achieve a network-layer performance gain, in terms of low connection delay and low blocking probability, while simultaneously guaranteeing physical-layer performance in terms of outage probability. In this paper, several reduced-outage-probability (ROP) algorithms are proposed. Numerical examples illustrating the performance and properties of these ROP are presented and compared.
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.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 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".