A combined rate/power/cell control scheme for delay insensitive applications in CDMA systems
Bibliographic record
Abstract
A novel combined rate, power and cell (R/P/C) control scheme that gracefully implements congestion control, is proposed and studied. We consider the reverse link in a CDMA network with a high degree of traffic fluctuations spatially with time, as would be the case in future wireless systems. Our scheme attempts to reduce the high interference power variations among cell-site antennas that can exist in a real network. The transmission rates of those users in the congested (non-congested) cells are decreased (increased) providing the required average throughput among users; hence, the proposed scheme is appropriate for delay insensitive applications. We consider the minimization of the average transmit bit energy (/spl Theta/) subject to maintaining individual target E/sub b//I/sub 0/ for each user. Two algorithms, one directly minimizing /spl Theta/ and the other indirectly using measured pilot power, are given. Both algorithms select the optimal cell-site if forward and reverse link gains are equal; however, the latter is decentralized and uses only local measurements and amenable for practical implementation. Simulation results show that a 20% reduction in transmit bit energy can be achieved on average using our schemes over the scheme with no rate control.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".