Logo image
Back
A Simple Upper Bound on Random Access Transport Capacity
Conference proceeding   Open access

A Simple Upper Bound on Random Access Transport Capacity

Jeffrey G. Andrews, Steven Weber, Marios Kountouris, Martin Haenggi and IEEE
2009 47TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1 AND 2, pp 849-856
01 Jan 2009
DOI: https://doi.org/10.1109/ALLERTON.2009.5394951
url
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.831.5798View
SubmittedOpen Access (License Unspecified),  Open

Abstract

Computer Science Computer Science, Theory & Methods Engineering Engineering, Electrical & Electronic Science & Technology Technology Telecommunications
We attempt to quantify end-to-end throughput in multihop wireless networks using a metric that measures the maximum density of source-destination pairs that can successfully communicate over a specified distance at certain data rate. We term this metric the random access transport capacity, since it is similar to transport capacity but the interference model presumes uncoordinated transmissions. A simple upper bound on this quantity is derived 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 which is small and finite and optimal per hop success probability for integer path loss exponents. We show that our result follows the well-known square root scaling law while providing exact expressions for the preconstants as well.

Metrics

10 Record Views
1 citations in Web of Science
2 citations in Scopus

Details

InCites Highlights

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

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