Capacity results for asymmetric wireless networks
- 10 June 2004
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
—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 trafÞc that must be delivered to one of the m destination nodes, chosen at random. When m is on the order of n, 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 →∞ . Index Terms—Asymmetric trafÞc, capacity, wireless ad hoc networks.Keywords
This publication has 4 references indexed in Scilit:
- Large wireless networks under fading, mobility, and delay constraintsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Throughput capacity of random ad hoc networks with infrastructure supportPublished by Association for Computing Machinery (ACM) ,2003
- The capacity of wireless networksIEEE Transactions on Information Theory, 2000
- Randomized AlgorithmsPublished by Cambridge University Press (CUP) ,1995