Files Cooperative Caching Strategy Based on Physical Layer Security for Air-to-Ground Integrated IoV
Bibliographic record
Abstract
Mobile edge cache (MEC)-enabled air-to-ground integrated Internet of Vehicles (IoV) technology can solve wireless network backhaul congestion and high latency, but security problems such as eavesdropping are often ignored when designing cache strategies. In this paper, we propose a joint design of cache strategy and physical layer transmission to improve the security offloading ratio of MEC-enabled air-to-ground IoV. By using the random geometry theory and Laplace transform, we derive the closed-form expression of the network security offloading ratio, which is defined as the probability that the request vehicle (RV) successfully finds the required file around it and obtains the file with a data rate larger than a given threshold. During the file acquisition process, we collectively consider the impact of the successful connection and secure transmission in the vehicle wireless communication. Then, we establish an optimization problem for maximizing the network security offloading ratio, in which the cache strategy and the secure transmission rate are jointly optimized. Furthermore, we propose an alternating optimization algorithm to solve the joint optimization problem. Simulation experiments verify the correctness of our theoretical derivation, and prove that the proposed cache strategy is superior to other existing cache strategies.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| 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.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".