Evaluation of security algorithms that combat Byzantine failures in Cognitive Radio Networks

  • Authors:

  • Yi Zhang;Ramachandran Venkatesan

  • Affiliations:

  • Memorial University of Newfoundland, St. John's, NL, Canada;Memorial University of Newfoundland, St. John's, NL, Canada

  • Venue:
  • Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Distributed Cognitive Radio Network (CRN) topology is described in IEEE 802.22 standard which is the first worldwide standard operating in TV bandwidth of wireless regional area. Spectrum sensing is conducted at distributed customer premise equipment (CPE). Cooperative sensing between CPEs is widely used to obtain more accurate spectrum sensing results. However, Byzantine failures can happen when some CPEs are attacked inside the CRN. A robust Byzantine security model can be built on MAC layer of base station (BS) by using published data fusion algorithm -Weighted Sequential Probability Ratio Test (WSPRT) to assist making a decision as to whether a licensed channel is occupied by other primary users or not. In this paper different sets of simulations are run for evaluating the performance of the WSPRT algorithm in terms of correct sensing rate, miss detection rate and number of samples comparing with other three algorithms for binary hypothesis test, namely, "And", "Or" and "Majority". Simulation results also show the different performance metrics under two types of attack patterns. From the results of simulations WSPRT is shown to have better performance than the other three algorithms.