5,633 research outputs found
A Novel Algorithm for Cooperative Distributed Sequential Spectrum Sensing in Cognitive Radio
This paper considers cooperative spectrum sensing in Cognitive Radios. In our
previous work we have developed DualSPRT, a distributed algorithm for
cooperative spectrum sensing using Sequential Probability Ratio Test (SPRT) at
the Cognitive Radios as well as at the fusion center. This algorithm works
well, but is not optimal. In this paper we propose an improved algorithm-
SPRT-CSPRT, which is motivated from Cumulative Sum Procedures (CUSUM). We
analyse it theoretically. We also modify this algorithm to handle uncertainties
in SNR's and fading.Comment: This paper has been withdrawn by the author due to the submission of
detailed journal version of the same paper, to arXi
Multiband Spectrum Access: Great Promises for Future Cognitive Radio Networks
Cognitive radio has been widely considered as one of the prominent solutions
to tackle the spectrum scarcity. While the majority of existing research has
focused on single-band cognitive radio, multiband cognitive radio represents
great promises towards implementing efficient cognitive networks compared to
single-based networks. Multiband cognitive radio networks (MB-CRNs) are
expected to significantly enhance the network's throughput and provide better
channel maintenance by reducing handoff frequency. Nevertheless, the wideband
front-end and the multiband spectrum access impose a number of challenges yet
to overcome. This paper provides an in-depth analysis on the recent
advancements in multiband spectrum sensing techniques, their limitations, and
possible future directions to improve them. We study cooperative communications
for MB-CRNs to tackle a fundamental limit on diversity and sampling. We also
investigate several limits and tradeoffs of various design parameters for
MB-CRNs. In addition, we explore the key MB-CRNs performance metrics that
differ from the conventional metrics used for single-band based networks.Comment: 22 pages, 13 figures; published in the Proceedings of the IEEE
Journal, Special Issue on Future Radio Spectrum Access, March 201
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
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
- …