Spectral Efficiency and Fairness for Opportunistic Round Robin Scheduling

Hassel, Vegard; Hanssen, Marius Roed; Oien, G.E.

doi:10.1109/icc.2006.254803

Cited by 27 publications

(22 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…JFI is bounded between zero and one, where zero means total unfairness and one means total fairness. It should be noted that total unfairness will occur when we have an infinite number of user and one user dominates over all the resources [77].…”

Section: Time Slot Fairnessmentioning

confidence: 99%

“…The time slots are assigned opportunistically such that the users will be assigned the time slots that maximizes the total throughput within a frame [77]. The ORR algorithm works as follows.…”

Section: Opportunistic Round Robin (Orr)mentioning

confidence: 99%

“…In the first time slot the scheduler selects the best user according to some scheduling criterion, after that this user will be excluded from the competition of the coming time slots, and the the process is repeated until the frame is finished and all the time slots have been assigned to users ranging from the best user to the worst one. This algorithm captures part of the available multiuser diversity [16], and provides the highest short term fairness when the number of time slots allocated in frames is equal to the number of users J [77].…”

Section: Opportunistic Round Robin (Orr)mentioning

confidence: 99%

See 2 more Smart Citations

Performance of Layered Steered Space–Time Codes in Wireless Systems

Salim

Zummo

Al-Ghadhban

2013

Wireless Pers Commun

View full text Add to dashboard Cite

Section: Time Slot Fairnessmentioning

confidence: 99%

Section: Opportunistic Round Robin (Orr)mentioning

confidence: 99%

Section: Opportunistic Round Robin (Orr)mentioning

confidence: 99%

See 1 more Smart Citation

Performance of Layered Steered Space–Time Codes in Wireless Systems

Salim

Zummo

Al-Ghadhban

2013

Wireless Pers Commun

View full text Add to dashboard Cite

“…A common approach to obtain higher QoS in the network is to have a fairer resource allocation among the users [4,5]. One widely adopted fair scheduling policy is the Proportional Fair Scheduling (PFS) algorithm [6].…”

Section: Introductionmentioning

confidence: 99%

Opportunistic scheduling policies for improved throughput guarantees in wireless networks

Rasool

Hassel

Ryhove

et al. 2011

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

Offering throughput guarantees for cellular wireless networks, carrying real-time traffic, is of interest to both the network operators and the customers. In this article, we formulate an optimization problem which aims at maximizing the throughput that can be guaranteed to the mobile users. By building on results obtained by Borst and Whiting and by assuming that the distributions of the users' carrier-to-noise ratios are known, we find the solution to this problem for users with different channel quality distributions, for both the scenario where all the users have the same throughput guarantees, and the scenario where all the users have different throughput guarantees. Based on these solutions, we also propose two simple and low complexity adaptive scheduling algorithms that perform significantly better than other well-known scheduling algorithms. We further develop an expression for the approximate throughput guarantee violation probability for users in time-slotted networks with the given cumulants of the distribution of bit-rate in a time-slot, and a given distribution for the number of timeslots allocated within a time-window.

show abstract

“…Therefore, it is of great importance to incorporate different schedulers into the analysis and do so in a unified manner that enables them to be compared. While an opportunistic RR scheduler [11], and a proportional fair scheduler [12], [13], [14], which achieves a balance between fairness and system throughput, have been analyzed, this has been done only for a single-cell system with Rayleigh fading and no CCI [11], [13], [14]. While [15] did consider the effect of multi-tier interference and different schedulers, its analysis assumes that the throughput directly equals the signal to interference ratio (SIR) at the receiver; this makes its results applicable only to systems in which the SIR at each mobile station is very small.…”

mentioning

confidence: 99%

Unified Spectral Efficiency Analysis of Cellular Systems with Channel-Aware Schedulers

Mehta

Molisch

et al. 2011

IEEE Trans. Commun.

View full text Add to dashboard Cite

Spectral efficiency is a key characteristic of cellular communications systems, as it quantifies how well the scarce spectrum resource is utilized. It is influenced by the scheduling algorithm as well as the signal and interference statistics, which in turn depend on the propagation characteristics. In this paper we derive analytical expressions for the short-term and long-term channel-averaged spectral efficiencies of the round robin, greedy Max-SINR, and proportional fair schedulers, which are popular and cover a wide range of system performance and fairness trade-offs. A unified spectral efficiency analysis is developed to highlight the differences among these schedulers. Unlike previous work in the literature, the analysis is notably different in the following aspects: (i) it does not assume the co-channel interferer to be identically distributed, as is typical in realistic cellular layouts, (ii) it avoids the loose spectral efficiency bounds used in the literature, which only considered the worst case and best case locations of identical co-channel interferer, (iii) it explicitly includes the effect of multi-tier interferer in the cellular layout and uses a more accurate model for handling the total co-channel interference, and (iv) it captures the impact of using small modulation constellation sizes, which are typical of second and third-generation cellular standards. The analytical results are verified using extensive Monte Carlo simulations. IEEE Transactions on CommunicationsThis work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or in part without payment of fee is granted for nonprofit educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of Mitsubishi Electric Research Laboratories, Inc.; an acknowledgment of the authors and individual contributions to the work; and all applicable portions of the copyright notice. Copying, reproduction, or republishing for any other purpose shall require a license with payment of fee to Mitsubishi Electric Research Laboratories, Inc. All rights reserved. Abstract-Spectral efficiency is a key characteristic of cellular communications systems, as it quantifies how well the scarce spectrum resource is utilized. It is influenced by the scheduling algorithm as well as the signal and interference statistics, which in turn depend on the propagation characteristics. In this paper we derive analytical expressions for the short-term and long-term channel-averaged spectral efficiencies of the round robin, greedy Max-SINR, and proportional fair schedulers, which are popular and cover a wide range of system performance and fairness trade-offs. A unified spectral efficiency analysis is developed to highlight the differences among these schedulers. Unlike previous work in the literature, the analysis is notably different in the following aspects: (i) it does not assume the co-channel interferers to be identically distrib...

show abstract

Spectral Efficiency and Fairness for Opportunistic Round Robin Scheduling

Cited by 27 publications

References 11 publications

Performance of Layered Steered Space–Time Codes in Wireless Systems

Performance of Layered Steered Space–Time Codes in Wireless Systems

Opportunistic scheduling policies for improved throughput guarantees in wireless networks

Unified Spectral Efficiency Analysis of Cellular Systems with Channel-Aware Schedulers

Contact Info

Product

Resources

About