Threshold optimization of a finite sample-based cognitive radio network using energy detector
Bibliographic record
Abstract
Abstract In this paper, we consider a cognitive radio network containing two cognitive radios (CRs) and one primary user. The CRs utilize finite number of received data samples for estimating the energy of the primary signals and forward these energy estimates to a fusion center (FC). The FC combines the energy estimates and utilizes a global threshold based on the exact knowledge of local thresholds of the CRs for determining the presence or absence of the primary signal. We propose selective and semi-selective soft combining schemes for this set-up. For the proposed schemes, we derive the total probability of error of detecting a spectrum hole. By minimizing the total probability of error in sensing a spectrum hole, we find optimized local and global thresholds. Moreover, we also discuss the optimization of conventional non-selective soft and 1-bit hard combining schemes with multiple (equal to or more than two) collaborative CRs under the total probability of error minimization criterion. It is shown by simulations that the proposed selective soft combination-based scheme significantly outperforms the conventional non-selective schemes based on soft combination and 1-bit hard combination. Further, it is shown by simulation that the proposed selective soft combining scheme along with the total probability of error minimization criterion is able to properly utilize a spectrum hole with interference level less than the standard specified value.
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.002 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".