Delay Performance of CSMA in Networks With Bounded Degree Conflict Graphs

The authors analyze packet delay in CSMA-based random access schemes in networks under the protocol interference model. Using a stochastic coupling argument they 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. It was recently shown that CSMA-based random access schemes can achieve the full throughput region under the protocol model of interference.