• 沒有找到結果。

Proportional Fairness for QoS Enhancement in IEEE 802.11e WLAN

N/A
N/A
Protected

Academic year: 2021

Share "Proportional Fairness for QoS Enhancement in IEEE 802.11e WLAN"

Copied!
2
0
0

加載中.... (立即查看全文)

全文

(1)

Proportional Fairness for QoS Enhancement in

IEEE

802.11e WLANS+

Jeng Farn ~ e e ' . ~ , Wanjiun ~iao',*, and Meng Chang chen3

'~epartment of Electrical Engineering, National Taiwan University, Taipei, Taiwan 'Graudate Institute of Communication Engineering, National Taiwan University, Taipei, Taiwan

3~nstitute of Information Science, Academia Sinica, Taipei, Taiwan Email: wiliao(ii..ntu.edu.tw

Abstract- In this paper, we study the proportional fairness problem in IEEE 802.11e wireless local area networks (WLANs). With 802.1 1e EDCA, only priority-based service is supported. Such priority-based service, while allowing differentiated service for flows of different priorities, cannot ensure service amount in proportion to their demands. This calls for weighted fair service to be supported by EDCA. In this paper, we propose a mechanism called Weighted Fair

-

EDCA (WF-EDCA) to provide proportional fairness for IEEE 802.1 1 WLANs. With WF-EDCA, weighted fair service among different access categories (ACs) is provided, and strict priority service can also be implemented. We then conduct simulations based on ns-2 to compare the performance of WF-EDCA and EDCA. The results show that WF-EDCA outperforms EDCA in terms of providing proportional fairness and strict priority service for IEEE 802.1 1 WLANs while retaining comparable total throughput.

L INTRODUCTION

IEEE 802.11e [I] is a supplementary standard of 802.1 1 Medium Access Control (MAC) to provide QoS for different kinds of applications. With 802.11e EDCA, only

are determined according to the distributed scheduling discipline DFS [2]. WF-EDCA can be easily extended to provide strict priority service, under the constraint that proportional fairness is still maintained. We then conduct simulation based on ns-2 to demonstrate the performance of WF-EDCA over 802.11e EDCA. The results show that WF-EDCA can provide strict priority and proportional fairness service for flows of different ACs based on their assigned weights, instead of the fixed priority service as in the original 802.1 1e EDCA.

TI. WEIGHTED FAIR

-

ENHANCED DISTRIBUTED CHANNEL ACCESS (WF-EDCA)

In this section, we describe the proposed proportional fairness mechanism called WF-EDCA for IEEE 802.11 WLANs. With WF-EDCA, 802.1 1e EDCA is enhanced by using Distributed Fair Scheduling (DFS) [2] in each backoff entity such that weighted fair service is provided for flows of different ACs. Each AC is also assigned a positive real number ([AC] indicating the weight of sharing the channel capacity. The calculation of BI of the head of line packet is based on (1) according to DFS. priority-based service is supported. Priority-based protocols,

while allowing service differentiation for flows of different Hi =

11

scaling - actor x

5

x p

h

I

J

(1)

priorities, cannot ensure minimum guaranteed or expected

throughputs for these flows. To solve such problems, fair where

Li

is the head of line frame size, and p is a random queuing is required. With fair queuing, different flows variable uniformly distributed in C0.9, 1 .I]. In (I), the ratio contending for a shared link can be allocated bandwidth in between ,ri and

4i

is from the finish tag, and the scaling proportion to their "weights." The major challenge of fair

queuing in WLANs is that service provisioning must be factor allows the choice of an appropriate scale for the fully distributed. This renders existing centralized virtual time in DFS.

mechanisms inappropriate. So far, no mechanism has been Note that WF-EDCA can be easily extended to designed for EDCA to provide proportional fairness service. provide strict priority, in which frames with higher priority In this paper, we propose a new mechanism called are transmitted before the lower-priority ones. To implement strict priority, the AIFS values of the lower

Weighted Fair (WF-EDCA) for priority must be set larger than that of the higher priority fairness service in IEEE 802.1 1 e EDCA systems. With

WF-EDCA, weighted fair service among different access plus its maximum contention window, i.e., categories ( A C S ) ~ ~ provided. The backoff intervals of ACs

+ This work was supported partly by National Science Council under a Center Excellence Grant NSC93-2752-E-002-006-PAE, and in part

by the National Science Council, Taiwan, under grant number NSC94-2218-E-002-059.

Proceedings of the IEEE Conference on Local Computer Networks 30th Anniversary (LCN’05)

(2)

AIFS[j] L AIFS[i]

+

CW,,, if j 4 i (2)

To sum up, in WF-EDCA, each AC is associated with a backoff entity and an EDCA parameter set, i.e., AIFS[AC], CWmin[AC], and CWmax[AC], but the value of the AIFS[AC] is now determined by (2). The backoff intervals of strict priority are the same as EDCA and that of proportional fairness are calculated based on (1).

111. PERFORMANCE EVALUATION

In this section, the fairness performance of the 802.1 1e EDCA and WF-EDCA is evaluated with the ns-2 EDCA implementation created by Chesson and Singla[3]. The wireless link rate is set at 1 1Mbps and each data flow is associated with one AC and generates CBR UDP traffic at a rate of 8Mbps to the AP. The packets, including the IP header, of all ACs are fixed at 1520 bytes. The weights of ACO, ACl, AC2 and AC3 are set to be 0.4,0.3,0.2 and 0.1, respectively, and the parameters Scaling-Factor of DFS are 0.01 in the simulations. The values of the EDCA parameter sets for the four ACs are listed in Table 1. Table 1. Values of EDCA parameter sets used in the simulation

I

AC VO ( AC VI

I

AC BE

I

AC BK AIFSNI 2 1 2

1

3

1

7

We compare the fairness of 802.11 EDCA and the proposed WF-EDCA for four different AC flows within five stations (STA) (Fig. 1 (a)). Fig. 1 plots the aggregate flow throughput of the same AC in the system for 802.1 1e EDCA and WF-EDCA (i.e., sub-figure (b) is for 802.1 1e EDCA and (c) for WF-EDCA). In the sub-figures, we identify the throughput ratios of ACO, AC1, AC2, and AC3 with respect to AC3. We observe that in all cases, with 802.1 1e EDCA, the high priority AC flows (i.e., AC 0) consumes most of the channel capacity, while the low priority ones (i.e., AC 2 and AC 3) are very likely to starve. WF-EDCA, on the other hand, allows AC flows to share channel capacity according to their assigned weights, thus providing proportional fairness nicely.

(a) simulation scenario

-pa)

(b) EDCA (ACO: ACI: AC2: AC3 = 176.95:20.83:3.4:1)

" I Z

i

r a ~

-

r s a m

(c) WF-EDCA (ACO: ACI: AC2: AC3 = 4.05:3.04 2.03:I)

Figure 1 . Aggregate throughput for four AC flows at five STAs IV. CONCLUSION

In this paper, we have proposed a proportional fairness service mechanism called Weighted Fair Enhanced Distributed Channel Access (WF-EDCA) for IEEE 802.1 1e WLANs. With WF-EDCA, weighted fair service among ACs is provided. The backoff intervals of ACs are determined according to the distributed scheduling discipline DFS. We have also demonstrated that WF- EDCA can be easily extended to provide strict priority service, while proportional fairness is still maintained. We have then conducted simulations based on ns-2 and compared the performance of IEEE 802.11e EDCA and WF-EDCA in terms of proportional service, fairness, strict priority, and aggregate throughput of each AC. The simulation results show that with WF-EDCA, the ACs can share the channel capacity according to their assigned weights. In addition, WF-EDCA can provide strict priority service while maintaining the proportional fairness among different ACs. Most importantly, WF-EDCA is easily implemented and is compatible with the IEEE 802.11 Standard.

V. REFERENCES

[l] IEEE WG, Draft Supplement to Standard for Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications: Medium Access Control (MAC), Enhancements for Quality of Service (QoS), IEEE 80Z.IIe

Draft 4.1, Feb. 2003.

[2] N. H. Vaidya, P. Bahl, and S. Gupta, "Distributed Fair Scheduling in Wireless LAN," ACMMobicom 2000. [3] ns-2, 802.11e EDCA, available at httn:!iwww-

sou.inria.frluianeteiuni!Research.hhl

Proceedings of the IEEE Conference on Local Computer Networks 30th Anniversary (LCN’05)

數據

Table 1. Values of EDCA parameter sets used in the simulation

參考文獻

相關文件

In this paper, we extended the entropy-like proximal algo- rithm proposed by Eggermont [12] for convex programming subject to nonnegative constraints and proposed a class of

In this paper, we have shown that how to construct complementarity functions for the circular cone complementarity problem, and have proposed four classes of merit func- tions for

Abstract In this paper, we consider the smoothing Newton method for solving a type of absolute value equations associated with second order cone (SOCAVE for short), which.. 1

In this paper, we develop a novel volumetric stretch energy minimization algorithm for volume-preserving parameterizations of simply connected 3-manifolds with a single boundary

In this paper, a novel subspace projection technique, called Basis-emphasized Non-negative Matrix Factorization with Wavelet Transform (wBNMF), is proposed to represent

In this thesis, we have proposed a new and simple feedforward sampling time offset (STO) estimation scheme for an OFDM-based IEEE 802.11a WLAN that uses an interpolator to recover

“IEEE P1451.2 D2.01 IEEE Draft Standard for A Smart Transducer Interface for Sensors and Actuators - Transducer to Microprocessor Communication Protocols

Selcuk Candan, ”GMP: Distributed Geographic Multicast Routing in Wireless Sensor Networks,” IEEE International Conference on Distributed Computing Systems,