MétaCan
Menu
Back to cohort
Record W2175451653 · doi:10.1109/pacrim.2015.7334844

Secrecy capacity and wireless energy harvesting in amplify-and-forward relay networks

2015· article· en· W2175451653 on OpenAlexaff
Dan Su, S. Ali Mousavifar, Cyril Leung

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicWireless Communication Security Techniques
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsRelayJammingSecrecyComputer networkComputer scienceWirelessEnergy harvestingRelay channelEnergy (signal processing)Power (physics)TelecommunicationsComputer securityMathematicsPhysics

Abstract

fetched live from OpenAlex

The secrecy capacity (SC) from the source to a destination in a dual-hop amplify-and-forward (AF) relay network using cooperative jamming (CJ) is investigated. Conditions for achieving a positive SC are derived. An energy constrained untrusted cooperative relaying protocol is considered in which the relay forwards information from the source to the destination while harvesting energy from the source signal and the destination jamming signal. An optimization problem is proposed to maximize the SC subject to the energy constraints. A method is proposed to find the optimal power split ratio (PSR) which maximizes the SC. An approximate expression for the optimal PSR is also derived. Results show that a mutually beneficial relationship exists between source-destination pair and the relay. This allows the relay to achieve a net energy gain while the secrecy of the confidential message from the source to the destination is protected.

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 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: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.914
Threshold uncertainty score0.562

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.0000.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.028
GPT teacher head0.218
Teacher spread0.190 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Quick stats

Citations6
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicWireless Communication Security TechniquesFrench-language works237,207