Approaching Throughput-Optimality in Distributed CSMA Scheduling Algorithms With Collisions

It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing networks) under certain assumptions. One important but idealized assumption is that the sensing time is negligible, so that there is no collision. In this paper, we study more practical CSMA-based scheduling algorithms with collisions. First, we provide a Markov chain model and give an explicit throughput formula that takes into account the cost of collisions and overhead. The formula has a simple form since the Markov chain is “almost” time-reversible. Second, we propose transmission-length control algorithms to approach throughput-optimality in this case. Sufficient conditions are given to ensure the convergence and stability of the proposed algorithms. Finally, we characterize the relationship between the CSMA parameters (such as the maximum packet lengths) and the achievable capacity region.

[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 , 1990, 29th IEEE Conference on Decision and Control.

[4]  S. Zachary,et al.  Loss networks , 2009, 0903.0640.

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

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

[7]  A. Girotra,et al.  Performance Analysis of the IEEE 802 . 11 Distributed Coordination Function , 2005 .

[8]  R. Srikant,et al.  Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[9]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

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

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

[12]  Ruth J. Williams,et al.  Workload Interpretation for Brownian Models of Stochastic Processing Networks , 2007, Math. Oper. Res..

[13]  Eitan Altman,et al.  New Insights From a Fixed-Point Analysis of Single Cell IEEE 802.11 WLANs , 2007, IEEE/ACM Transactions on Networking.

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

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

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

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

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

[19]  V. Borkar.  Stochastic Approximation: A Dynamical Systems Viewpoint , 2008 .

[20]  Soung Chang Liew,et al.  Improving Throughput and Fairness by Reducing Exposed and Hidden Nodes in 802.11 Networks , 2008, IEEE Transactions on Mobile Computing.

[21]  Alexandre Proutière,et al.  Performance of random medium access control, an asymptotic approach , 2008, SIGMETRICS '08.

[22]  Patrick Thiran,et al.  On the fairness of large CSMA networks , 2009, IEEE Journal on Selected Areas in Communications.

[23]  Jean Walrand,et al.  Approaching throughput-optimality in a distributed CSMA algorithm: collisions and stability , 2009, MobiHoc S3 '09.

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

[25]  Ness B. Shroff,et al.  Understanding the capacity region of the Greedy maximal scheduling algorithm in multihop wireless networks , 2009, TNET.

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

[27]  Jian Ni,et al.  Distributed CSMA/CA algorithms for achieving maximum throughput in wireless networks , 2009, 2009 Information Theory and Applications Workshop.

[28]  Johan van Leeuwaarden,et al.  Spatial fairness in wireless multi-access networks , 2009, VALUETOOLS.

[29]  J. Walrand,et al.  Approaching Throughput-optimality in a Distributed CSMA Algorithm with Contention Resolution , 2009 .

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

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

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

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

[34]  Jian Ni,et al.  Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks , 2011, TNET.