By Topic

Spectral Efficiency and Fairness for Opportunistic Round Robin Scheduling

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

3 Author(s)
Hassel, V. ; Norwegian University of Science and Technology, Dept. of Electronics and Telecommunications, 7491 Trondheim, Norway, email: ; Hanssen, M.R. ; Oien, G.E.

In this paper we analyze the Opportunistic Round Robin (ORR) scheduling algorithm [1], [2]. This algorithm is able to exploit multiuser diversity (MUD) and at the same time provide short-term fairness between the users in a wireless cellular network. We analyze the spectral efficiency and the fairness for two scenarios. In the first scenario all the users have the same average carrier-to-noise ratios (CNR) and for the second scenario the users have different average CNRs. For the first scenario the absolute MUD is exploited while we exploit the so-called relative MUD between the users for the second scenario. The advantages and disadvantages of the different ORR implementations are highlighted by analyzing plots of our closed-form expressions.

Published in:

Communications, 2006. ICC '06. IEEE International Conference on  (Volume:2 )

Date of Conference:

June 2006