2,272 research outputs found
Trust-aware Consensus-inspired Distributed Cooperative Spectrum Sensing for Cognitive Radio Ad Hoc Networks
Cooperation among cognitive radios for spectrum sensing is deemed essential for environments with deep shadows. In this paper, we study cooperative spectrum sensing for cognitive radio ad hoc networks where there is no fusion center to aggregate the information from various secondary users. We propose a novel consensus-inspired cooperative sensing scheme based on linear iterations that is fully distributed and low-cost. In addition, the tradeoffs on the number of consensus iterations are explored for scenarios with different shadow fading characteristics. Furthermore, we model insistent spectrum sensing data falsification (ISSDF) attack aimed at consensus-based iterative schemes and show its destructive effect on the cooperation performance which accordingly results in reduced spectrum efficiency and increased interference with primary users. We propose a trust management scheme to mitigate these attacks and evaluate the performance improvement through extensive Monte Carlo simulations for large-scale cognitive radio ad hoc networks in TV white space. Our proposed trust management reduces the harm of a set of collusive ISSDF attackers up to two orders of magnitude in terms of missed-detection and false alarm error rates. Moreover, in a hostile environment, integration of trust management into cooperative schemes considerably relaxes the sensitivity requirements on the cognitive radio devices
A Context-aware Trust Framework for Resilient Distributed Cooperative Spectrum Sensing in Dynamic Settings
Cognitive radios enable dynamic spectrum access where secondary users (SUs) are allowed to operate on the licensed spectrum bands on an opportunistic noninterference basis. Cooperation among the SUs for spectrum sensing is essential for environments with deep shadows. In this paper, we study the adverse effect of insistent spectrum sensing data falsification (ISSDF) attack on iterative distributed cooperative spectrum sensing. We show that the existing trust management schemes are not adequate in mitigating ISSDF attacks in dynamic settings where the primary user (PU) of the band frequently transitions between active and inactive states. We propose a novel context-aware distributed trust framework for cooperative spectrum sensing in mobile cognitive radio ad hoc networks (CRAHN) that effectively alleviates different types of ISSDF attacks (Always-Yes, Always-No, and fabricating) in dynamic scenarios. In the proposed framework, the SU nodes evaluate the trustworthiness of one another based on the two possible contexts in which they make observations from each other: PU absent context and PU present context. We evaluate the proposed context-aware scheme and compare it against the existing context-oblivious trust schemes using theoretical analysis and extensive simulations of realistic scenarios of mobile CRAHNs operating in TV white space. We show that in the presence of a large set of attackers (as high as 60% of the network), the proposed context-aware trust scheme successfully mitigates the attacks and satisfy the false alarm and missed-detection rates of and lower. Moreover, we show that the proposed scheme is scalable in terms of attack severity, SU network density, and the distance of the SU network to the PU transmitter
Byzantine Attack and Defense in Cognitive Radio Networks: A Survey
The Byzantine attack in cooperative spectrum sensing (CSS), also known as the
spectrum sensing data falsification (SSDF) attack in the literature, is one of
the key adversaries to the success of cognitive radio networks (CRNs). In the
past couple of years, the research on the Byzantine attack and defense
strategies has gained worldwide increasing attention. In this paper, we provide
a comprehensive survey and tutorial on the recent advances in the Byzantine
attack and defense for CSS in CRNs. Specifically, we first briefly present the
preliminaries of CSS for general readers, including signal detection
techniques, hypothesis testing, and data fusion. Second, we analyze the spear
and shield relation between Byzantine attack and defense from three aspects:
the vulnerability of CSS to attack, the obstacles in CSS to defense, and the
games between attack and defense. Then, we propose a taxonomy of the existing
Byzantine attack behaviors and elaborate on the corresponding attack
parameters, which determine where, who, how, and when to launch attacks. Next,
from the perspectives of homogeneous or heterogeneous scenarios, we classify
the existing defense algorithms, and provide an in-depth tutorial on the
state-of-the-art Byzantine defense schemes, commonly known as robust or secure
CSS in the literature. Furthermore, we highlight the unsolved research
challenges and depict the future research directions.Comment: Accepted by IEEE Communications Surveys and Tutoiral
- …