MétaCan
Menu
Back to cohort
Record W1988369819 · doi:10.1109/tvt.2011.2177871

Cooperative Sensing With Correlated Local Decisions in Cognitive Radio Networks

2011· article· en· W1988369819 on OpenAlexaff
Lamiaa Khalid, Alagan Anpalagan

Bibliographic record

VenueIEEE Transactions on Vehicular Technology · 2011
Typearticle
Languageen
FieldComputer Science
TopicDistributed Sensor Networks and Detection Algorithms
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsCognitive radioFusion centerConstraint (computer-aided design)False alarmInteger (computer science)Value (mathematics)MinificationCorrelationNonlinear systemExpected valueMathematicsComputer scienceMathematical optimizationAlgorithmArtificial intelligenceStatistics

Abstract

fetched live from OpenAlex

In this paper, we analyze the impact of correlated secondary users' local decisions on the performance of cooperative spectrum-sensing schemes when the counting rule is employed at the fusion center. We employ a correlation model that is indexed by a single parameter ρ. We derive the system probabilities of detection and false alarm for theK-out-of-Mcounting rule when the secondary users' local decisions are correlated under both hypothesis. Our performance evaluations are based on two performance criteria, which are the Neyman-Pearson (NP) criterion and the minimization of the sensing errors. Our results show that, for each value of the correlation index, there exists an optimal value ofKthat satisfies each criterion. We use genetic algorithm to find the optimal setting that minimizes the total probability of sensing error since the optimization problem under the correlation model used in our analysis is a mixed integer nonlinear problem with nonlinear constraint.

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.013
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.023

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.013
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.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.016
GPT teacher head0.221
Teacher spread0.205 · 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

Citations28
Published2011
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Vehicular TechnologySame topicDistributed Sensor Networks and Detection AlgorithmsFrench-language works237,207