Cooperative Spectrum Sensing in Cognitive Radios With Incomplete Likelihood Functions
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.
Bibliographic record
Abstract
This paper investigates the problem of cooperative spectrum sensing in cognitive radios with unknown parameters in the likelihood function. We first derive the optimal likelihood ratio test (LRT) statistic based on the Neyman-Pearson (NP) criterion at the fusion center for hard (one-bit), soft (infinite precision) and quantized (multi-bit) local decisions. This NP-based LRT detector is feasible only if primary signal statistics and channel parameters are known. This assumption may not be realistic in cognitive radio systems. Thus, we propose a linear composite hypothesis testing approach which estimates the unknown parameters, and further simplify it so that it does not even require these estimates. Under the scenarios of: i) unknown primary signal and channel statistics; and ii) unknown primary signal statistics but known channel statistics, we apply the proposed test and also, for case ii), derive the locally most powerful (LMP) detector for weak signals. For performance analysis and threshold setting, we derive the distributions of the linear test and LMP statistics under the signal-absent hypothesis. Our simulation results show that the linear test performs very closely to the optimal LRT while not requiring the primary statistics. As a result, this method enhances robustness in cooperative spectrum sensing to uncertainties in channel gains and signal statistics.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it