Random Access Transport Capacity - Computer Science > Information TheoryReport as inadecuate




Random Access Transport Capacity - Computer Science > Information Theory - Download this document for free, or read online. Document in PDF available to download.

Abstract: We develop a new metric for quantifying end-to-end throughput in multihopwireless networks, which we term random access transport capacity, since theinterference model presumes uncoordinated transmissions. The metric quantifiesthe average maximum rate of successful end-to-end transmissions, multiplied bythe communication distance, and normalized by the network area. We show that asimple upper bound on this quantity is computable in closed-form in terms ofkey network parameters when the number of retransmissions is not restricted andthe hops are assumed to be equally spaced on a line between the source anddestination. We also derive the optimum number of hops and optimal per hopsuccess probability and show that our result follows the well-known square rootscaling law while providing exact expressions for the preconstants as well.Numerical results demonstrate that the upper bound is accurate for the purposeof determining the optimal hop count and success or outage probability.



Author: Jeffrey G. Andrews, Steven Weber, Marios Kountouris, Martin Haenggi

Source: https://arxiv.org/







Related documents