Power Optimization for Secure mmWave-NOMA Network with Hybrid SU-CU Grouping
Bibliographic record
Abstract
Considering the security issue in mmWave-NOMA based networks, the nonorthogonal interference can be exploited to improve the security. In this paper, we propose a novel mmWave-NOMA framework where the users are classified as secure users (SUs) and common users (CUs), to satisfy their heterogeneous security service needs with the presence of ran-domly located eavesdroppers. For better secrecy performance, the NOMA users with stronger channel gains are deemed as SUs, and the hybrid precoding for SUs is designed to strengthen the desired signal and reduce interference. In addition, to reduce the complexity and satisfy the diverse demands, user grouping and power allocation are jointly optimized to maximize the sum rate of CUs subject to the SUs' requirements. The non-convex problem is decomposed into two subproblems, i.e., user grouping and power optimization, and a hybrid SU-CU grouping algorithm and a successive convex approximation based algorithm are proposed to solve them, respectively. Finally, simulation results are provided to show the advantages 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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 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".