We find the exact per-node capacity scaling in an extended, distributed wireless network where the node locations are random, the channel attenuation between pairs of nodes exhibits independent random fading, and data forwarding is restricted to multihop delivery. We establish a per-node throughput upper bound equal to (Cmax)/(radicn) (bps)/(Hz), and a constructive lower bound equal to (Cmin)/(radicn) (bps)/(Hz), where Cmaxand Cminare constants andnis the expected number of nodes in the network. The results apply with probability approaching unity asnbecomes large, under independent, frequency flat, fading channel conditions where the tail probability exhibits an exponential decay (e.g., any mixture of line-of-sight and Rayleigh, Rice and Nakagami distributions). Our lower bound is mainly motivated by a clever bond-percolation-based protocol construction, introduced by Franceschetti et al., where it was shown that a per-node throughput equal to a constant times 1/(radicn) (bps)/(Hz) is achievable in networks with random node locations under a deterministic channel gain modeling path-loss and absorption. We extend the result to more realistic channel gain models in which the channel gains are modeled as random due to multipath effects. The protocol systematically leverages multiuser diversity to overcome the added uncertainty. The key to the upper bound is to establish an upper bound for the total network transport capacity. This upper bound proves that, relative to the lower bound construction, any attempt to leverage multiuser diversity further will result in no more than a constant factor of throughput gain.

We consider the problem of achievable per-node throughput in an extended distributed wireless network where the node locations are random and the channel attenuation between pairs of nodes exhibits independent random multipath fading. In [1] a clever protocol construction based on percolation theory was used to show that a per node throughput of a constant times 1/√n bps is achievable with probability approaching one as the expected number of nodes in network, n, becomes large (i.e. w.h.p.), for networks with random node locations and no multipath fading. We use a similar approach to extend the result to a more realistic channel gain model where the channel gains are random due to multipath fading effects. In particular, we show that when the channels are modeled as independent, frequency flat with Rayleigh distributed gains, a throughput of a constant times 1/√n log log n bps/node is achievable w.h.p..

Several recent studies have proposed methods to accelerate the receipt of a file by downloading its parts from different servers in parallel. This paper formulates models for an approach based on receiving only one copy of each of the data packets in a file, while different packets may be obtained from different sources. This approach guarantees faster downloads with lower network use. However, out-of-order arrivals at the receiving side are unavoidable. We present methods to keep out-of-order low to insure more regulated flow of packets to the application. Recent papers indicate that out-of-order arrivals have many unfavorable consequences. A good indicator to the severeness of out-of-order arrival is the resequencing-buffer occupancy. The paper focuses on the analysis of the resequencing-buffer occupancy distribution and on the analysis of the methods used to reduce the occupancy of the buffer.