Multi-Objective Energy Efficient Resource Allocation in Massive Multiple Input Multiple Output-Aided Heterogeneous Cloud Radio Access Networks
Bibliographic record
Abstract
In this work, a novel energy efficient multi-objective resource allocation algorithm for heterogeneous cloud radio access networks (H-CRANs) is proposed where the trade-off between increasing throughput and decreasing operation cost is considered. H-CRANs serve groups of users through femto-cell access points (FAPs) and remote radio heads (RRHs) equipped with massive multiple input multiple output (MIMO) connected to the base-band unit (BBU) pool via front-haul links with limited capacity. We formulate an energy-efficient multi-objective optimization (MOO) problem with a novel utility function. Our proposed utility function simultaneously improves two conflicting goals as total system throughput and operation cost. With this MOO, we jointly assign the sub-carrier, transmit power, access point (AP)(RRH/FAP), RRH, front-haul link, and BBU. To address the conflicting objectives, we convert the MOO problem into a single-object optimization problem using an elastic-constraint scalarization method. With this approach, we flexibly adjust trade-off parameters to choose between two objective functions. To propose an efficient algorithm, we deploy successive convex approximation (SCA) and complementary geometric programming (CGP) approaches. Finally, via simulation results we discuss how to select the values of trade-off parameters, and we study their effects on conflicting objective functions (i.e., throughput and operation cost in MOO problem). Simulation results also show that our proposed approach can offload traffic from C-RANs to FAPs with low transmit power and thereby reduce operation costs by switching off the under-utilized RRHs and BBUs. It can be observed from the simulation results that the proposed approach outperforms the traditional approach in which each user is associated to the AP (RRHs/FAPs) with the largest average value of signal strength. The proposed approach reduces operation costs by 30% and increases throughput index by 25% which in turn leads to greater energy efficiency (EE).
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.000 | 0.000 |
| 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".