Capacity of large-scale CSMA wireless networks

Article, Preprint OPEN
Chi-Kin Chau ; Minghua Chen ; Soung Chang Liew (2009)
  • Related identifiers: doi: 10.1145/1614320.1614332, doi: 10.1109/TNET.2010.2095880
  • Subject: C.2.1 | Computer Science - Performance | G.3 | Computer Science - Networking and Internet Architecture
    acm: ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS | Data_CODINGANDINFORMATIONTHEORY
    arxiv: Computer Science::Performance | Computer Science::Information Theory | Computer Science::Networking and Internet Architecture

In the literature, asymptotic studies of multi-hop wireless network capacity often consider only centralized and deterministic TDMA (time-division multi-access) coordination schemes. There have been fewer studies of the asymptotic capacity of large-scale wireless networks based on CSMA (carrier-sensing multi-access), which schedules transmissions in a distributed and random manner. With the rapid and widespread adoption of CSMA technology, a critical question is that 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 $\Omega(\frac{1}{\sqrt{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 the implementation issues of our CSMA scheme.
  • References (24)
    24 references, page 1 of 3

    [1] A. Agarwal and P. R. Kumar. Capacity bounds for ad-hoc and hybrid wireless networks. ACM Computer Communication Review, 34(3):71- 81, July 2004.

    [2] J. G. Andrews, S. Shakkottai, R. Heath, N. Jindal, M. Haenggi, R. Berry, D. Guo, M. Neely, S. Weber, S. Jafar, and A. Yener. Rethinking information theory for mobile ad hoc networks. IEEE Commun. Magazine, 46(12):94-101, December 2008.

    [3] F. Baccelli, B. Blaszczyszyn, and P. Muhlethaler. An Aloha protocol for multihop mobile wireless networks. IEEE Trans. Information Theory, 52(2):421-436, February 2006.

    [4] S. Boyd and L. Vandenberghe. Convex optimization. 2004.

    [5] M. Chen, S. Liew, Z. Shao, and C. Kai. Markov approximation for combinatorial network optimization. In Proc. IEEE INFOCOM, 2010.

    [6] L. Dai and T. T. Lee. Throughput and delay analysis of wireless random access networks. In Proc. CISS, 2008. The long version available on Arxiv: http://arxiv.org/abs/0805.1300.

    [7] M. Durvy, O. Dousse, and P. Thiran. Border effects, fairness, and phase transition in large wireless networks. In Proc. IEEE INFOCOM, 2008.

    [8] M. Franceschetti, O. Dousse, D. N. C. Tse, and P. Thiran. Closing the gap in the capacity of wireless networks via percolation theory. IEEE Trans. Information Theory, 53(3):1009-1018, March 2007.

    [9] M. Franceschetti, M. Migliore, and P. Minero. The capacity of wireless networks: information-theoretic and physical limits. IEEE Trans. Information Theory, 55(8):34133424, August 2009.

    [10] L. Fu, S. C. Liew, and J. Huang. Safe carrier sensing range in CSMA network under physical interference model. Technical report, 2009. http://arxiv.org/abs/0901.3611.

  • Metrics
    No metrics available
Share - Bookmark