Logo image
Back
Random Access Transport Capacity
Journal article   Open access   Peer reviewed

Random Access Transport Capacity

J.G Andrews, S Weber, Marios Kountouris and M Haenggi
IEEE transactions on wireless communications, v 9(6), pp 2101-2111
Jun 2010
DOI: https://doi.org/10.1109/TWC.2010.06.091432
url
https://doi.org/10.1109/TWC.2010.06.091432View
Published, Version of Record (VoR) Open

Abstract

Mathematics Information Theory Computer Science
We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the average maximum rate of successful end-to-end transmissions, multiplied by the communication distance, and normalized by the network area. We show that a simple upper bound on this quantity is computable in closed-form in terms of key network parameters when the number of retransmissions is not restricted and the hops are assumed to be equally spaced on a line between the source and destination. We also derive the optimum number of hops and optimal per hop success probability and show that our result follows the well-known square root scaling law while providing exact expressions for the preconstants, which contain most of the design-relevant network parameters. Numerical results demonstrate that the upper bound is accurate for the purpose of determining the optimal hop count and success (or outage) probability.

Metrics

7 Record Views
72 citations in Web of Science
93 citations in Scopus

Details

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Collaboration types
Domestic collaboration
Web of Science research areas
Engineering, Electrical & Electronic
Telecommunications
Logo image