Primary-prioritized Markov approach for dynamic spectrum allocation

  • Authors:

  • Beibei Wang;Zhu Ji;K. J. Ray Liu;T. Charles Clancy

  • Affiliations:

  • Department of Electrical and Computer Engineering, and Institute for Systems Research, University of Maryland, College Park, MD;Qualcomm, San Diego, CA;Department of Electrical and Computer Engineering, and Institute for Systems Research, University of Maryland, College Park, MD;Laboratory for Telecommunications Sciences, US Department of Defense, College Park, MD

  • Venue:
  • IEEE Transactions on Wireless Communications
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

Dynamic spectrum access has become a promising approach to fully utilize the scarce spectrum resources. In a dynamically changing spectrum environment, it is very important to consider the statistics of different users' spectrum access so as to achieve more efficient spectrum allocation. In this paper, we propose a primary-prioritized Markov approach for dynamic spectrum access through modeling the interactions between the primary and the secondary users as continuous-time Markov chains (CTMC). Based on the CTMC models, to compensate the throughput degradation due to the interference among secondary users, we derive the optimal access probabilities for the secondary users, by which the spectrum access of the secondary users is optimally coordinated, and the spectrum dynamics are clearly captured. Therefore, a good tradeoff can be achieved between the spectrum efficiency and fairness. The simulation results show that the proposed primary-prioritized dynamic spectrum access approach under proportional fairness criterion achieves much higher throughput than the CSMA-based random access approaches and the approach achieving max-min fairness. Moreover, it provides fair spectrum sharing among secondary users with only small performance degradation compared to the approach maximizing the overall average throughput.