Moving target defense approach for secure relay selection in vehicular networks
Bibliographic record
Abstract
Ensuring the security and reliability of cooperative vehicle-to-vehicle (V2V) communications is an extremely challenging task due to the dynamic nature of vehicular networks as well as the delay-sensitive wireless medium. In this context, the moving target defense (MTD) paradigm has been proposed to overcome the challenges of conventional solutions based on static network services and configurations. Specifically, the MTD approach involves the dynamic altering of network configurations to improve resilience to cyberattacks. Nevertheless, the current MTD solution for cooperative networks poses several limitations, such as that they require high synchronization modules that are resource-intensive and difficult to implement; and they rely heavily on attack-defense models, which may not always be accurate or comprehensive to use. To overcome these challenges, the proposed approach introduces an adaptive defense strategy within the MTD framework. This strategy proposes an intelligent spatiotemporal diversification-based MTD scheme to defend against eavesdropping attacks in cooperative V2V networks. It involves altering the system configuration spatially through relay selection and adjusting the percentage of injected fake data over time. This approach aims to balance reducing intercept probability while ensuring high throughput . Our methodology involves modeling the configuration of vehicular relays and data injection patterns as a Markov decision process , followed by applying deep reinforcement learning to determine the optimal configuration. We then iteratively evaluate the intercept probability and the percentage of transmitted real data for each configuration until convergence is achieved. To optimize the security-real data percentage (S-RDP), we developed a two-agent framework, namely MTD-DQN-RSS & MTD-DQN-RSS-RDP. The first agent, MTD-DQN-RSS, tries to minimize the intercept probability by injecting additional fake data, which in turn reduces the overall RDP, while the second agent, MTD-DQN-RSS-RDP, attempts to inject a sufficient amount of fake data to achieve a target S-RDP. Finally, extensive simulation results are conducted to demonstrate the effectiveness of our proposed solution, which improved system security compared to the conventional relay selection approach.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| 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.002 | 0.001 |
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".