Secure Transmission via Power Allocation in NOMA-UAV Networks With Circular Trajectory
Bibliographic record
Abstract
Non-orthogonal multiple access (NOMA) aided unmanned aerial vehicle (UAV) is becoming a promising technique for future wireless networks. However, its security remains a great challenge due to the line-of-sight in UAV communications and high transmit power for weak users in NOMA. Thus, in this paper, we propose a power allocation (PA) scheme for NOMA-UAV networks with circular trajectory, to maximize the sum rate of common users while guaranteeing the security for a specific user. To achieve this, we consider three cases based on the distance from the UAV to the secure user. Specifically, the lowest transmit power is assigned to the secure user in each time slot to guarantee its security, with the remaining power allocated to common users to maximize their sum rate. Due to the non-convexity of the problem, we analyze its monotonicity and derive the closed-form solutions for these three cases. To further improve the transmission rate of the secure user, we also derive the upper bound for its decoding threshold, and analyze the linear relationship between the secure decoding threshold and the sum rate of common users. Simulation results are demonstrated to evaluate the effectiveness of the proposed secure PA scheme in NOMA-UAV networks.
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.003 |
| 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.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".