Learning-Based Reliable and Secure Transmission for UAV-RIS-Assisted Communication Systems
Bibliographic record
Abstract
Mounting reconfigurable intelligent surface (RIS) on unmanned aerial vehicle (UAV), called UAV-RIS, combines the benefits of these two techniques, which can further improve the communication performance. However, high-quality air-ground channel links are more vulnerable to both the adversarial eavesdropping and the malicious jamming. Therefore, this paper proposes a reliable and secure communication approach assisted by the UAV-RIS to maximize the secrecy rate, while ensuring the quality of service (QoS) requirement of the legitimate user against both the eavesdroppers and the jammer. Specifically, with the imperfect channel state information and behaviors of mixed attacks, we try to maximize the achievable worst-case secrecy rate by jointly designing the transmit beamforming, artificial noise, UAV-RIS placement, and RIS’s passive beamforming. As the optimization problem is non-convex and the environment is highly dynamic, a post-decision state deep Q-network combined with Fourier feature mapping algorithm (called PDS-DQN-FFM) is further designed to effectively achieve the robust anti-attack transmission strategy. Simulation results demonstrate that our proposed learning based reliable and secure transmission approach significantly enhances both the secrecy rate and QoS satisfaction level as compared with existing approaches.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 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".