SECON 2004, 1st IEEE International Conference on Sensor and Ad Hoc Communications and Networks, October 4-7, 2004, Santa Clara, USA
We establish lower bounds on the capacity of wireless ad hoc networks with two types of non-uniform traffic patterns. We first focus on the impact of traffic patterns where local communication predominates and show the improvement in terms of per user-capacity over ad hoc networks with unbounded average communication distances. We then study the capacity of hybrid wireless networks, where long-distance relaying is performed by a fixed overlay network of base stations. We investigate the scaling of capacity versus the number of nodes and the density of base stations in the area of the network. The throughput capacity results under these two scenarios hold with probability one as the number of nodes goes to infinity.
Type:
Conference
City:
Santa Clara
Date:
2004-10-04
Department:
Communication systems
Eurecom Ref:
2199
Copyright:
© 2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
See also:
