A Theory of QoS for Wireless

Wireless networks are increasingly used to carry applications with QoS constraints. Two problems arise when dealing with traffic with QoS constraints. One is admission control, which consists of determining whether it is possible to fulfill the demands of a set of clients. The other is finding an optimal scheduling policy to meet the demands of all clients. In this paper, we propose a framework for jointly addressing three QoS criteria: delay, delivery ratio, and channel reliability. We analytically prove the necessary and sufficient condition for a set of clients to be feasible with respect to the above three criteria. We then establish an efficient algorithm for admission control to decide whether a set of clients is feasible. We further propose two scheduling policies and prove that they are feasibility optimal in the sense that they can meet the demands of every feasible set of clients. In addition, we show that these policies are easily implementable on the IEEE 802.11 mechanisms. We also present the results of simulation studies that appear to confirm the theoretical studies and suggest that the proposed policies outperform others tested under a variety of settings.

[1]  D. Blackwell.  An analog of the minimax theorem for vector payoffs. , 1956 .

[2]  Leandros Tassiulas,et al.  Dynamic server allocation to parallel queues with randomly varying connectivity , 1993, IEEE Trans. Inf. Theory.

[3]  A. M. Abdullah,et al.  Wireless lan medium access control (mac) and physical layer (phy) specifications , 1997 .

[4]  Philip A. Whiting,et al.  Cdma data qos scheduling on the forward link with variable channel conditions , 2000 .

[5]  A. Stolyar,et al.  LARGEST WEIGHTED DELAY FIRST SCHEDULING: LARGE DEVIATIONS AND OPTIMALITY , 2001 .

[6]  Alexander L. Stolyar,et al.  Scheduling algorithms for a mixture of real-time and non-real-time data in HDR , 2001 .

[7]  Mohit Agarwal,et al.  Base station scheduling of requests with fixed deadlines , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[8]  R. Srikant,et al.  Scheduling Real-Time Traffic With Deadlines over a Wireless Channel , 2002, Wirel. Networks.

[9]  Tim Moors,et al.  Call admission control for IEEE 802.11 contention access mechanism , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[10]  Sachin Garg,et al.  Admission control for VoIP traffic in IEEE 802.11 networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[11]  Yang Xiao,et al.  Evaluation of distributed admission control for the IEEE 802.11e EDCA , 2004, IEEE Communications Magazine.

[12]  Henning Schulzrinne,et al.  Using dynamic PCF to improve the capacity for VoIP traffic in IEEE 802.11 networks , 2005, IEEE Wireless Communications and Networking Conference, 2005.

[13]  Donald C. Cox,et al.  An adaptive cross-layer scheduler for improved QoS support of multiclass data services on wireless systems , 2005, IEEE Journal on Selected Areas in Communications.

[14]  N. Bambos,et al.  Deadline constrained packet scheduling for wireless networks , 2005, VTC-2005-Fall. 2005 IEEE 62nd Vehicular Technology Conference, 2005..

[15]  Hongqiang Zhai,et al.  A call admission and rate control scheme for multimedia support over IEEE 802.11 wireless LANs , 2006, Wirel. Networks.

[16]  Vivek S. Borkar,et al.  Index Policies for Real-Time Multicast Scheduling for Wireless Broadcast Systems , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[17]  Henning Schulzrinne,et al.  Call Admission Control in IEEE 802.11 WLANs Using QP-CAT , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[18]  Michael J. Neely,et al.  Delay Analysis for Max Weight Opportunistic Scheduling in Wireless Systems , 2008, IEEE Transactions on Automatic Control.

[19]  Peter Orbanz.  Probability Theory II , 2011 .