By Topic

Throughput and proportional fairness 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
$31 $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

4 Author(s)
Ahmed, W. ; Centre for Telecommun. & Microelectron. (TE), Victoria Univ., Melbourne, VIC, Australia ; Gao, J. ; Hong Zhou ; Faulkner, M.

In this paper, we investigate the aggregate throughput and proportional fairness of two independent secondary user (SU) groups in a cognitive radio (CR) network. Using a continuous time Markov chain, the expression for the aggregate throughput as a function of traffic intensity, forced termination and blocking probabilities is derived. Furthermore, throughput loss of the individual SU groups is analyzed in terms of proportional fairness. The results show that as the difference between the service rates increases the fairness deviates from its ideal value and this unfairness cannot be countered by changing the arrival/access rate of SUs. For the fixed arrival rate of SU groups there exists an optimal service rate pair which maximize the aggregate throughput.

Published in:

Advanced Technologies for Communications, 2009. ATC '09. International Conference on

Date of Conference:

12-14 Oct. 2009