Capacity results for asymmetric wireless networks

In this paper, we study wireless ad hoc networks that consist of n source nodes and m destination nodes, placed randomly in a two dimensional area. Each source node is creating data traffic that must be delivered to one of the m destination nodes, chosen at random. When m is on the order of n^d with 0d. If, however, 1/2 12 / is achievable. The scheme that achieves this aggregate throughput does not suffer from the formation of bottlenecks. These results hold under a general model of channel fading, and with probability going to 1 as n→∞.