Capacity results for asymmetric wireless networks

S. Toumpis, A. J. Goldsmith, J. Sayir

Research output: Contribution to conferencePaperpeer-review

6 Scopus citations


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 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 d. If, however, 1/2 < d < 1, an aggregate throughput on the order of n 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 → ∞.

Original languageEnglish (US)
Number of pages4
StatePublished - 2004
Externally publishedYes
Event2004 International Zurich Seminar on Communications: Access - Transmission -Networking - Zurich, Switzerland
Duration: Feb 18 2004Feb 20 2004


Conference2004 International Zurich Seminar on Communications: Access - Transmission -Networking

All Science Journal Classification (ASJC) codes

  • General Computer Science


  • Asymmetric traffic
  • Capacity
  • Wireless ad hoc networks


Dive into the research topics of 'Capacity results for asymmetric wireless networks'. Together they form a unique fingerprint.

Cite this