Making 802.11 DCF Near-Optimal: Design, Implementation, and Evaluation

This paper proposes a new protocol called Optimal DCF (O-DCF). O-DCF modifies the rule of adapting CSMA parameters, such as backoff time and transmission length, based on a function of the demand--supply differential of link capacity captured by the local queue length. O-DCF is fully compatible with 802.11 hardware, so that it can be easily implemented only with a simple device driver update. O-DCF is inspired by the recent analytical studies proven to be optimal under assumptions, which often generates a big gap between theory and practice. O-DCF effectively bridges such a gap, which is implemented in off-the-shelf 802.11 chipset. Through extensive simulations and real experiments with a 16-node wireless network testbed, we evaluate the performance of O-DCF and show that it achieves near-optimality in terms of throughput and fairness and outperforms other competitive ones, such as 802.11 DCF, optimal CSMA, and DiffQ for various scenarios. Also, we consider the coexistence of O-DCF and 802.11 DCF and show that O-DCF fairly shares the medium with 802.11 via its parameter control.

[1]  Vaduvur Bharghavan,et al.  MACAW: a media access protocol for wireless LAN's , 1994, SIGCOMM 1994.

[2]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.

[3]  Marco Conti,et al.  Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit , 2000, TNET.

[4]  Haitao Wu,et al.  Performance of reliable transport protocol over IEEE 802.11 wireless LAN: analysis and enhancement , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[5]  Martin Heusse,et al.  Performance anomaly of 802.11b , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[6]  John V. Guttag,et al.  Time-based Fairness Improves Performance in Multi-Rate WLANs , 2004, USENIX Annual Technical Conference, General Track.

[7]  Youngsoo Kim,et al.  Throughput enhancement of IEEE 802.11 WLAN via frame aggregation , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.

[8]  John C. Bicket,et al.  Bit-rate selection in wireless networks , 2005 .

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

[10]  Koushik Kar,et al.  Throughput modelling and fairness issues in CSMA/CA based ad-hoc networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[11]  Michael J. Neely Super-Fast Delay Tradeoffs for Utility Optimal Fair Scheduling in Wireless Networks , 2006, IEEE J. Sel. Areas Commun..

[12]  Vasilios A. Siris,et al.  Optimal CWmin selection for achieving proportional fairness in multi-rate 802.11e WLANs: test-bed implementation and evaluation , 2006, WINTECH.

[13]  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.

[14]  Yan Grunenberger,et al.  Experience with an implementation of the Idle Sense wireless access method , 2007, CoNEXT '07.

[15]  A. Eryilmaz,et al.  A backlog-based CSMA mechanism to achieve fairness and throughput-optimality in multihop wireless networks , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[16]  Elizabeth M. Belding-Royer,et al.  FreeMAC: framework for multi-channel mac development on 802.11 hardware , 2008, PRESTO '08.

[17]  M. Chiang,et al.  Next-Generation Internet Architectures and Protocols: Stochastic network utility maximization and wireless scheduling , 2008 .

[18]  Scott Nettles,et al.  Improving the performance of multi-hop wireless networks using frame aggregation and broadcast for TCP ACKs , 2008, CoNEXT '08.

[19]  Hsiao-Hwa Chen,et al.  IEEE 802.11n MAC frame aggregation mechanisms for next-generation high-throughput WLANs , 2008, IEEE Wireless Communications.

[20]  Jinsung Lee,et al.  Implementing utility-optimal CSMA , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[22]  David Starobinski,et al.  EZ-Flow: removing turbulence in IEEE 802.11 wireless mesh networks without message passing , 2009, CoNEXT '09.

[23]  Seung-Jae Han,et al.  Analysis of Spatial Unfairness in Wireless LANs , 2009, IEEE INFOCOM 2009.

[24]  DiffQ: Practical Differential Backlog Congestion Control for Wireless Networks , 2009, IEEE INFOCOM 2009.

[25]  Alexandre Proutière,et al.  Resource Allocation over Network Dynamics without Timescale Separation , 2010, 2010 Proceedings IEEE INFOCOM.

[26]  Jiaping Liu,et al.  Towards utility-optimal random access without message passing , 2010, CMC 2010.

[27]  Jean C. Walrand,et al.  A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks , 2010, IEEE/ACM Transactions on Networking.

[28]  Jian Ni,et al.  Q-CSMA: Queue-Length Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks , 2010, INFOCOM 2010.

[29]  Jinsung Lee,et al.  Experimental evaluation of optimal CSMA , 2011, 2011 Proceedings IEEE INFOCOM.

[30]  Minghua Chen,et al.  On the performance of TCP over throughput-optimal CSMA , 2011, 2011 IEEE Nineteenth IEEE International Workshop on Quality of Service.

[31]  Thomas Bonald,et al.  On flow-aware CSMA in multi-channel wireless networks , 2011, 2011 45th Annual Conference on Information Sciences and Systems.

[32]  George N. Rouskas,et al.  Next-Generation Internet Architectures and Protocols: Network architectures , 2011 .

[33]  Rafael P. Laufer,et al.  XPRESS: a cross-layer backpressure architecture for wireless multi-hop networks , 2011, MobiCom '11.

[34]  Jean C. Walrand,et al.  Approaching Throughput-Optimality in Distributed CSMA Scheduling Algorithms With Collisions , 2010, IEEE/ACM Transactions on Networking.

[35]  Yin Zhang,et al.  CRMA: collision-resistant multiple access , 2011, MobiCom.

[36]  Srihari Nelakuditi,et al.  CSMA/CN: Carrier Sense Multiple Access With Collision Notification , 2012, IEEE/ACM Transactions on Networking.

[37]  Jinwoo Shin,et al.  Optimal CSMA: A survey , 2012, 2012 IEEE International Conference on Communication Systems (ICCS).

[38]  Jinsung Lee,et al.  Improving TCP Performance over Optimal CSMA in Wireless Multi-Hop Networks , 2012, IEEE Communications Letters.

[39]  Jinwoo Shin,et al.  CSMA over time-varying channels: optimality, uniqueness and limited backoff rate , 2013, MobiHoc '13.

[40]  Jinwoo Shin,et al.  Distributed learning for utility maximization over CSMA-based wireless multihop networks , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[41]  Jinsung Lee,et al.  Making 802.11 DCF Near-Optimal: Design, Implementation, and Evaluation , 2016, IEEE/ACM Transactions on Networking.