MétaCan
Menu
Back to cohort
Record W3206067486 · doi:10.1109/twc.2021.3120268

Joint User Grouping and Power Optimization for Secure mmWave-NOMA Systems

2021· article· en· W3206067486 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Transactions on Wireless Communications · 2021
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Technologies
Canadian institutionsWestern University
FundersFundamental Research Funds for the Central UniversitiesNational Key Research and Development Program of ChinaNational Natural Science Foundation of China
KeywordsComputer scienceComputer networkNomaPrecodingWireless networkArtificial noiseSecrecyWirelessOptimization problemChannel (broadcasting)Interference (communication)MIMOTransmitterAlgorithmTelecommunicationsTelecommunications linkComputer security

Abstract

fetched live from OpenAlex

Due to the proliferation of mobile devices, provisioning of massive connectivity has become a major challenge for future networks. The combination of millimeter wave (mmWave) with non-orthogonal multiple access (NOMA) provides a promising solution to massive connectivity. However, the security issue therein cannot be ignored due to the openness of wireless channels. To overcome the security challenge 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 randomly located eavesdroppers. According to their channel disparity, the NOMA users with stronger channel gains are deemed as SUs for better secrecy performance, while the remaining ones are served as CUs. To further enhance the security, 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. To solve the intractable non-convex problem, we decompose it 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.

Full frame distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.920
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.026
GPT teacher head0.247
Teacher spread0.221 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it