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.
Bounds on the throughput capacity of wireless ad hoc network with non-uniform traffic
2004-01-01
927582 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
A quantitative study on traffic network throughput
IEEE | 2003
|A Quantitative Study on Traffic Network Throughput
British Library Conference Proceedings | 2003
|Distributed traffic signal control for maximum network throughput
DSpace@MIT | 2012
|Throughput Capacity Estimation
NTIS | 1975
|