Learning Resilient Distributed Channel Access Policies in V2I Networks Under Intelligent Jamming
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
While the Internet of Vehicles (IoV) can revolutionize transportation systems through intelligent connectivity, a critical challenge in realizing this potential lies in ensuring efficient channel allocation in the IoV ecosystem, particularly considering dynamic channel conditions and adversarial jamming exacerbated by the emergence of artificial intelligence (AI)-based jamming. To address these challenges, in this study, we use distributed edge intelligence (DEI) to propose a distributed channel access mechanism for the vehicle-to-infrastructure (V2I) mode of IoV networks. Specifically, using an actor-critic-based multiagent reinforcement learning (MARL) framework with a common critic, we model the distributed channel access problem in V2I communications under varying channel conditions and an intelligent jamming device <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$(\tt {iJD})$ </tex-math></inline-formula> interference as a decentralized partially observable stochastic game (Dec-POSG). Furthermore, by addressing challenges, such as partial observations, nonstationarity, and credit assignment, our proposed approach fosters collaboration among intelligent vehicles (<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\tt {iV}$ </tex-math></inline-formula>s) without direct communication. In addition, our unique counterfactual reasoning-aided action evaluation mechanism and a novel utility function design enable the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\tt {iV}$ </tex-math></inline-formula>s to learn mixed collaborative-competitive channel access policies, thereby enhancing channel utilization, mitigating the impact of the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\tt {iJD}$ </tex-math></inline-formula>, and improving the network’s sum cross-layer achievable rate (SCLAR).
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.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.003 | 0.001 |
| Research integrity | 0.000 | 0.002 |
| 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