Distributed CSMA/CA algorithms for achieving maximum throughput in wireless networks

Recently, it has been shown that CSMA-type algorithms can achieve the maximum possible throughput in wireless ad hoc networks [3], [5]. Central to these results is a distributed randomized algorithm which selects schedules according to a product-form distribution. The product-form distribution is achieved by considering a continuous-time Markov model of an idealized CSMA protocol [1] (continuous backoff times, zero propagation/sensing delay, no hidden terminals) under which collisions cannot occur.

[1]  Anthony Unwin,et al.  Reversibility and Stochastic Networks , 1980 .

[2]  Basil S. Maglaris,et al.  Throughput Analysis in Multihop CSMA Packet Radio Networks , 1987, IEEE Trans. Commun..

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

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

[5]  R. Srikant,et al.  A tutorial on cross-layer optimization in wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

[6]  Rayadurgam Srikant,et al.  Queue Length Stability of Maximal Greedy Schedules in Wireless Networks , 2006 .

[7]  Leandros Tassiulas,et al.  Resource Allocation and Cross-Layer Control in Wireless Networks , 2006, Found. Trends Netw..

[8]  Patrick Thiran,et al.  A Packing Approach to Compare Slotted and Non-Slotted Medium Access Control , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[9]  J. Walrand,et al.  Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits , 2006, Advances in Applied Probability.

[10]  R. Srikant,et al.  Network Optimization and Control , 2008, Found. Trends Netw..

[11]  Asuman E. Ozdaglar,et al.  Achievable rate region of CSMA schedulers in wireless networks with primary interference constraints , 2007, 2007 46th IEEE Conference on Decision and Control.

[12]  Devavrat Shah,et al.  Distributed algorithm and reversible network , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

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

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

[15]  Eytan Modiano,et al.  Multihop Local Pooling for Distributed Throughput Maximization in Wireless Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[16]  S. Rajagopalan,et al.  Aloha That Works , 2008 .

[17]  Prasanna Chaporkar,et al.  Throughput Guarantees Through Maximal Scheduling in Wireless Networks , 2008 .

[18]  Alexander L. Stolyar,et al.  Joint Scheduling and Congestion Control in Mobile Ad-Hoc Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[19]  Ness B. Shroff,et al.  Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multihop Wireless Networks , 2008, IEEE/ACM Transactions on Networking.

[20]  Soung Chang Liew,et al.  Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks , 2007, 2009 IEEE International Conference on Communications.

[21]  R. Srikant,et al.  Distributed Link Scheduling With Constant Overhead , 2006, IEEE/ACM Transactions on Networking.

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

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