Double Threshold Detection

The core innovation of double threshold detection is the creation of an uncertainty zone between a lower threshold (λ₁) and an upper threshold (λ₂). When a sensing node's computed test statistic falls within this region, the local observation is considered unreliable. Instead of forcing a binary hard decision that is likely to be erroneous, the node intelligently abstains from reporting to the fusion center. This censoring mechanism prevents the propagation of low-confidence information that would degrade the global decision quality.

The two thresholds are derived from the target probabilities of false alarm (P_f) and detection (P_d) under the Neyman-Pearson criterion. Typically, λ₁ is set to achieve a desired low P_f, while λ₂ is set to achieve a desired high P_d. The gap between them defines the trade-off:

• Narrow gap: Fewer nodes abstain, but more errors are reported.
• Wide gap: More nodes abstain, reducing overhead but potentially starving the fusion center of data. Optimal threshold placement often uses Constant False Alarm Rate (CFAR) principles to adapt to noise uncertainty.

The primary benefit is a significant reduction in reporting channel overhead. By censoring unreliable reports, the network conserves bandwidth and energy, which is critical for resource-constrained cognitive radio nodes. However, this creates a fundamental trade-off:

• Reduced overhead: Fewer transmissions mean less interference and lower power consumption.
• Censoring penalty: If too many nodes abstain, the fusion center may lack sufficient data to make a reliable global decision, especially in deep fading scenarios. The sensing-throughput tradeoff is directly impacted by the width of the no-decision region.

At the fusion center, only the reports from nodes that made a definitive decision are combined. This requires a modified fusion rule that accounts for the variable number of reporting nodes. Common approaches include:

• Modified K-out-of-N rule: The 'N' is dynamically reduced to the number of reporting nodes, and the 'K' threshold is scaled accordingly.
• Weighted combining: Reports can be weighted by the confidence level associated with the threshold they exceeded.
• Sequential detection: The fusion center can request additional sensing rounds if the number of abstentions is too high.

A key motivation for double threshold detection is its improved robustness against noise uncertainty, which creates an SNR wall for conventional single-threshold energy detection. By refusing to make decisions when the test statistic is close to the noise floor, the method avoids the high-error region where small noise power estimation errors cause catastrophic misclassifications. This makes it particularly effective in low-SNR environments where the primary user signal is weak and noise power is difficult to estimate precisely.

In a cooperative spectrum sensing (CSS) network, double threshold detection is implemented at each sensing node before reporting to the fusion center. The architecture creates a two-stage filtering process:

• Local stage: Each node applies the double threshold to its own energy measurement, making a local decision of 'occupied', 'vacant', or 'no decision'.
• Global stage: The fusion center applies a fusion rule only to the definitive local decisions, ignoring abstentions. This hierarchical approach is particularly effective against Spectrum Sensing Data Falsification (SSDF) attacks, as malicious nodes that abstain cannot inject false data.