MétaCan
Menu
Back to cohort

Secrecy Enhancement via Cooperative Relays in Multi-Hop Communication Systems

2016· article· en· W2471662310 on OpenAlexaff
Elham Nosrati, Xianbin Wang, Arash Khabbazibasmenj, Auon Muhammad Akhtar

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicWireless Communication Security Techniques
Canadian institutionsWestern University
Fundersnot available
KeywordsSecrecyComputer scienceArtificial noiseChannel state informationTransmitterHop (telecommunications)Computer networkTransmitter power outputWirelessInterference (communication)RelayPower (physics)Channel (broadcasting)TelecommunicationsComputer security

Abstract

fetched live from OpenAlex

This paper proposes using cooperative relays to improve the ergodic secrecy capacity (ESC) of a multi-hop decode-and-forward (DF) relaying system where communication takes place in the presence of multiple non-colluding eavesdroppers. The proposed scheme is based on a recent approach to generate artificial noise in which transmitter of each hop allocates a portion of its power for generating an intentional interference at the eavesdroppers. Under the assumption that the transmitters can only use limited transmit power, a power allocation strategy has been developed which maximizes the secrecy capacity by optimally distributing the power between the original signal and the artificial noise. Since the optimal solution depends on the channel state information (CSI) of the eavesdroppers, which is difficult to obtain in practice, a sub-optimal solution is also presented in which the CSI of the eavesdroppers is not needed.

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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.937
Threshold uncertainty score0.398

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.026
GPT teacher head0.267
Teacher spread0.242 · 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 designBench or experimental
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

Citations3
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicWireless Communication Security TechniquesFrench-language works237,207