A-DCF: Design and implementation of delay and queue length based wireless MAC

Optimal CSMA, which is fully distributed wireless MAC theory, has provided a rule of dynamically adapting CSMA parameters according to some theoretically developed principles, and has reported to offer nice analytical guarantees on throughput and fairness. Despite a couple of research efforts that transfer Optimal CSMA to practical protocols, e.g., O-DCF, our evaluation results show that they are still far from being deployable in practice mainly due to bad performance with TCP. In this paper, we first investigate how Optimal CSMA based MAC conflicts with TCP and degrades end-to-end performance, if poorly transferred to practice. Then, we propose a new wireless MAC protocol, called A-DCF, that inherits the basic framework and rationale of Optimal CSMA and O-DCF, but are largely redesigned to make A-DCF work well with TCP. The key idea of A-DCF lies in smartly exploiting both queue length and delay which widens our design space for compatibility with TCP. Our extensive simulation and experimental results demonstrate that A-DCF outperforms the traditional 802.11 and O-DCF. Particularly, we report our implementation code of A-DCF as a device driver module. To our knowledge, it is the first driver-level implementation of an Optimal CSMA based MAC protocol, being of broad interest to the community.

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

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

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

[4]  E.W. Knightly,et al.  Measurement and Modeling of the Origins of Starvation of Congestion-Controlled Flows in Wireless Mesh Networks , 2009, IEEE/ACM Transactions on Networking.

[5]  Shugong Xu,et al.  Does the IEEE 802.11 MAC protocol work well in multihop wireless ad hoc networks? , 2001, IEEE Commun. Mag..

[6]  Shigang Chen,et al.  Can CSMA/CA networks be made fair? , 2008, MobiCom '08.

[7]  Konstantinos Psounis,et al.  The Achievable Rate Region of 802.11-Scheduled Multihop Networks , 2009, IEEE/ACM Transactions on Networking.

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

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

[10]  2015 IEEE Conference on Computer Communications, INFOCOM 2015, Kowloon, Hong Kong, April 26 - May 1, 2015 , 2015, IEEE Conference on Computer Communications.

[11]  Jian Ni,et al.  Q-CSMA: Queue-Length-Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks , 2009, IEEE/ACM Transactions on Networking.

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

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

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

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

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

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

[18]  Ness B. Shroff,et al.  Delay-Based Back-Pressure Scheduling in Multihop Wireless Networks , 2011, IEEE/ACM Transactions on Networking.

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

[20]  H. Vincent Poor,et al.  Towards utility-optimal random access without message passing , 2010, Wirel. Commun. Mob. Comput..

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

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

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

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

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

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

[27]  Mario Gerla,et al.  Enhancing TCP fairness in ad hoc wireless networks using neighborhood RED , 2003, MobiCom '03.

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

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

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

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

[32]  Jie Wu,et al.  Joint TCP Congestion Control and CSMA Scheduling without Message Passing , 2013, IEEE Transactions on Wireless Communications.