Publication Type

Journal Article

Version

acceptedVersion

Publication Date

2-2004

Abstract

In the last few years, wireless scheduling algorithms have been proposed by supplementing wireline scheduling algorithms with a wireless adaptation scheme. However, Quality of Service (QoS) bounds have either been derived for flows that perceive error-free conditions or a static worst-case channel condition. Such an assumption of the channel condition is unrealistic, since channel errors are known to be bursty in nature. Hence, these bounds are inadequate to characterize the scheduler's QoS performance. Our research focuses on performing an extensive analysis of wireless scheduling in order to derive statistical QoS performance bounds under realistic channel conditions. In this paper, we develop stochastic models for various wireless schedulers. Based on these models, we define and evaluate statistical QoS performance metrics in terms of throughput, delay and fairness under various channel conditions and over different time scales. Numerical results indicate that no single scheduler outperforms the others in terms of all the QoS metrics under all channel conditions. The choice of an optimal scheduling mechanism depends on the priority of QoS requirements as well as the channel conditions.

Keywords

statistical QoS, wireless scheduling, fairness

Discipline

Digital Communications and Networking

Research Areas

Software and Cyber-Physical Systems

Publication

Wireless Communications and Mobile Computing

Volume

4

Issue

1

First Page

19

Last Page

41

ISSN

1530-8669

Identifier

10.1002/wcm.166

Publisher

Wiley: 12 months

Download

Share

COinS