Random access transport capacity
Random access transport capacity
复制标题
DOI：
10.1109/twc.2010.06.091432
复制
发表时间：
2009-09
影响因子：
10.4
通讯作者：
J. Andrews;S. Weber;M. Kountouris;M. Haenggi
中科院分区：
文献类型：
--
作者：
J. Andrews;S. Weber;M. Kountouris;M. Haenggi
我们开发了一个新的度量量化端到端的吞吐量在多跳无线网络，我们长期随机接入传输容量，因为干扰模型假设不协调的传输。该指标量化成功端到端传输的平均最大速率，乘以通信距离，并按网络区域进行归一化。我们表明，一个简单的上限，这个数量是可计算的封闭形式的关键网络参数时，重传的次数不受限制，并假设跳数是等距的源和目的地之间的线。我们还推导出最佳的跳数和最佳的每跳成功概率，并表明我们的结果遵循众所周知的平方根标度律，同时提供精确的表达式的preconstants，其中包含大部分的设计相关的网络参数。数值结果表明，上界是准确的，以确定最佳跳数和成功（或中断）概率的目的。
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.