By Topic

Markov-Based Optimal Access Probability for Dynamic Spectrum Access in Cognitive Radio Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yanjun Yao ; Key Lab. of Universal Wireless Commun., Beijing Univ. of Posts & Telecommun., Beijing, China ; Zhiyong Feng ; Dan Miao

Dynamic spectrum access has become a promising approach to fully utilize the scarce spectrum resources. In this paper, two new dynamic spectrum access schemes for secondary users are proposed, which are based on continuous-time Markov chains (CTMC). Both the interactions between primary and secondary users and the effects of imperfect spectrum sensing(i.e. miss-detection and false alarm) are considered in the schemes. Due to the fact that miss-detection would lead to collision between primary and secondary users, we derive the optimal access probabilities for secondary users, so that the QoS of primary users in terms of collision probability is guaranteed. Simulation results show that the proposed dynamic spectrum access approach under proportional fairness criterion achieves much higher fairness over max-throughput criterion. Moreover, the scheme with buffering mechanism can raise the channel occupancy remarkably.

Published in:

Vehicular Technology Conference (VTC 2010-Spring), 2010 IEEE 71st

Date of Conference:

16-19 May 2010