Covert Communication Toward an Aerial Warden in NOMA-Based UAV-MEC Systems
Bibliographic record
Abstract
Non-orthogonal multiple access (NOMA) enables multiple terminal devices to simultaneously share wireless resources, providing efficient computing offloading services for wireless devices in networks that integrate unmanned aerial vehicles (UAVs) with mobile edge computing (MEC). However, the broadcast characteristics of UAV line-of-sight (LoS) communication introduce serious security issues for NOMA-based UAV-MEC systems, especially when facing an aerial warden. To address this issue, we propose a covert communication scheme for NOMA-based UAV-MEC systems against an aerial warden, where the aerial warden monitors the task offloading behavior of terminal devices. In the proposed scheme, the average computing capacity is maximized by jointly optimizing the UAV trajectory and system resources while ensuring the covert performance requirements. Firstly, considering the terminal devices have a fixed number of computing tasks, a block coordinate descent (BCD)-based algorithm is proposed, which decomposes the non-convex original problem into several subproblems and solves them iteratively. Secondly, considering the case of dynamic tasks arrival at terminal devices, we propose a double-deep Q-learning (DDQN)-based algorithm, where the optimal strategy for trajectory planning and resource allocation is obtained. Simulation results demonstrate that the proposed scheme using two algorithms outperform their respective baselines.
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.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 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".