MétaCan
Menu
Back to cohort
Record W2995549874 · doi:10.1109/tcomm.2019.2960345

Secrecy-Enhancing Design for Cooperative Downlink and Uplink NOMA With an Untrusted Relay

2019· article· en· W2995549874 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 Communications · 2019
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Technologies
Canadian institutionsUniversity of Alberta
FundersEngineering and Physical Sciences Research Council
KeywordsTelecommunications linkRelaySecrecyJammingComputer networkComputer scienceEavesdroppingNomaElectronic engineeringEngineeringPower (physics)Computer security

Abstract

fetched live from OpenAlex

We investigate a secrecy-enhancing design for cooperative downlink and uplink non-orthogonal multiple access (NOMA) transmissions with an untrusted relay. A source uses the NOMA principle to have downlink and uplink transmissions with a near user and a far user, and the communications between the source and the far user are aided by an untrusted relay. To minimize information leakage at the untrusted relay and achieve secure NOMA communications, adaptive downlink and uplink cooperative jamming schemes are proposed, where the far user in downlink and the near user in uplink adaptively emit a jamming signal to the untrusted relay to impair its eavesdropping capability. Both downlink and uplink jamming power are optimized to fully exploit the benefits of the proposed schemes for security enhancement. Then, for each scheme, we quantify the secrecy performance by deriving the ergodic secrecy sum rate lower bound and its scaling law. Finally, computer simulation is used to demonstrate the effectiveness of the proposed adaptive downlink and uplink cooperative jamming schemes and verify the accuracy of the derived analytical results.

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 categoriesnone
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.768
Threshold uncertainty score0.868

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.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.001
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.028
GPT teacher head0.258
Teacher spread0.231 · 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