New scheme of cooperative compressed spectrum sensing

This study addresses key challenges in sparse signal recovery and compressed spectrum sensing (CSS), focusing on low signal-to-noise ratios (SNR), and the computational complexity of cooperative systems. Motivated by the need for faster and more accurate recovery techniques, we first investigate and generalize the Reduced-Set Matching Pursuit (RMP) algorithm, which overcomes the speed and accuracy limitations of conventional greedy algorithms. Secondly, we propose a novel spatial averaging technique that enhances detection performance by exploiting data from multiple users to counteract low SNR. Lastly, we integrate cooperation into CSS, further improving the detection capabilities during the recovery process. Compared to existing techniques like Joint Sparse Recovery (JSR) and CoSaMP, which face computational and accuracy constraints in real-time applications, the RMP algorithm, combined with the Virtual method (data transformation) and AND fusion rule, delivers superior performance than JSR methods. Moreover, spatial averaging significantly increases the probability of cooperative detection Q(d), with SNR increasing linearly by a factor of L - 1 per channel. The results are validated through the implementation of SDR. These findings demonstrate the potential of RMP and cooperation to overcome current limitations in CSS, advancing the state-of-the-art in spectrum sensing for collaborative networks.