Joint optimisation of radio and infrastructure resources for energy‐efficient massive data storage in the mobile cloud over 5G HetNet
Bibliographic record
Abstract
This study formulates the problem of radio resource and data transmission strategy in a dense HetNet enhanced with mobile cloud computing and mobile edge computing technologies as a combinatorial optimisation problem. An ant colony optimisation (ACO)‐based energy‐aware algorithm is proposed as solution approach, which consists of a data transmission management scheme and a physical resource blocks/bandwidth allocation scheme. Simulation results show that compared with baseline approaches [(greedy and data split multiple user equipment (UEs) algorithms]), the proposed ACO‐based algorithm achieves: (i) about 99% of reduction in terms of transmission delay under varying data file sizes (resp. varying number of UEs in the network); (ii) about 99% of reduction in terms of transmission energy dissipated by an UE during transmission of a file under varying data file sizes (resp. varying number of UEs in the network); (iii) improved performance with an increase in the number of small base stations in the network, (iv) significant reduction in the energy transmitted (by the UE) during transmission of big data files to the cloud storage; and (v) some stability irrespective of the variation in network conditions such as increasing the number of active UEs or increasing the number of UEs in the network.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 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.000 |
| 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".