Data Freshness Optimization Under CAA in the UAV-Aided MECN: A Potential Game Perspective
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
As a promising enabler for edge intelligence, Unmanned Aerial Vehicles (UAV) have become more and more important in Mobile Edge Computing Networks (MECN), such as communication, computation, collection and control service supply. Although Age of Information (AoI) minimization is indispensable for fresh information collection and computation in the UAV-aided MECN, some attackers can launch attacks to deteriorate the availability of precious channel resources, such as revealed channel access attacks (CAAs). Moreover, recent research has not considered the system’s active probability and security issues concurrently, e.g., CAA, in the average AoI minimization process. In this paper, to deal with this problem, we consider an AoI-oriented channel access problem under CAA with a game theory viewpoint. Firstly, to obtain a MECN-based AoI indicator under CAA, the system model with active probability consideration is established. Next, the channel access-based AoI minimization problem is formulated from the viewpoint of the Ordinary Potential Game (OPG). Furthermore, two algorithms called AACSD and DCASD are proposed to determine channel access strategies, by which the Nash Equilibrium (NE) solution of the OPG could be reached. Finally, experiments are conducted under homogeneous and heterogeneous parameter settings, and the simulation results evaluate the correctness and effectiveness of our proposals.
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.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.002 |
| Open science | 0.002 | 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 it