Collaborative Communication and Computation for Secure UAV-Enabled MEC Against Active Aerial Eavesdropping
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
Unmanned aerial vehicle (UAV)-enabled mobile edge computing (MEC) can provide flexible computing service for terminal-devices (TDs). However, malicious active aerial eavesdroppers can perform air-to-ground eavesdropping and air-to-air attacking, which makes TDs’ tasks offloading computation more vulnerable, posing significantly secure threats to UAV-enabled MEC. To overcome this challenge, we aim to design collaborative communication and computation schemes for the secure UAV-enabled MEC system, where an active aerial eavesdropper is capable of wiretapping the tasks information offloaded from TDs and transmitting attack signals to the legitimate network. The total weighted energy consumption of the system is minimized via optimizing time allocation, transmit power, local and offloading computation bits, as well as UAV trajectory. First, considering the given number of computational tasks of TDs, a block coordinate descent (BCD)-based scheme is proposed to decompose the original multi-variables-coupling and close-form-lacking problem into several tractable subproblems that can be addressed by iterations. Next, considering that there are dynamic and random tasks arriving to TDs’ original tasks, a deep reinforcement learning (DRL)-based scheme is proposed to maintain the stability of tasks, where the solution of computation, communication and trajectory optimization is intelligently obtained by adopting double-deep Q-learning (DDQN). Simulation results demonstrate that the proposed schemes outperform the respective benchmarks for secure UAV-enabled MEC against active aerial eavesdropping.
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.001 |
| Science and technology studies | 0.001 | 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