MétaCan
Menu
Back to cohort
Record W1990255151 · doi:10.1109/istel.2012.6482993

A novel method for energy-efficient cooperative spectrum sensing in cognitive sensor networks

2012· article· en· W1990255151 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
FieldComputer Science
TopicDistributed Sensor Networks and Detection Algorithms
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsCognitive radioComputer scienceWireless sensor networkFalse alarmDetectorEnergy consumptionEnergy (signal processing)Constraint (computer-aided design)Convex optimizationWirelessOptimization problemComputational complexity theoryReal-time computingMathematical optimizationAlgorithmRegular polygonArtificial intelligenceComputer networkTelecommunicationsMathematicsEngineeringElectrical engineering

Abstract

fetched live from OpenAlex

In this paper, we propose an energy-efficient technique for cooperative spectrum sensing in cognitive sensor networks. In cooperative spectrum sensing, information is collected from different sensors to make a final decision. We use an "on/off" method for cognitive wireless sensor networks and also formulate the determination of the number of sensing nodes, such that energy consumption in spectrum sensing reduces and satisfies the constraint on the detection performance. The constraint on the detection performance is given by a minimum global probability of detection and a maximum global probability of false alarm. We use the energy detector as the spectrum sensing technique and solve the problem using the convex optimization methods while consider the computational complexity. Simulation results show that our proposed technique saves significant energy in different conditions.

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.001
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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.512
Threshold uncertainty score0.766

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
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.025
GPT teacher head0.284
Teacher spread0.259 · 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