Distributed base station activation for energy-efficient operation of cellular networks
Bibliographic record
Abstract
Dynamic base station activation (DBA) has recently emerged as a viable solution for reducing energy consumption in cellular networks. While most of the works on this topic focused on centralized decision making algorithms, in this paper we investigate distributive solutions. These solutions are particularly desirable due to importance of self-organization and self-optimization in future cellular networks. The goal of DBA is to achieve an optimal trade-off between network operator's revenue and operational cost while guaranteeing coverage for network users. The problem is posed as a network utility maximization aiming to find the optimal activation schedule of each base station. Using Lagrangian duality, the problem is decomposed into smaller subproblems, where each subproblem is solved locally at its associated base station. Controlled message passing among base stations ensures convergence to the global optimal solution. Moreover, this general solution is further extended to capture the combinatorial nature of DBA. Finally, numerical results are provided to demonstrate the behavior of our solution in terms of utility and cost trade-off and convergence in some example network scenarios.
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 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".