Federated Deep Reinforcement Learning Enhanced Dynamic Vehicular Edge Caching Management
Bibliographic record
Abstract
In this study, we present a hybrid deep reinforcement learning (DRL) algorithm, trained using vehicular federated learning (VFL), specifically tailored for dynamic vehicular networks with historical data. Our approach utilizes VFL-based DRL to refine the caching scheme in these networks, focusing on predicting and storing the most effective content nearby to enhance cache efficiency and reduce content request delays. We propose a modified proximal policy optimization (mPPO) based approach for the DRL-based decision-making for caching management, which combines the advantages of proximal policy optimization (PPO) and double deep Q-network (DDQN). Our study encompasses a vehicular framework that includes a central edge node (CEN), roadside units (RSUs), unmanned aerial vehicles (UAVs), and vehicles equipped with historical data. We tackle the challenges posed by varying vehicle density and mobility, non-uniform RSU coverage, and constrained caching capacity. Through comprehensive simulations, we demonstrate that mPPO outperforms conventional DRL methods like PPO and DDQN, as well as heuristic approaches. These results underscore the efficacy of the VFL-based mPPO in dynamic vehicular networks, confirming its potential for real-world applications.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 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.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".