Optimal CSMA: A survey

Carrier Sense Multiple Access (CSMA) has been widely used as a medium access control (MAC) scheme in wireless networks mainly due to its simple and totally distributed operations. Recently, it has been reported in the community that even such simple CSMA-type algorithms can achieve optimality in terms of throughput and utility, by smartly controlling its operational parameters such as backoff and holding times. In this survey paper, we summarize the recent research efforts in this area with main focus on the key intuitions and rationales, and conclude by presenting some open problems.

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

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

[3]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[4]  Jinwoo Shin,et al.  Medium Access over Time-varying Channels with Limited Sensing Cost , 2012, ArXiv.

[5]  Devavrat Shah,et al.  Hardness of low delay network scheduling , 2010, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[6]  R. Srikant,et al.  On the design of efficient CSMA algorithms for wireless networks , 2010, 49th IEEE Conference on Decision and Control (CDC).

[7]  Peter Marbach,et al.  Throughput-optimal random access with order-optimal delay , 2010, 2011 Proceedings IEEE INFOCOM.

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

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

[10]  Murat Alanyali,et al.  Delay performance of CSMA in networks with bounded degree conflict graphs , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[11]  Jean C. Walrand,et al.  Distributed Random Access Algorithm: Scheduling and Congestion Control , 2009, IEEE Transactions on Information Theory.

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

[13]  Ness B. Shroff,et al.  CSMA-Based Distributed Scheduling in Multi-hop MIMO Networks under SINR Model , 2010, 2010 Proceedings IEEE INFOCOM.

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

[15]  R. Srikant,et al.  Stable scheduling policies for fading wireless channels , 2005, IEEE/ACM Transactions on Networking.

[16]  Jian Ni,et al.  On the achievable throughput of CSMA under imperfect carrier sensing , 2011, 2011 Proceedings IEEE INFOCOM.

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

[18]  Atilla Eryilmaz,et al.  A Fast-CSMA Algorithm for Deadline-Constrained Scheduling over Wireless Fading Channels , 2012, ArXiv.

[19]  Devavrat Shah,et al.  Delay optimal queue-based CSMA , 2010, SIGMETRICS '10.

[20]  Yung Yi,et al.  From Glauber dynamics to Metropolis algorithm: Smaller delay in optimal CSMA , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[21]  Devavrat Shah,et al.  Medium Access Using Queues , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[22]  Devavrat Shah,et al.  Randomized Scheduling Algorithm for Queueing Networks , 2009, ArXiv.

[23]  George N. Rouskas,et al.  Next-Generation Internet Architectures and Protocols: Preface , 2011 .

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

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

[26]  Jinsung Lee,et al.  Making 802.11 DCF Optimal: Design, Implementation, and Evaluation , 2012, ArXiv.

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

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

[29]  Jiaping Liu,et al.  Maximizing Utility via Random Access without Message Passing , 2008 .

[30]  Alexandre Proutière,et al.  Simulation-based optimization algorithms with applications to dynamic spectrum access , 2012, 2012 46th Annual Conference on Information Sciences and Systems (CISS).

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