Capacity results for asymmetric wireless networks
Stavros Toumpis, Andrea J. Goldsmith, Jossy Sayir · 2004
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/sup d/ with 0<d< 1/2 , the capacity of the network is affected by the formation of bottlenecks around the destinations, and the maximum aggregate throughput is on the order of n/sup d/. If, however, 1/2 <d<1, an aggregate throughput on the order of n/sup 1/2 / 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/spl rarr//spl infin/.