Robust Secure Transmission for IRS-Assisted UAV-ISAC Networks without Eavesdropping CSI
Bibliographic record
Abstract
Integrated sensing and communication (ISAC), is emerging as a promising technology for future mobile networks. This paper studies the robust secure transmission for intelligent reflecting surface (IRS) assisted unmanned aerial vehicle (UAV)-ISAC networks without eavesdropping channel state information. Particularly, the UAV, as a dual-functional ISAC base station, serves$K$communication users and senses$J$targets with an IRS. Furthermore, an eavesdropper aims at eavesdropping the private information from the UAV to$K$users. Without eavesdropping channel state information, a secure transmission scheme is proposed to maximize the average achievable rate via jointly designing the transmit power allocation, the scheduling of users and targets, the phase shifts at IRS, and the trajectory and velocity of the UAV. Owing to the non-convexity, an iterative algorithm based on the alternating optimization, the successive convex approximation and the manifold optimization is proposed to obtain a sub-optimal solution. Simulation results verify the effectiveness of the proposed scheme.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| 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".