Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Delay performance of CSMA in networks with bounded degree conflict graphs
 

Summary: Delay performance of CSMA in networks with
bounded degree conflict graphs
Vijay G. Subramanian
EECS Dept., Northwestern University
Murat Alanyali
ECE Dept., Boston University
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. INTRODUCTION
It was recently shown that CSMA-based random access
schemes can achieve the full throughput region under the
protocol model of interference [1], [2]. Here a collection of
n wireless links are considered under a conflict graph G
which stipulates that no two neighbors in G may transmit

  

Source: Alanyali, Murat - Department of Electrical and Computer Engineering, Boston University

 

Collections: Engineering