IEEE 802.11e EDCA Networks: Modeling, Differentiation and Optimization

被引:37
作者
Gao, Yayu [1 ,2 ]
Sun, Xinghua [1 ,3 ]
Dai, Lin [4 ]
机构
[1] City Univ Hong Kong, Kowloon, Hong Kong, Peoples R China
[2] Huazhong Univ Sci & Technol, Dept Elect & Informat Engn, Wuhan 430074, Peoples R China
[3] Nanjing Univ Posts & Telecommun, Key Lab Wireless Commun, Nanjing 210003, Peoples R China
[4] City Univ Hong Kong, Dept Elect Engn, Kowloon, Hong Kong, Peoples R China
关键词
IEEE 802.11e EDCA networks; modeling; throughput; differentiation; optimization; PERFORMANCE ANALYSIS; SATURATION THROUGHPUT; DELAY ANALYSIS; IEEE-802.11; QOS;
D O I
10.1109/TWC.2014.2327215
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Enhanced distributed channel access (EDCA) is an extension of the distributed coordination function to support quality-of-service for IEEE 802.11 wireless local area networks. By assigning distinct backoff parameters to each access category (AC), differentiated throughput performance can be achieved when the network is saturated. Although it has been long observed that the network throughput with the current EDCA standard setting may significantly degrade as the network size grows, how to properly tune the backoff parameters to optimize the network throughput under a certain differentiation requirement remains largely unknown. In this paper, a new analytical model is proposed to address this open issue. Specifically, we focus on an M-AC IEEE 802.11e EDCA network where nodes in the same AC have identical backoff parameters, including the initial backoff window size W-(g), the cutoff phase K-(g), and the arbitration interframe spaces (AIFS) number A((g)), g = 1, ... , M. The network steady-state operating point in saturated conditions, i. e., p(A), is characterized by using the steady-state probability of successful transmission of head-of-line (HOL) packets given that the channel is idle, based on which explicit expressions of node throughput and network throughput are further obtained. For given target ratios of node throughput of ACs, the optimal initial backoff window sizes and AIFS numbers to maximize the network throughput are derived and verified by simulation results. The analysis reveals that the maximum network throughput is solely determined by the holding time of HOL packets in successful transmission and collision states. To achieve the maximum network throughput, the initial backoff window size of each AC should be linearly increased with the network size. In the meantime, the increasing rate of the initial backoff window size, or the AIFS number, of each AC should be also carefully set according to the target ratios of node throughput. Although the maximum network throughput with pre-specified target ratios of node throughput of ACs can be achieved in both ways, the backoff window size differentiation could be a more preferable option as it requires fewer tuning parameters and provides better precision than the AIFS differentiation.
引用
收藏
页码:3863 / 3879
页数:17
相关论文
共 41 条
[1]  
[Anonymous], 80211E2005 IEEE
[2]  
[Anonymous], 80211 IEEE
[3]  
Babu AV, 2008, LECT NOTES COMPUT SC, V4904, P503
[4]   Throughput analysis and optimal configuration of 802.11e EDCA [J].
Banchs, Albert ;
Vollero, Luca .
COMPUTER NETWORKS, 2006, 50 (11) :1749-1768
[5]   Understanding 802.11e contention-based prioritization mechanisms and their coexistence with legacy 802.11 stations [J].
Bianchi, G ;
Tinnirello, I ;
Scalia, L .
IEEE NETWORK, 2005, 19 (04) :28-34
[6]   Performance analysis,of the IEEE 802.11 distributed coordination function [J].
Bianchi, G .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2000, 18 (03) :535-547
[7]  
Chen X, 2006, IEEE T WIREL COMMUN, V5, P2217, DOI [10.1109/TWC.2006.1687738, 10.1109/TWC.2006.04762]
[8]   On the Lambert W function [J].
Corless, RM ;
Gonnet, GH ;
Hare, DEG ;
Jeffrey, DJ ;
Knuth, DE .
ADVANCES IN COMPUTATIONAL MATHEMATICS, 1996, 5 (04) :329-359
[9]   A Unified Analysis of IEEE 802.11 DCF Networks: Stability, Throughput, and Delay [J].
Dai, Lin ;
Sun, Xinghua .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2013, 12 (08) :1558-1572
[10]   Information theory and communication networks: An unconsummated union [J].
Ephremides, A ;
Hajek, B .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (06) :2416-2434