Capacity of Large-Scale CSMA Wireless Networks

In the literature, asymptotic studies of multihop wireless network capacity often consider only centralized and deterministic time-division multiple-access (TDMA) coordination schemes. There have been fewer studies of the asymptotic capacity of large-scale wireless networks based on carrier-sensing...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking 2011-06, Vol.19 (3), p.893-906
Main Authors: Chau, Chi-Kin, Chen, Minghua, Liew, Soung Chang
Format: Article
Language:English
Subjects:
Achievable throughput
Aggregates
Asymptotic properties
carrier-sensing multiple access (CSMA)
Carriers
Channels
Computational efficiency
Interference
Multiple access
Networks
Optimization
Protocols
Studies
Throughput
Time division multiple access
Transmitters
Wireless communication
wireless network capacity
Wireless networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the literature, asymptotic studies of multihop wireless network capacity often consider only centralized and deterministic time-division multiple-access (TDMA) coordination schemes. There have been fewer studies of the asymptotic capacity of large-scale wireless networks based on carrier-sensing multiple access (CSMA), which schedules transmissions in a distributed and random manner. With the rapid and widespread adoption of CSMA technology, a critical question is whether CSMA networks can be as scalable as TDMA networks. To answer this question and explore the capacity of CSMA networks, we first formulate the models of CSMA protocols to take into account the unique CSMA characteristics not captured by existing interference models in the literature. These CSMA models determine the feasible states, and consequently the capacity of CSMA networks. We then study the throughput efficiency of CSMA scheduling as compared to TDMA. Finally, we tune the CSMA parameters so as to maximize the throughput to the optimal order. As a result, we show that CSMA can achieve throughput as Ω([1/√( n )]), the same order as optimal centralized TDMA, on uniform random networks. Our CSMA scheme makes use of an efficient backbone-peripheral routing scheme and a careful design of dual carrier-sensing and dual channel scheme. We also address implementation issues of our CSMA scheme.
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2010.2095880