Delay performance of CSMA in networks with bounded degree conflict graphs

We analyze packet delay in CSMA-based random access schemes in networks under the protocol interference model. Using a stochastic coupling argument we identify a subset of the throughput-region where queue lengths can be bounded uniformly for all network sizes. This conclusion provides a throughput-region of interest for delay sensitive applications and suggests that delay bounds based on mixing time analyses may be loose.

[1]  J. Kingman.  Some inequalities for the queue GI/G/1 , 1962 .

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

[3]  A. Müller,et al.  Comparison Methods for Stochastic Models and Risks , 2002 .

[4]  Thomas P. Hayes,et al.  A general lower bound for mixing of single-site dynamics on graphs , 2005 .

[5]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

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

[7]  R. M. Loynes,et al.  The stability of a queue with non-independent inter-arrival and service times , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.

[8]  K. T. Marshall,et al.  Some Inequalities in Queuing , 1968, Oper. Res..

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

[10]  Bhaskar Sengupta,et al.  A Queue with Service Interruptions in an Alternating Random Environment , 1990, Oper. Res..

[11]  Dieter Fiems,et al.  Discrete-time queues with generally distributed service times and renewal-type server interruptions , 2004, Perform. Evaluation.

[12]  J. Kingman.  Inequalities in the Theory of Queues , 1970 .

[13]  Sheldon M. Ross,et al.  Introduction to Probability Models, Eighth Edition , 1972 .

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

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

[16]  Sheldon M. Ross,et al.  Introduction to probability models , 1975 .

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