On the Catalyzing Effect of Randomness on the Per-Flow Throughput in Wireless Networks

2013/07/27 by Ciucu, Florin, Schmitt, Jens
#FOS: Computer and information sciences #Performance (cs.PF)

paper · doi:10.48550/arxiv.1307.7271

Abstract

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 N_j inside hops' interference sets, 2) the number of hops K, and 3) the degree of spatial correlations. The randomness in both N_j'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.

Related

• Flow-level performance of random wireless networks
• Resolving the Connectivity-Throughput Trade-Off in Random Networks
• Throughput Scaling in Random Wireless Networks: A Non-Hierarchical Multipath Routing Strategy
• Counting k-Hop Paths in the Random Connection Model
• On Multiflows in Random Unit-Disk Graphs, and the Capacity of Some Wireless Networks