Iterative Trajectory Optimization for Physical-Layer Secure Buffer-Aided UAV Mobile Relaying
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
With the fast development of commercial unmanned aerial vehicle (UAV) technology, there are increasing research interests on UAV communications. In this work, the mobility and deployment flexibility of UAVs are exploited to form a buffer-aided relaying system assisting terrestrial communication that is blocked. Optimal UAV trajectory design of the UAV-enabled mobile relaying system with a randomly located eavesdropper is investigated from the physical-layer security perspective to improve the overall secrecy rate. Based on the mobility of the UAV relay, a wireless channel model that changes with the trajectory and is exploited for improved secrecy is established. The secrecy rate is maximized by optimizing the discretized trajectory anchor points based on the information causality and UAV mobility constraints. However, the problem is non-convex and therefore difficult to solve. To make the problem tractable, we alternatively optimize the increments of the trajectory anchor points iteratively in a two-dimensional space and decompose the problem into progressive convex approximate problems through the iterative procedure. Convergence of the proposed iterative trajectory optimization technique is proved analytically by the squeeze principle. Simulation results show that finding the optimal trajectory by iteratively updating the displacements is effective and fast converging. It is also shown by the simulation results that the distribution of the eavesdropper location influences the security performance of the system. Specifically, an eavesdropper further away from the destination is beneficial to the system's overall secrecy rate. Furthermore, it is observed that eavesdropper being further away from the destination also results in shorter trajectories, which implies it being energy-efficient as well.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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