Location of Repository

Delay performance of CSMA in networks with bounded degree conflict graphs

By Vijay G. Subramanian and Murat Alanyali


Abstract—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. I

Year: 2014
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://iss.bu.edu/alanyali/Pub... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.