22,643 research outputs found
Joint Cooperative Spectrum Sensing and MAC Protocol Design for Multi-channel Cognitive Radio Networks
In this paper, we propose a semi-distributed cooperative spectrum sen sing
(SDCSS) and channel access framework for multi-channel cognitive radio networks
(CRNs). In particular, we c onsider a SDCSS scheme where secondary users (SUs)
perform sensing and exchange sensing outcomes with ea ch other to locate
spectrum holes. In addition, we devise the p -persistent CSMA-based cognitive
MAC protocol integrating the SDCSS to enable efficient spectrum sharing among
SUs. We then perform throughput analysis and develop an algorithm to determine
the spectrum sensing and access parameters to maximize the throughput for a
given allocation of channel sensing sets. Moreover, we consider the spectrum
sensing set optimization problem for SUs to maxim ize the overall system
throughput. We present both exhaustive search and low-complexity greedy
algorithms to determine the sensing sets for SUs and analyze their complexity.
We also show how our design and analysis can be extended to consider reporting
errors. Finally, extensive numerical results are presented to demonstrate the
sig nificant performance gain of our optimized design framework with respect to
non-optimized designs as well as the imp acts of different protocol parameters
on the throughput performance.Comment: accepted for publication EURASIP Journal on Wireless Communications
and Networking, 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
General analytical framework for cooperative sensing and access trade-off optimization
In this paper, we investigate the joint cooperative spectrum sensing and
access design problem for multi-channel cognitive radio networks. A general
heterogeneous setting is considered where the probabilities that different
channels are available, SNRs of the signals received at secondary users (SUs)
due to transmissions from primary users (PUs) for different users and channels
can be different. We assume a cooperative sensing strategy with a general
a-out-of-b aggregation rule and design a synchronized MAC protocol so that SUs
can exploit available channels. We analyze the sensing performance and the
throughput achieved by the joint sensing and access design. Based on this
analysis, we develop algorithms to find optimal parameters for the sensing and
access protocols and to determine channel assignment for SUs to maximize the
system throughput. Finally, numerical results are presented to verify the
effectiveness of our design and demonstrate the relative performance of our
proposed algorithms and the optimal ones.Comment: arXiv admin note: text overlap with arXiv:1404.167
- …