By Topic

Detecting and Counteracting Statistical Attacks in Cooperative Spectrum Sensing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)

In this paper we propose a novel Bayesian method to improve the robustness of cooperative spectrum sensing against misbehaving secondary users, which may send wrong sensing reports in order to artificially increase or reduce the throughput of a cognitive network. We adopt a statistical attack model in which every malicious node is characterized by a certain probability of attack. The key features of the proposed method are: (i) combined spectrum sensing, identification of malicious users, and estimation of their attack probabilities; (ii) use of belief propagation on factor graphs to efficiently solve the Bayesian estimation problem. Our analysis shows that the proposed joint estimation approach outperforms traditional cooperation schemes based on exclusion of the unreliable nodes from the spectrum sensing process, and that it nearly achieves the performance of an ideal maximum likelihood estimation if attack probabilities remain constant over a sufficient number of sensing time slots. Results illustrate that belief propagation applied to the considered problem is robust with respect to different network parameters (e.g., numbers of reliable and malicious nodes, attack probability values, sensing duration). Finally, spectrum sensing estimates obtained via belief propagation are proved to be consistent on average for arbitrary graph size.

Published in:

Signal Processing, IEEE Transactions on  (Volume:60 ,  Issue: 4 )