On the catalyzing effect of randomness on the per-flow throughput in wireless networks

On the catalyzing effect of randomness on the per-flow throughput in wireless networks
复制标题

DOI:
10.1109/infocom.2014.6848209
复制
发表时间:
2013-07
期刊:
IEEE INFOCOM 2014 - IEEE Conference on Computer Communications
影响因子:
--
通讯作者:
F. Ciucu;J. Schmitt
F. Ciucu;J. Schmitt
中科院分区:
其他
文献类型:
--
作者:
F. Ciucu;J. Schmitt

文献摘要

被引文献

相似文献

本文研究了一个多跳无线网络中的流量吞吐量,该网络的几何结构具有一般的随机性规律,包括节点密度和跳数的均匀分布、泊松分布和重尾分布。关键的贡献是证明每个流的吞吐量如何取决于1)跳的干扰集内的节点的数量Nj,2)跳的数量K,以及3)空间相关性的程度的分布。Nj和K两者的随机性是有利的,即,它可以产生比在非随机设置中更大的缩放(大到Θ(n))。一个有趣的结果是,每流容量可以表现出相反的行为,网络容量,这是从一个对数下降的随机性的存在。反过来,沿端到端路径的空间相关性沿着是不利的对数项。
This paper investigates the throughput capacity of a flow crossing a multi-hop wireless network, whose geometry is characterized by general randomness laws including Uniform, Poisson, Heavy-Tailed distributions for both the nodes' densities and the number of hops. The key contribution is to demonstrate how the per-flow throughput depends on the distribution of 1) the number of nodes Nj inside hops' interference sets, 2) the number of hops K, and 3) the degree of spatial correlations. The randomness in both Nj's and K is advantageous, i.e., it can yield larger scalings (as large as Θ(n)) than in non-random settings. An interesting consequence is that the per-flow capacity can exhibit the opposite behavior to the network capacity, which was shown to suffer from a logarithmic decrease in the presence of randomness. In turn, spatial correlations along the end-to-end path are detrimental by a logarithmic term.