EZ-Flow: removing turbulence in IEEE 802.11 wireless mesh networks without message passing

Recent analytical and experimental work demonstrate that IEEE 802.11-based wireless mesh networks are prone to turbulence. Manifestations of such turbulence take the form of large buffer build-up at relay nodes, end-to-end delay fluctuations, and traffic congestion. In this paper, we propose and evaluate a novel, distributed flow-control mechanism to address this problem, called EZ-flow. EZ-flow is fully compatible with the IEEE 802.11 standard (i.e., it does not modify headers in packets), can be implemented using off-the-shelf hardware, and does not entail any communication overhead. EZ-flow operates by adapting the minimum congestion window parameter at each relay node, based on an estimation of the buffer occupancy at its successor node in the mesh. We show how such an estimation can be conducted passively by taking advantage of the broadcast nature of the wireless channel. Real experiments, run on a 9-node testbed deployed over 4 different buildings, show that EZ-flow effectively smoothes traffic and improves delay, throughput, and fairness performance. We further corroborate these results with a mathematical stability analysis and extensive ns-2 simulations run for different traffic workloads and network topologies.

[1]  Muriel Médard,et al.  XORs in the Air: Practical Wireless Network Coding , 2006, IEEE/ACM Transactions on Networking.

[2]  Vincenzo Mancuso,et al.  Measurement and Modeling of the Origins of Starvation in Congestion Controlled Mesh Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[3]  David Starobinski,et al.  Elucidating the Instability of Random Access Wireless Mesh Networks , 2009, 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[4]  R. Srikant,et al.  Fair Resource Allocation in Wireless Networks Using Queue-Length-Based Scheduling and Congestion Control , 2005, IEEE/ACM Transactions on Networking.

[5]  Koushik Kar,et al.  Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks , 2008, IEEE Transactions on Information Theory.

[6]  Alexandre Proutière,et al.  Throughput of random access without message passing , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[7]  Donald F. Towsley,et al.  Cluster-Based Back-Pressure Routing Algorithm , 2008, IEEE/ACM Transactions on Networking.

[8]  Devavrat Shah,et al.  Network adiabatic theorem: an efficient randomized protocol for contention resolution , 2009, SIGMETRICS '09.

[9]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[10]  Richard Gold,et al.  LUNAR: Lightweight Underlay Network Ad-hoc Routing , 2003 .

[11]  Alexandre Proutière,et al.  Complexity in wireless scheduling: impact and tradeoffs , 2008, MobiHoc '08.

[12]  Michele Garetto,et al.  Modeling Per-Flow Throughput and Capturing Starvation in CSMA Multi-Hop Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[13]  Robert Tappan Morris,et al.  ExOR: opportunistic multi-hop routing for wireless networks , 2005, SIGCOMM '05.

[14]  Andrzej Duda,et al.  Idle sense: an optimal access method for high throughput and fairness in rate diverse wireless LANs , 2005, SIGCOMM '05.

[15]  Sanjay Shakkottai,et al.  Hop-by-Hop Congestion Control Over a Wireless Multi-Hop Network , 2004, IEEE/ACM Transactions on Networking.

[16]  Eddie Kohler,et al.  The Click modular router , 1999, SOSP.

[17]  G. Fayolle,et al.  Topics in the Constructive Theory of Countable Markov Chains , 1995 .

[18]  A. Jindal,et al.  Achievable rate region and optimality of multi-hop wireless 802.11-scheduled networks , 2008, 2008 Information Theory and Applications Workshop.

[19]  Edward W. Knightly,et al.  End-to-end performance and fairness in multihop wireless backhaul networks , 2004, MobiCom '04.

[20]  Martin Mauve,et al.  Backpressure multicast congestion control in mobile ad-hoc networks , 2007, CoNEXT '07.

[21]  R. Srikant,et al.  Low-Complexity Distributed Scheduling Algorithms for Wireless Networks , 2009, IEEE/ACM Transactions on Networking.

[22]  A. Warrier,et al.  DiffQ: Practical Differential Backlog Congestion Control for Wireless Networks , 2009, IEEE INFOCOM 2009.

[23]  G. Fayolle,et al.  Topics in the Constructive Theory of Countable Markov Chains: Ideology of induced chains , 1995 .

[24]  Ramesh Govindan,et al.  Understanding congestion control in multi-hop wireless mesh networks , 2008, MobiCom '08.

[25]  Olivier Dousse Revising buffering in multihop CSMA/CA wireless networks , 2007, 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[26]  Dharma P. Agrawal,et al.  A novel queue management mechanism for improving performance of multihop flows in IEEE 802.11s based mesh networks , 2006, 2006 IEEE International Performance Computing and Communications Conference.

[27]  Konstantinos Psounis,et al.  The achievable rate region of 802.11-scheduled multihop networks , 2009, TNET.