A novel multiobjective framework for cell switch-off in dense cellular networks
Bibliographic record
Abstract
The green communications paradigm has been receiving much attention in wireless networks in recent years. More specifically, in the context of cellular communications, the concept of Cell Switch Off (CSO) has been recognized as a promising approach to reduce the energy consumption. The need is expected to be pressing especially in the next decade with the increasing small cell deployment. However, the cell switch on/off decisions compounded by the resource allocation task in CSO constitute a highly challenging optimization problem due to the fact that this problem can be viewed as a generalized version of the resource allocation (scheduling) problem in the conventional cellular networks without CSO, which itself is already difficult. This paper introduces a novel framework to CSO based on multiobjective evolutionary optimization. The main contribution of this paper is that the proposed multiobjective framework takes the traffic behaviour in both space and time (known by operators) into account in the optimal cell switch on/off decision making which is entangled with the corresponding resource allocation task. The exploitation of this statistical information is done in a number of ways, including through the introduction of a weighted network capacity metric. This indicator prioritizes cells which are expected to have traffic concentration resulting in on/off decisions that achieve substantial energy savings in scenarios where traffic is highly unbalanced, without compromising the QoS. The proposed framework distinguishes itself from the CSO papers in the literature in two ways: 1) The number of cell switch on/off transitions as well as handoffs are minimized. 2) The computationally-heavy part of the algorithm is executed offline, which makes the real-time implementation feasible.
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.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".