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.
Title
A Novel Approach to Model and Control the Throughput of CSMA/CA Wireless Networks
Published
EECS Department, University of California, University of California at Berkeley, Berkeley, California, January 18, 2009
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
EECS-2009-8
Type
Text
Extent
15 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
