MétaCan
Menu
Back to cohort
Record W2472984298 · doi:10.1109/lcomm.2016.2585126

Designing an Optimal Energy Efficient Cluster-Based Spectrum Sensing for Cognitive Radio Networks

2016· article· en· W2472984298 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

VenueIEEE Communications Letters · 2016
Typearticle
Languageen
FieldComputer Science
TopicCognitive Radio Networks and Spectrum Sensing
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsCognitive radioComputer scienceComputational complexity theoryTransmission (telecommunications)False alarmKey (lock)Data transmissionEnergy (signal processing)Efficient energy useAlgorithmMathematical optimizationReal-time computingWirelessComputer networkTelecommunicationsMathematicsEngineeringArtificial intelligence

Abstract

fetched live from OpenAlex

An approach for joint optimal design system parameters is considered for energy efficient cluster-based spectrum sensing in cognitive radio (CR) networks. The design problem is formulated and subjected to primary user protection constraints and spectrum utilization requirements. An iterative algorithm with low computational complexity is proposed to determine joint optimal sensing time, data transmission time, and the number of CR users that maximize energy efficiency of the system. The design criterion combines two design parameters, namely, sensing time and data transmission time, into one parameter in order to reduce the complexity. The key idea of the proposed algorithm is to employ the impact of transmission power variation on both the optimal sensing time and the corresponding probability of false alarm. The performance of the proposed algorithm is presented and evaluated through simulation results.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.794
Threshold uncertainty score1.000

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.000
Science and technology studies0.0010.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.025
GPT teacher head0.258
Teacher spread0.233 · 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