MétaCan
Menu
Back to cohort
Record W2345860503 · doi:10.1109/lwc.2016.2561285

Secrecy Capacity Scaling With Untrustworthy Aggressive Relays Cooperating With a Wire-Tapper

2016· article· en· W2345860503 on OpenAlexaff
Michael Atallah, Georges Kaddoum

Bibliographic record

VenueIEEE Wireless Communications Letters · 2016
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversité du Québec à Montréal
Fundersnot available
KeywordsSecrecyBounded functionComputer networkScalingComputer scienceRelayBeamformingTrustworthinessTopology (electrical circuits)Value (mathematics)Computer securityTelecommunicationsMathematicsPower (physics)PhysicsCombinatorics

Abstract

fetched live from OpenAlex

In this letter, we investigate the performance of the secrecy capacity in an amplify-and-forward dual-hop network for both distributed beamforming (DBF) and opportunistic relaying (OR) techniques. We derive the capacity scaling for two sets; U untrustworthy aggressive relays cooperating together with a wire-tapper to intercept the message, and T trustworthy relays, for a large number of nodes. We prove that the capacity scaling in the DBF is bounded by a value depending on a ratio between the number of the trustworthy and the untrustworthy aggressive relays. Finally, we show that DBF is better than OR whose capacity scaling is proved to be upper-bounded by a value tending to zero when the untrustworthy relays are aggressive. Simulation results confirm our analytical derivations.

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 categoriesScience and technology studies
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.677
Threshold uncertainty score1.000

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.0010.001
Scholarly communication0.0000.001
Open science0.0040.001
Research integrity0.0000.001
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.032
GPT teacher head0.246
Teacher spread0.214 · 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.

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

Citations8
Published2016
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Wireless Communications LettersSame topicCooperative Communication and Network CodingFrench-language works237,207