The efficacy of centralized flow rate control in 802.11-based wireless mesh networks

被引:2
作者
Jamshaid, Kamran [1 ]
Ward, Paul [2 ]
Karsten, Martin [2 ]
Shihada, Basem [1 ]
机构
[1] KAUST, CEMSE Div, Thuwal, Saudi Arabia
[2] Univ Waterloo, Waterloo, ON N2L 3G1, Canada
关键词
Wireless mesh networks; 802.11; DCF; CSMA/CA; Max-min fairness; Congestion control; MEDIUM-ACCESS; MAXMIN;
D O I
10.1186/1687-1499-2013-163
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Commodity WiFi-based wireless mesh networks (WMNs) can be used to provide last mile Internet access. These networks exhibit extreme unfairness with backlogged traffic sources. Current solutions propose distributed source-rate control algorithms requiring link-layer or transport-layer changes on all mesh nodes. This is often infeasible in large practical deployments. In wireline networks, router-assisted rate control techniques have been proposed for use alongside end-to-end mechanisms. We wish to evaluate the feasibility of establishing similar centralized control via gateways in WMNs. In this paper, we focus on the efficacy of this control rather than the specifics of the controller design mechanism. We answer the question: Given sources that react predictably to congestion notification, can we enforce a desired rate allocation through a single centralized controller? The answer is not obvious because flows experience varying contention levels, and transmissions are scheduled by a node using imperfect local knowledge. We find that common router-assisted flow control schemes used in wired networks fail in WMNs because they assume that (1) links are independent, and (2) router queue buildups are sufficient for detecting congestion. We show that non-work-conserving, rate-based centralized scheduling can effectively enforce rate allocation. It can achieve results comparable to source rate limiting, without requiring any modifications to mesh routers or client devices.
引用
收藏
页数:17
相关论文
共 39 条
  • [1] [Anonymous], 2003, P ACM SENSYS 03
  • [2] [Anonymous], 1984, QUANTITATIVE MEASURE
  • [3] [Anonymous], P ACM MOBICOM
  • [4] [Anonymous], P S COMM ARCH PROT S
  • [5] Aziz A, 2009, P ACM CONEXT ROM IT, P73
  • [6] Bertsekas D. P., 1992, Data Networks, V2nd
  • [7] BHARHGAVAN V, 1994, P ACM SIGCOMM 94, P249
  • [8] A Practical Adaptive Pacing Scheme for TCP in Multihop Wireless Networks
    ElRakabawy, Sherif M.
    Lindemann, Christoph
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2011, 19 (04) : 975 - 988
  • [9] Random Early Detection Gateways for Congestion Avoidance
    Floyd, Sally
    Jacobson, Van
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 1993, 1 (04) : 397 - 413
  • [10] Floyd Sally., 2004, The newreno modification to tcp's fast recovery algorithm