Optimal Joint Remote Radio Head Selection and Beamforming Design for Limited Fronthaul C-RAN
Bibliographic record
Abstract
This paper considers the downlink transmission of cloud-radio access networks (C-RANs) with limited fronthaul capacity. We formulate a joint design of remote radio head (RRH) selection, RRH-user association, and transmit beamforming for simultaneously optimizing the achievable sum rate and total power consumption, using the multiobjective optimization concept. Due to the nonconvexity of perfronthaul capacity constraints and introduced binary selection variables, the formulated problem lends itself to a mixed-integer nonconvex program, which is generally non-deterministic polynomial-time hard. Motivated by powerful computing capability of C-RAN and for benchmarking purposes, we propose a branch and reduce and bound-based algorithm to attain a globally optimal solution. For more practically appealing approaches, we then propose three iterative low-complexity algorithms. In the first method, we iteratively approximate the continuous nonconvex constraints by convex conic ones using successive convex approximation framework. More explicitly, the problem obtained at each iteration is a mixed-integer second-order cone program (MI-SOCP) for which dedicated solvers are available. In the second method, we first relax the binary variables to be continuous to arrive at a sequence of SOCPs and then perform a postprocessing procedure on the relaxed variables to search for a high-performance solution. In the third method, we solve the considered problem in view of sparsity-inducing regularization. Numerical results show that our proposed algorithms converge rapidly and achieve near-optimal performance as well as outperform the known algorithms.
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.002 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".