10,078 research outputs found
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
Coalition Formation Games for Collaborative Spectrum Sensing
Collaborative Spectrum Sensing (CSS) between secondary users (SUs) in
cognitive networks exhibits an inherent tradeoff between minimizing the
probability of missing the detection of the primary user (PU) and maintaining a
reasonable false alarm probability (e.g., for maintaining a good spectrum
utilization). In this paper, we study the impact of this tradeoff on the
network structure and the cooperative incentives of the SUs that seek to
cooperate for improving their detection performance. We model the CSS problem
as a non-transferable coalitional game, and we propose distributed algorithms
for coalition formation. First, we construct a distributed coalition formation
(CF) algorithm that allows the SUs to self-organize into disjoint coalitions
while accounting for the CSS tradeoff. Then, the CF algorithm is complemented
with a coalitional voting game for enabling distributed coalition formation
with detection probability guarantees (CF-PD) when required by the PU. The
CF-PD algorithm allows the SUs to form minimal winning coalitions (MWCs), i.e.,
coalitions that achieve the target detection probability with minimal costs.
For both algorithms, we study and prove various properties pertaining to
network structure, adaptation to mobility and stability. Simulation results
show that CF reduces the average probability of miss per SU up to 88.45%
relative to the non-cooperative case, while maintaining a desired false alarm.
For CF-PD, the results show that up to 87.25% of the SUs achieve the required
detection probability through MWCComment: IEEE Transactions on Vehicular Technology, to appea
Coalitional Games for Distributed Collaborative Spectrum Sensing in Cognitive Radio Networks
Collaborative spectrum sensing among secondary users (SUs) in cognitive
networks is shown to yield a significant performance improvement. However,
there exists an inherent trade off between the gains in terms of probability of
detection of the primary user (PU) and the costs in terms of false alarm
probability. In this paper, we study the impact of this trade off on the
topology and the dynamics of a network of SUs seeking to reduce the
interference on the PU through collaborative sensing. Moreover, while existing
literature mainly focused on centralized solutions for collaborative sensing,
we propose distributed collaboration strategies through game theory. We model
the problem as a non-transferable coalitional game, and propose a distributed
algorithm for coalition formation through simple merge and split rules. Through
the proposed algorithm, SUs can autonomously collaborate and self-organize into
disjoint independent coalitions, while maximizing their detection probability
taking into account the cooperation costs (in terms of false alarm). We study
the stability of the resulting network structure, and show that a maximum
number of SUs per formed coalition exists for the proposed utility model.
Simulation results show that the proposed algorithm allows a reduction of up to
86.6% of the average missing probability per SU (probability of missing the
detection of the PU) relative to the non-cooperative case, while maintaining a
certain false alarm level. In addition, through simulations, we compare the
performance of the proposed distributed solution with respect to an optimal
centralized solution that minimizes the average missing probability per SU.
Finally, the results also show how the proposed algorithm autonomously adapts
the network topology to environmental changes such as mobility.Comment: in proceedings of IEEE INFOCOM 200
Spectrum sharing security and attacks in CRNs: a review
Cognitive Radio plays a major part in communication technology by resolving the shortage of the spectrum through usage of dynamic spectrum access and artificial intelligence characteristics. The element of spectrum sharing in cognitive radio is a fundament al approach in utilising free channels. Cooperatively communicating cognitive radio devices use the common control channel of the cognitive radio medium access control to achieve spectrum sharing. Thus, the common control channel and consequently spectrum sharing security are vital to ensuring security in the subsequent data communication among cognitive radio nodes. In addition to well known security problems in wireless networks, cognitive radio networks introduce new classes of security threats and challenges, such as licensed user emulation attacks in spectrum sensing and misbehaviours in the common control channel transactions, which degrade the overall network operation and performance. This review paper briefly presents the known threats and attacks in wireless networks before it looks into the concept of cognitive radio and its main functionality. The paper then mainly focuses on spectrum sharing security and its related challenges. Since spectrum sharing is enabled through usage of
the common control channel, more attention is paid to the
security of the common control channel by looking into its
security threats as well as protection and detection mechanisms. Finally, the pros and cons as well as the comparisons of different CR - specific security mechanisms are presented with some open research issues and challenges
- …