Finding Optimal Action Point for Multi-Stage Spectrum Access in Cognitive Radio Networks

A critical challenge in Cognitive Radio Networks (CRN) is to make decision in real-time on accessing and releasing available channels that maximize the spectrum utilization and the overall system throughput. In this work, we make investigations on optimal action point to explore and exploit the frequency-temporal diversity in addition to spectrum availability. By modeling the Rayleigh fading channel under primary user (PU) activity to be a finite state Markov channel (FSMC) with an absorbing state, we formulate this difficulty into a 2-Dimension optimal stopping problem. Further, we've proved that, the complexity of the 2D optimal stopping rule can be reduced to one threshold policy, where the optimal character still holds. After properly constructing multi-absorbing-states Markov chain for dynamic analysis, we get the throughput of our strategy accurately. Numerical and simulations results have verified that, our threshold based access/switch strategy gains much more throughput than conventional idle/busy based access/switch strategy at the cost of access delay in most cases.

[1]  Zhi Ding,et al.  Optimal Sensing-Transmission Structure for Dynamic Spectrum Access , 2009, IEEE INFOCOM 2009.

[2]  Charles M. Grinstead,et al.  Introduction to probability , 1999, Statistics for the Behavioural Sciences.

[3]  John N. Tsitsiklis,et al.  Introduction to Probability , 2002 .

[4]  Saleem A. Kassam,et al.  Finite-state Markov model for Rayleigh fading channels , 1999, IEEE Trans. Commun..

[5]  Mingyan Liu,et al.  Mining Spectrum Usage Data: A Large-Scale Spectrum Measurement Study , 2009, IEEE Transactions on Mobile Computing.

[6]  K. J. Ray Liu,et al.  Jointly optimized bit-rate/delay control policy for wireless packet networks with fading channels , 2002, IEEE Trans. Commun..

[7]  Mingyan Liu,et al.  Optimal Channel Probing and Transmission Scheduling for Opportunistic Spectrum Access , 2007, IEEE/ACM Transactions on Networking.

[8]  Marwan Krunz,et al.  Throughput-efficient sequential channel sensing and probing in cognitive radio networks under sensing errors , 2009, MobiCom '09.

[9]  Ananthram Swami,et al.  Distributed Algorithms for Learning and Cognitive Medium Access with Logarithmic Regret , 2010, IEEE Journal on Selected Areas in Communications.

[10]  Qing Zhao,et al.  Decentralized multi-armed bandit with multiple distributed players , 2010, 2010 Information Theory and Applications Workshop (ITA).

[11]  A. Cox Optimal Stopping and Applications , 2009 .

[12]  Yi Gai,et al.  Learning Multiuser Channel Allocations in Cognitive Radio Networks: A Combinatorial Multi-Armed Bandit Formulation , 2010, 2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN).