An Optimization Algorithm for 802.11e EDCA Mechanism

(Abstract) )) )IEEE 802.11e Enhanced Distributed Channel Access(EDCA) guarantees the Quality of Service(QoS) of high priority traffic, at the same time low priority traffic is sacrificed. For the phenomenon of unfair distribution resources in the channel, an optimization algorithm is proposed in this paper. This algorithm combines part of time slot into Merge Time Slot(MTS). High and low priority traffics are sended in chronological order, while single usually sends low priority traffic. Simulation results show that this algorithm can improve the throughput of traffic, in the growing number of stations, the throughput performance of high and low priority traffics is stable, all kinds of traffic reach the purpose of fairly using channel resources. (Key words )Wireless Local Area Network(WLAN); IEEE 802.11e protocol; Enhanced Distributed Channel Access(EDCA); Quality of Service(QoS); Merge Time Slot(MTS); single time slot

[1]  Hamamache Kheddouci,et al.  A new clustering algorithm for MANETs , 2010, 2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS).

[2]  Xiaoyan Hong,et al.  An ad hoc network with mobile backbones , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[3]  Jie Wu,et al.  On constructing k-connected k-dominating set in wireless networks , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[4]  Piotr Gajewski,et al.  Clustering algorithm for Mobile Ad Hoc Networks , 2013 .

[5]  Sajal K. Das,et al.  WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks , 2002, Cluster Computing.

[6]  G. Bianchi,et al.  IEEE 802.11-saturation throughput analysis , 1998, IEEE Communications Letters.

[7]  Brahim Bensaou,et al.  Performance analysis of IEEE 802.11e contention-based channel access , 2004, IEEE Journal on Selected Areas in Communications.

[8]  Yang Xiao.  Performance analysis of IEEE 802.11e EDCF under saturation condition , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[9]  Saurabh Srivastava,et al.  Distributed algorithms for finding and maintaining a k-tree core in a dynamic network , 2003, Inf. Process. Lett..

[10]  Sunghyun Choi,et al.  Protection and guarantee for voice and video traffic in IEEE 802.11e wireless LANs , 2004, IEEE INFOCOM 2004.

[11]  Kayhan Erciyes,et al.  A Hierarchical Connected Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks , 2007, 2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.