This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
30th IEEE International Performance Computing and Communications Conference
DAT: An AP scheduler using dynamically adjusted time windows for crowded WLANs
Orlando, FL, USA
November 17-November 19
ISBN: 978-1-4673-0010-0
Yi Yao, Northeastern University
Bo Sheng, University of Massachusetts Boston
Ningfang Mi, Northeastern University
This paper proposes a new packet scheduling algorithm for access points in a crowded 802.11 WLAN. Our goal is to improve the performance of efficiency (measured by packet response time or throughput) and fairness which often conflict with each other. Our solution aggregates both metrics and leverages the balance between them. The basic idea is to let the AP allocate different time windows for serving each client. According to the observed traffic, our algorithm dynamically shifts the weight between efficiency and fairness and strikes to improve the preferred metric without excessively degrading the other one. A valid queuing model is developed to evaluate the new algorithm's performance. Using trace-driven simulations, we show that our algorithm successfully balances the trade off between the efficiency and the fairness in a busy WLAN.
Citation:
Yi Yao, Bo Sheng, Ningfang Mi, "DAT: An AP scheduler using dynamically adjusted time windows for crowded WLANs," pccc, pp.1-6, 30th IEEE International Performance Computing and Communications Conference, 2011
Usage of this product signifies your acceptance of the Terms of Use.