Energy-Aware Cross-Layer Offloading in Fog-RANs Using Network Coded Device Cooperation
Bibliographic record
Abstract
This paper studies a Fog Radio Access Network (F-RAN) architecture that utilises the increasing storage and device-to-device communication capacities of users' smart devices (referred to as F-UEs) in order to reduce the time that the central processing unit (referred to as BBU) has to spend to serve these F-UEs and thus, increases the system's capacity. Indeed, these F-UEs can employ these capacities in cooperatively serving each other's file requests, as long as the F-UEs have the files in their storage, rather than always receiving them through the BBU. In addition, network coding (NC) can be employed to minimize the communications among the F-UEs and from the BBU to further offload the BBU resources and reduce the energy consumed in F-UEs' cooperation. This paper develops an algorithm for scheduling the file encoding and transmissions both among half-duplex F-UEs and from the BBU to minimise the consumed time-frequency resources from the BBU given constraints on the energy consumed by each F-UE for their cooperation to help preserve their battery life. The influence of the energy constraint on BBU offloading is investigated and the performance of the system under a variety of settings is evaluated through extensive simulations. The benefit of using NC is shown and the ability of the F-UEs to transmit with different power levels is also studied and shown to considerably impact the number of cooperating F-UEs and the BBU offloading.
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.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 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".