Delay performance of CSMA in networks with bounded degree conflict graphs
Vijay Subramanian, Murat Alanyali · 2011
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.