Fundamental Limitations in Energy Detection for Spectrum Sensing
Bibliographic record
Abstract
A key enabler for Cognitive Radio (CR) is spectrum sensing, which is physically implemented by sensor and actuator networks typically using the popular energy detection method. The threshold of the binary hypothesis for energy detection is generally determined by using the principles of constant false alarm rate (CFAR) or constant detection rate (CDR). The CDR principle guarantees the CR primary users at a designated low level of interferences, which is nonetheless subject to low spectrum usability of secondary users in a given sensing latency. On the other hand, the CFAR principle ensures secondary users’ spectrum utilization at a designated high level, while may nonetheless lead to a high level of interference to the primary users. The paper introduces a novel framework of energy detection for CR spectrum sensing, aiming to initiate a graceful compromise between the two reported principles. The proposed framework takes advantage of the summation of the false alarm probability Pfa from CFAR and the missed detection probability (1−Pd) from CDR, which is further compared with a predetermined confidence level. Optimization presentations for the proposed framework to determine some key parameters are developed and analyzed. We identify two fundamental limitations that appear in spectrum sensing, which further define the relationship among the sample data size for detection, detection time, and signal-to-noise ratio (SNR). We claim that the proposed framework of energy detection yields merits in practical policymaking for detection time and design sample rate on specific channels to achieve better efficiency and less interferences.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.006 | 0.020 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.004 |
| Scholarly communication | 0.004 | 0.006 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.003 | 0.004 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".