This paper considers cooperative spectrum sensing algorithms for Cognitive Radios which focus on reducing the number of samples to make a reliable detection. We propose algorithms based on decentralized sequential hypothesis testing in which the Cognitive Radios sequentially collect the observations, make local decisions and send them to the fusion center for further processing to make a final decision on spectrum usage. The reporting channel between the Cognitive Radios and the fusion center is assumed more realistically as a Multiple Access Channel (MAC) with receiver noise. Furthermore the communication for reporting is limited, thereby reducing the communication cost. We start with an algorithm where the fusion center uses an SPRT-like (Sequential Probability Ratio Test) procedure and theoretically analyze its performance. Asymptotically, its performance is close to the optimal centralized test without fusion center noise. We further modify this algorithm to improve its performance at practical operating points. Later we generalize these algorithms to handle uncertainties in SNR and fading. HighlightsSpectrum sensing as decentralized sequential hypothesis testing problem.Close to optimal solution taking into account Multiple Access Channel for reporting and noise at the fusion center.Theoretical analysis of decentralized sequential algorithms.SNR uncertainties in primary user tackled using decentralized-composite sequential hypothesis testing solution.
['Jithin Kazuthuveettil Sreedharan', 'Vinod Sharma']
Spectrum sensing using distributed sequential detection via noisy reporting MAC