Robustness against Byzantine Failures in Distributed Spectrum Sensing

  • Authors:
  • Ruiliang Chen;Jung-Min Jerry Park;Kaigui Bian

  • Affiliations:
  • The Bradley Department of Electrical and Computer Engineering, Virginia Tech, Blacksburg, VA 24061, United States;The Bradley Department of Electrical and Computer Engineering, Virginia Tech, Blacksburg, VA 24061, United States;Institute of Network Computing and Information Systems (NCIS), School of EECS, Peking University, Beijing 100871, China

  • Venue:
  • Computer Communications
  • Year:
  • 2012

Quantified Score

Hi-index 0.24

Visualization

Abstract

Distributed Spectrum Sensing (DSS) enables a Cognitive Radio (CR) network to reliably detect licensed users and avoid causing interference to licensed communications. The data fusion technique is a key component of DSS. We discuss the Byzantine Failure problem in the context of data fusion, which may be caused by either malfunctioning sensing terminals or Spectrum Sensing Data Falsification (SSDF) attacks. In either case, incorrect spectrum sensing data is reported to a data collector which can lead to the distortion of data fusion outputs. We investigate various data fusion techniques, focusing on their robustness against Byzantine Failures. In contrast to existing data fusion techniques that use a fixed number of samples, we propose a new technique that uses a variable number of samples. The proposed technique, which we call Weighted Sequential Probability Ratio Test (WSPRT), introduces a reputation-based mechanism to the Sequential Probability Ratio Test (SPRT). We evaluate WSPRT by comparing it with a variety of data fusion techniques under various conditions. We also discuss practical issues that need to be considered when applying the fusion techniques to CR networks. Our simulation results indicate that WSPRT is the most robust against Byzantine Failures among the data fusion techniques that were considered.