Reinforcement Learning Based PHY Authentication for VANETs
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
Mobile edge computing in vehicular ad hoc networks (VANETs) suffers from rogue edge attacks due to the vehicle mobility and the network scale. In this paper, we present a physical authentication scheme to resist rogue edge attackers whose goal is to send spoofing signals to attack VANETs. This authentication scheme exploits the channel states of the shared ambient radio signals of the mobile device and its serving edge such as the onboard unit during the same moving trace and applies reinforcement learning to select the authentication modes and parameters. By applying transfer learning to save the learning time and applies deep learning to further improve the authentication performance, this scheme enables mobile devices in VANETs to optimize their authentication modes and parameters without being aware of the VANET channel model, the packet generation model, and the spoofing model. We provide the convergence bound such as the mobile device utility, evaluate the computational complexity of the physical authentication scheme, and verify the analysis results via simulations. Simulation and experimental results show that this scheme improves the authentication accuracy with reduced energy consumption against rogue edge attacks.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 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