MétaCan
Menu
Back to cohort
Record W2027074016 · doi:10.1109/wcnc.2013.6554818

Cooperative networking towards secure communications for CRNs

2013· article· en· W2027074016 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicWireless Communication Security Techniques
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsRelaySecrecyComputer scienceComputer networkBeamformingJammingTransmission (telecommunications)Cognitive radioScheme (mathematics)Secure transmissionPower (physics)TelecommunicationsWirelessComputer security

Abstract

fetched live from OpenAlex

In this paper, we investigate cooperative networking in cognitive radio networks (CRNs), which targets to help the primary users (PUs) for secure communications and provide transmission opportunities to secondary users (SUs). Two cooperation schemes: relay-jammer (R-J) scheme and cluster-beamforming (C-B) scheme, are proposed. In R-J cooperation scheme, two individual SUs, a relay and a friendly jammer, are leveraged by the PU to improve communication secrecy via cooperation; In return, the PU allocates a fraction of access time for SUs' transmission. To achieve the maximum secrecy rate, joint time and power allocation is considered. In C-B cooperation scheme, the PU cooperates with a cluster of SUs, which enhance the secrecy of primary link via collaborative beamforming and gain spectrum access opportunities as a reward. With the objective of maximizing the secrecy rate, the optimal weights and time allocation are studied. Numerical results validate the proposed schemes and demonstrate that the PU can significantly enhances the secrecy through cooperation with the cooperating SUs by allocating time and transmission power optimally.

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.

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

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.0010.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.031
GPT teacher head0.275
Teacher spread0.243 · 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