MétaCan
Menu
Back to cohort
Record W2003025695 · doi:10.1109/lwc.2014.2349514

On the Secrecy Rate Achievability in Dual-Hop Amplify-and-Forward Relay Networks

2014· article· en· W2003025695 on OpenAlexaff
Auon Muhammad Akhtar, Aydin Behnad, Xianbin Wang

Bibliographic record

VenueIEEE Wireless Communications Letters · 2014
Typearticle
Languageen
FieldEngineering
TopicWireless Communication Security Techniques
Canadian institutionsWestern University
Fundersnot available
KeywordsRelaySecrecyComputer scienceComputer networkWirelessTransmitter power outputHop (telecommunications)Link (geometry)Signal-to-noise ratio (imaging)Dual (grammatical number)Topology (electrical circuits)Power (physics)TelecommunicationsTransmitterComputer securityElectrical engineeringChannel (broadcasting)PhysicsEngineering

Abstract

fetched live from OpenAlex

The achievable secrecy rate of a dual-hop amplify-and-forward relaying system, in the presence of an eavesdropper, is investigated based on the different values of the wireless links' signal-to-noise ratios (SNRs). It is shown that when the direct link to the eavesdropper is in a better condition than the direct link to the destination, but the relaying link for the destination is better than the relaying link for the eavesdropper, under specific conditions for the links SNRs, it is possible to achieve the secrecy rate for a limited range of the relay power. On the other hand, when the direct link to the destination is better than the direct link to the eavesdropper, under certain conditions for the links' SNRs, it is not always beneficial to employ the relay, since there exists a limited range of relaying power for which secrecy rate is not achievable. Finally, it is shown that the source transmit power has no impact on the secrecy rate achievability. Simulation results confirm the theoretical analysis carried out in this letter.

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 imitation

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

metaresearch head score (Codex)0.004
metaresearch head score (Gemma)0.018
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.021

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.018
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0020.002
Science and technology studies0.0010.003
Scholarly communication0.0030.003
Open science0.0010.003
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0020.001

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.016
GPT teacher head0.238
Teacher spread0.222 · 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 source (direct Gemma or distilled Codex), 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
Published2014
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Wireless Communications LettersSame topicWireless Communication Security TechniquesFrench-language works237,207