A coordinated uplink scheduling and power control algorithm for multicell 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
This paper proposes a coordinated joint uplink user scheduling and power control algorithm across multiple cells in a wireless cellular network. The uplink scheduling and power control problem is more challenging than the downlink, because the uplink interference pattern strongly depends on the schedule decisions of the neighboring cells. This paper considers a weighted sum rate maximization objective in the uplink and formulates the joint scheduling and power control problem as a non-convex mixed-integer problem. The main contribution of the paper is a novel problem reformulation based on sum-of-ratios programming and a distributed iterative algorithm based on a subsequent quadratic transformation. The algorithm optimizes the transmit power and scheduling of each iteration jointly in closed form. The proposed algorithm has provable convergence guarantee, and is shown to significantly outperform existing approaches.
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.000 | 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.000 |
| Open science | 0.000 | 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 it