An upper bound on multi-hop transmission capacity with dynamic routing selection

Yuxin Chen, Jeffrey G. Andrews

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

This paper develops an upper bound on the end-to-end transmission capacity of multi-hop wireless networks, in which all nodes are randomly distributed. Potential source-destination paths are dynamically selected from a pool of randomly located relays, from which a closed-form bound on the outage probability is derived in terms of the number of potential paths. This in turn gives an upper bound on the number of successful transmissions that can occur per unit area, which is known as the transmission capacity. The upper bound results from assuming independence among the potential paths, and can be viewed as the maximum diversity case. A useful aspect of the upper bound is its simple form for an arbitrary-sized network, which allows us to immediately observe how the number of hops and other network traits affect spatial throughput. Our analysis indicates that predetermined routing approach (such as nearest-neighbor) cannot achieve optimal throughput: more hops are not necessarily helpful in interference-limited networks compared with single-hop direct transmission.

Original languageEnglish (US)
Title of host publication2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
Pages1718-1722
Number of pages5
DOIs
StatePublished - Aug 23 2010
Externally publishedYes
Event2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States
Duration: Jun 13 2010Jun 18 2010

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8103

Other

Other2010 IEEE International Symposium on Information Theory, ISIT 2010
CountryUnited States
CityAustin, TX
Period6/13/106/18/10

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'An upper bound on multi-hop transmission capacity with dynamic routing selection'. Together they form a unique fingerprint.

  • Cite this

    Chen, Y., & Andrews, J. G. (2010). An upper bound on multi-hop transmission capacity with dynamic routing selection. In 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings (pp. 1718-1722). [5513248] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2010.5513248