Combating AI-Based Jamming in LEO Satellite Networks Using Quantum Adversarial Deep Reinforcement Learning
Bibliographic record
Abstract
In recent years, the demand for seamless connectivity and highly efficient, reliable network services for low earth orbit (LEO) satellites has escalated. To meet these expectations, a critical issue that must be addressed is combating malicious jamming attacks on satellite networks, which occur due to the open nature of satellite-ground connections. Moreover, in the era of artificial intelligence (AI), AI-based jamming poses a severe threat to the security of satellite networks and disrupts secure communications, particularly given the dynamic movements of LEO satellites and the time-sequential complexity of such attacks. Accordingly, this paper proposes a quantum adversarial deep reinforcement learning (QADRL) approach to mitigate AI-based jamming attacks while enhancing the quality-of-service (QoS) for LEO satellite networks. Specifically, the proposed QADRL approach is based on a zero-sum Markov game utilizing two opposing learning networks: one optimizing satellite routing links to avoid jamming and improve QoS, while the other, focuses on the jammer, optimizes the trajectory, jamming nodes, and power of unmanned aerial vehicles (UAVs) to maximize jamming success. The results demonstrate that the proposed QADRL outperforms classical adversarial DRL (CADRL) by reducing the jamming success rate by 33.33% and increasing the average QoS of the satellite network by 18.4975%.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 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.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".