Joint User Association and Resource Allocation in CoMP-Enabled Heterogeneous CRAN
Bibliographic record
Abstract
In this paper, we consider jointly optimizing user association, resource allocation and power allocation in a two tier heterogeneous cloud radio access network (H-CRAN). Our objective is to utilize all the network resources in the most efficient way to maximize the network average throughput, while keeping some constraints such as the quality of service (QoS), interference protection to the devices associated with the Macro remote radio head (RRH), and fronthaul capacity. In our system, we propose using coordinated multi-point (CoMP) transmissions to utilize any excess resources to maximize the network performance. In contrast to the literature, in which CoMP is usually used only to support edge users. We divide our joint problem into three sub-problems: user association, radio resource allocation, and power allocation. We propose matching game based low complexity algorithms to tackle the first two subproblems. For the power allocation sub-problem, we propose a novel technique to convexity the non-convex original problem to obtain the optimal solution. Given the conducted simulations, our proposed algorithms proved to enhance the network average weighted sum rate significantly, compared to the state of the art algorithms in the literature.
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.001 |
| Science and technology studies | 0.001 | 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.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".