Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Chi-Kin Chau; Minghua Chen; Soung Chang Liew (2009)
Types: Article,Preprint
Subjects: C.2.1, Computer Science - Performance, G.3, Computer Science - Networking and Internet Architecture

Classified by OpenAIRE into

arxiv: Computer Science::Performance, Computer Science::Networking and Internet Architecture, Computer Science::Information Theory
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.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [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.
    • [11] L. Fu, S. C. Liew, and J. Huang. Effective carrier sensing in csma networks under cumulative interference. In Proc. IEEE INFOCOM, 2010.
    • [12] Y. Gao, D. M. Chiu, and J. C. S. Lui. Determining the end-to-end throughput capacity in multi-hop networks: methodology and applications. In Proc. ACM SIGMETRICS, pages 39-50, 2006.
    • [13] S. Guhu, C.-K. Chau, and P. Basu. Green Wave: Latency and capacityefficient sleep scheduling for wireless networks. In Proc. IEEE INFOCOM, 2010.
    • [14] P. Gupta and P. R. Kumar. The capacity of wireless networks. IEEE Trans. Information Theory, 46(2):388-404, 2000.
    • [15] L. B. Jiang and S. C. Liew. Improving throughput and fairness by reducing exposed and hidden nodes in 802.11 networks. IEEE Trans. Mobile Computing, 7(1):34-49, January 2008.
    • [16] L. B. Jiang and J. Walrand. A distributed CSMA algorithm for throughput and utility maximization in wireless networks. In Proc. Allerton Conf. on Comm., Control, and Computing, 2008.
    • [17] A. Josan, M. Liu, D. Neuhoff, and S. Pradhan. Throughput scaling in random wireless networks: A non-hierarchical multipath routing strategy. In Proc. Allerton, 2007.
    • [18] S. Li, Y. Liu, and X.-Y. Li. Capacity of large scale wireless networks under Gaussian channel model. In Proc. ACM MobiCom, 2008.
    • [19] S. C. Liew, C. Kai, J. Leung, and B. Wong. Back-of-the-envelope computation of throughput distributions in CSMA wireless networks. In Proc. IEEE ICC, 2009. To appear in IEEE Trans. Mobile Computing.
    • [20] P. C. Ng and S. C. Liew. Throughput analysis of IEEE802. 11 multi-hop ad hoc networks. IEEE/ACM Trans. Networking, 15(2):309-322, 2007.
    • [21] A. O¨ zgu¨r, O. Le´veˆque, and D. N. C. Tse. Hierarchical cooperation achieves optimal capacity scaling in ad hoc networks. IEEE Trans. Information Theory, 53(3):3549-3572, October 2007.
    • [22] X. Wang and K. Kar. Throughput modelling and fairness issues in CSMA/CA based ad-hoc networks. In Proc. IEEE INFOCOM, 2005.
    • [23] K. Xu, M. Gerla, and S. Bae. How effective is the IEEE 802.11 RTS/CTS handshake in ad hoc networks. In Proc. IEEE GLOBECOM, 2002.
    • [24] F. Xue and P. R. Kumar. Scaling laws for ad hoc wireless networks: An information theoretic approach. Foundations and Trends in Networking, 1(2):145 - 270, July 2006. 1 − α Proof: Follows from Lemma 14, 5, 7.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article