Enhanced Fairness and Scalability of Power Control Schemes in Multi-Cell Massive MIMO
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 studies the transmit power optimization in multi-cell Massive multiple-input multiple-output (MIMO) systems. Network-wide max-min fairness (NW-MMF) and network-wide proportional fairness (NW-PF) are two well-known power control schemes in the literature. The NW-MMF focus on maximizing the fairness among users at the cost of penalizing users with good channel conditions. On the other hand, the NW-PF focuses on maximizing the sum SE, thereby ignoring fairness, but gives some extra attention to the weakest users. However, both of these schemes suffer from a scalability issue which means that for large networks, it is highly probable that one user has a very poor channel condition, pushing the spectral efficiency (SE) of all users towards zero. To overcome the scalability issue of NW-MMF and NW-PF, we propose a novel power control scheme that is provably scalable. This scheme maximizes the geometric mean (GM) of the per-cell max-min SE. To solve this new optimization problem, we prove that it can be rewritten in a convex optimization form and then solved using standard tools. The simulation results highlight the benefits of our model which is balancing between NW-PF and NW-MMF.
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