Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

A Novel Approach to Model and Control the Throughput of CSMA/CA Wireless Networks

Libin Jiang and Jean Walrand

EECS Department
University of California, Berkeley
Technical Report No. UCB/EECS-2009-8
January 18, 2009

http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-8.pdf

In this paper, a novel model is proposed to analyze the throughput of multi-hop CSMA/CA network. Under certain assumptions, a product-form expression is derived for the stationary distribution of the underlying discrete-time Markov chain, and the throughput formula is given for each link. Interestingly, it is shown that the model includes slotted ALOHA, wireless LAN [Bianchi] and idealized CSMA [csma-87] as special cases. Therefore, it not only provides a unified view of the different models but also covers many new cases. Based on the model, we design fully distributed algorithms to improve the throughput and fairness of CSMA/CA networks. In particular, a transmission-length control algorithm is shown to be throughput-optimal (even with collisions), although it has higher overhead than a transmission-probability control algorithm. And a cross-layer algorithm is given to achieve fair bandwidth sharing among different flows. Our analytical results are corroborated by comprehensive simulations.


BibTeX citation:

@techreport{Jiang:EECS-2009-8,
    Author = {Jiang, Libin and Walrand, Jean},
    Title = {A Novel Approach to Model and Control the Throughput of CSMA/CA Wireless Networks},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {2009},
    Month = {Jan},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-8.html},
    Number = {UCB/EECS-2009-8},
    Abstract = {In this paper, a novel model is proposed to analyze the throughput of multi-hop CSMA/CA network. Under certain assumptions, a product-form expression is derived for the stationary distribution of the underlying discrete-time Markov chain, and the throughput formula is given for each link. Interestingly, it is shown that the model includes slotted ALOHA, wireless LAN [Bianchi] and idealized CSMA [csma-87] as special cases. Therefore, it not only provides a unified view of the different models but also covers many new cases. Based on the model, we design fully distributed algorithms to improve the throughput and fairness of CSMA/CA networks. In particular, a transmission-length control algorithm is shown to be throughput-optimal (even with collisions), although it has higher overhead than a transmission-probability control algorithm. And a cross-layer algorithm is given to achieve fair bandwidth sharing among different flows. Our analytical results are corroborated by comprehensive simulations.}
}

EndNote citation:

%0 Report
%A Jiang, Libin
%A Walrand, Jean
%T A Novel Approach to Model and Control the Throughput of CSMA/CA Wireless Networks
%I EECS Department, University of California, Berkeley
%D 2009
%8 January 18
%@ UCB/EECS-2009-8
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-8.html
%F Jiang:EECS-2009-8