IDEALS Home University of Illinois at Urbana-Champaign logo The Alma Mater The Main Quad

Rate-adaptive Framing for Interfered Wireless Networks

Show full item record

Bookmark or cite this item: http://hdl.handle.net/2142/11212

Files in this item

File Description Format
PDF Rate-adaptive F ... ered Wireless Networks.pdf (659KB) (no description provided) PDF
Title: Rate-adaptive Framing for Interfered Wireless Networks
Author(s): Chen, Chun-cheng; Seo, Eunsoo; Luo, Haiyun; Vaidya, Nitin H.
Subject(s): wireless networks
Abstract: The majority of existing wireless rate controls are based on the implicit assumption that frames are corrupted due to the random, arbitrary environmental and thermal noises. They generally reduce the channel rate on frame losses, trading lower efficiency in frequency band utilization for more robust modulation so that the current noise level may be concealed. In highly interfered wireless networks where frames are lost mainly due to interference from other wireless transceivers, simply reducing the channel rate prolongs the frame transmission time and therefore aggravates frame loss ratio. This positive feedback in the rate control loop quickly diverges the interfered transceivers into a suboptimal channel rate and drives the network into a state with high interference. In the worst case, interfered transceivers can be starved. In this paper we present RAF, the rate-adaptive framing that jointly controls the channel rate and frame size according to the observed interference patterns and noise level at the receiver. Based on the inputs from physical layer carrier sense, the receiver derives the optimal channel rate and frame size that maximize throughput, and informs the transmitter of such optimal configuration in a few bits in the per-frame acknowledgement. Through intensive simulations we show that RAF consistently outperforms ARF (automatic rate fallback), the de facto rate control in 802.11 networks, in all our simulated scenarios. In particular, it increases the throughput of interfered transceivers by up to six folds and completely eliminates starvation in large random networks with various traffic matrix and interference levels.
Issue Date: 2006-06
Genre: Technical Report
Type: Text
URI: http://hdl.handle.net/2142/11212
Other Identifier(s): UIUCDCS-R-2006-2743
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)

Show full item record

Item Statistics

  • Total Downloads: 179
  • Downloads this Month: 1
  • Downloads Today: 0

Browse

My Account

Information

Access Key