Green‐oriented user‐satisfaction aware WiFi offloading in HetNets
Bibliographic record
Abstract
To cope with the tremendous growth of data traffic and obtain a given communication service with minimal energy use, traffic offloading and energy efficiency (EE) improving are two important issues to address for green cellular networks. The authors investigate downlink WiFi offloading in a heterogeneous network consisting of one long term evolution eNodeB (eNB) and multiple overlaid WiFi access points to maximise the user satisfaction of the whole system. In addition, a designed resource reallocation scheme after offloading is jointly considered to improve the EE of the eNB. In the offloading model, two constraints are considered to guarantee the rate promotion of the offloaded users and less impact on WiFi networks. Moreover, the authors transform the model into a combinatorial optimisation problem and adopt the best response (BR) algorithm based on game‐theoretic approach to obtain the optimal offloading user set. Numerical results show that the proposed WiFi‐offloading model can significantly improve the aggregate user satisfaction as well as EE of the eNB. Also, the BR algorithm can converge to the optimal solution same as the exhaustive search algorithm through several iterations.
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.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 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".