Capacity bounds for three classes of wireless networks
- 24 May 2004
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 133-144
- https://doi.org/10.1145/989459.989477
Abstract
We present capacity results for three classes of wireless ad hoc networks, using a general framework that allows their unified treatment. The results hold with probability going to 1 as the number of nodes in the network approaches infinity, and under a general model for channel fading.We first study asymmetric networks that consist of n source nodes and around nd destination nodes, communicating over a wireless channel. Each source node creates data traffic that is directed to a destination node chosen at random. When ½ ‹ d ‹ 1, an aggregate throughput that increases with n as n½ is achievable. If, however, 0 ‹ d ‹ ½, bottlenecks are formed and the aggregate throughput can not increase faster than nd.We also consider cluster networks, that consist of n client nodes and around nd cluster heads, communicating over a wireless channel. Each of the clients wants to communicate with one of the cluster heads, but the particular choice of cluster head is not important. In this setting, the maximum aggregate throughput is on the order of nd, and it can be achieved with no transmissions taking place between client nodes.We conclude with the study of hybrid networks. These consist of n wireless nodes and around nd access points. The access points are equipped with wireless transceivers, but are also connected with each other through an independent network of infinite capacity. Their only task is to support the operation of the wireless nodes. When ½ ‹ d ‹ 1, an aggregate throughput on the order of nd is achievable, through the use of the infrastructure. If, however, 0 ‹ d ‹ ½, using the infrastructure offers no significant gain, and the wireless nodes can achieve an aggregate throughput on the order of n½ by using the wireless medium only.Keywords
This publication has 15 references indexed in Scilit:
- Large wireless networks under fading, mobility, and delay constraintsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Throughput-delay trade-off in wireless networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Capacity of power constrained ad-hoc networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Capacity results for asymmetric wireless networksPublished 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
- On the maximum stable throughput problem in random networks with directional antennasPublished by Association for Computing Machinery (ACM) ,2003
- Distributed topology construction of Bluetooth personal area networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Mobility increases the capacity of ad-hoc wireless networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The capacity of wireless networksIEEE Transactions on Information Theory, 2000
- Trellis precoding: combined coding, precoding and shaping for intersymbol interference channelsIEEE Transactions on Information Theory, 1992