MétaCan
Menu
Back to cohort
Record W2585685126 · doi:10.1109/glocom.2016.7842212

Relay Selection to Improve Secrecy in Cooperative Threshold Decode-and-Forward Relaying

2016· article· en· W2585685126 on OpenAlexaff

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsMemorial University of Newfoundland
Fundersnot available
KeywordsRelayRayleigh fadingSecrecySelection (genetic algorithm)Decoding methodsChannel (broadcasting)Channel state informationOutage probability

Abstract

fetched live from OpenAlex

In this paper, relay selection is considered to enhance security of a cooperative system with multiple threshold-selection decode-and-forward (DF) relays. Threshold-selection DF relays are the relays in which a predefined signal-to-noise ratio is set for the condition of successful decoding of the source message. We focus on the practical and general scenario where the channels suffer from independent non-identical Rayleigh fading and where the direct links between the source and destination and source and eavesdropper are available. Based on channel state information knowledge, three relay selection strategies, namely traditional, improved traditional, and optimal, are studied. In particular, the secrecy outage probability of all three strategies are obtained in closed-form. It is found that the diversity of secrecy outage probability of all strategies can improve with increasing the number of relays. It is also observed that the secrecy outage probability is limited by either the source to relay or relay to destination channel quality.

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: none
Teacher disagreement score0.844
Threshold uncertainty score0.342

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
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.023
GPT teacher head0.276
Teacher spread0.253 · 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

Citations19
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207