Enhancing Sustainability in HAPS-Assisted 6G Networks: Load Estimation Aware Cell Switching
Bibliographic record
Abstract
This study introduces and addresses the critical challenge of traffic load estimation in cell switching within vertical heterogeneous networks (vHetNets). The effectiveness of cell switching is significantly limited by the lack of accurate traffic load data for small base stations (SBSs) in sleep mode, making many load-dependent energy-saving approaches impractical, as they assume perfect knowledge of traffic loads—an assumption that is unrealistic when SBSs are inactive. In other words, when SBSs are in sleep mode, their traffic loads cannot be directly known and can only be estimated, inevitably with corresponding errors. Rather than proposing a new switching algorithm, we focus on eliminating this foundational barrier by exploring effective prediction techniques. A novel vHetNet model is considered, integrating a high-altitude platform station (HAPS) as a super macro base station (SMBS). We investigate both spatial and temporal load estimation approaches, including three spatial interpolation schemes—random neighboring selection, distance-based selection, and multi-level clustering (MLC)—alongside a temporal deep learning method based on long short-term memory (LSTM) networks. Using a real-world dataset for empirical validation, our results show that both spatial and temporal methods significantly improve estimation accuracy, with the MLC and LSTM approaches demonstrating particularly strong performance.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 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.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 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".