MétaCan
Menu
Back to cohort
Record W2290880884 · doi:10.1109/wcnc.2015.7127629

Secrecy rate with friendly full-duplex relay

2015· article· en· W2290880884 on OpenAlexaff
Saeedeh Parsaeefard, Tho Le‐Ngoc

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicWireless Communication Security Techniques
Canadian institutionsMcGill University
Fundersnot available
KeywordsRelaySecrecyRelay channelComputer scienceFadingChannel state informationComputer networkInterference (communication)Channel (broadcasting)Power (physics)WirelessTelecommunicationsComputer securityPhysics

Abstract

fetched live from OpenAlex

This paper considers the use of a friendly full-duplex (FD) relay to increase the secrecy rate over a fading channel between the legitimate source and destination in the presence of a naive or informed eavesdropper. Naive eavesdropper can only decode the received signals either from the source or from the relay, while informed eavesdropper can overhear signals transmitted from both the source and relay. Accordingly, we compare the achievable secrecy rates of FD relay with traditional half-duplex (HD) relay in terms of the channel state information (CSI) between nodes, eavesdropper types, and the self-interference (SI) in FD-Relay. We consider the non-convex power allocation problems for the developed FD-relay to maximize the secrecy rate under the power constraints and develop an efficient iterative algorithm based on the difference-of-two-concave-functions (DC) programming. The analytical and simulation results confirm that FD relay offers significant improvements in the secrecy rate over the HD-Relay.

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: Not applicable · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.379
Threshold uncertainty score0.373

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.020
GPT teacher head0.231
Teacher spread0.211 · 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 designNot applicable
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

Citations4
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicWireless Communication Security TechniquesFrench-language works237,207