Files in this item



application/pdfOpportunistic J ... k Scheduling for WLANs.pdf (246kB)
(no description provided)PDF


Title:Opportunistic Joint Uplink/Downlink Scheduling for WLANs
Author(s):Yoo, Joon; Luo, Haiyun; Kim, Chong Kwon
Subject(s):wireless networks
Abstract:Recent advances in the speed of multi-rate wireless local area networks (WLANs) and the proliferation of WLAN devices have made rate adaptive, opportunistic scheduling critical for throughput optimization. As WLAN traffic evolves to be more symmetric due to the emerging new applications such as VoWLAN, collaborative download, and peer-to-peer file sharing, opportunistic scheduling at the downlink becomes insufficient for optimized utilization of the single shared wireless channel. Furthermore, without proper scheduling on the uplink, the downlink throughput gain diminishes proportionally to the increasing number of clients transmitting on the uplink. However, opportunistic scheduling on the uplink of a WLAN is challenging because wireless channel condition is dynamic and asymmetric. Each transmitting client has to probe the access point to maintain the updated channel conditions at the access point. Moreover, the scheduling decisions must be coordinated at all clients for consistency. This paper presents JUDS, a joint uplink/downlink opportunistic scheduling for WLANs. Through synergistic integration of both the uplink and the downlink scheduling, JUDS maximizes channel diversity at significantly reduced scheduling overhead. It also enforces fair channel sharing between the downlink and uplink traffic. Through analysis and extensive QualNet simulations, we show that JUDS improves the overall throughput by up to 127 and achieves close-to-perfect fairness between uplink and downlink traffic.
Issue Date:2006-07
Genre:Technical Report
Other Identifier(s):UIUCDCS-R-2006-2757
Rights Information:You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).
Date Available in IDEALS:2009-04-21

This item appears in the following Collection(s)

Item Statistics