Excluded minors, network decomposition, and multicommodity flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Cut problems and their application to divide-and-conquer
Approximation algorithms for NP-hard problems
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Capacity bounds for ad hoc and hybrid wireless networks
ACM SIGCOMM Computer Communication Review
Geographic gossip: efficient aggregation for sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
The capacity of wireless networks
IEEE Transactions on Information Theory
A network information theory for wireless communication: scaling laws and optimal operation
IEEE Transactions on Information Theory
Upper bounds to transport capacity of wireless networks
IEEE Transactions on Information Theory
Information-theoretic upper bounds on the capacity of large extended ad hoc wireless networks
IEEE Transactions on Information Theory
Even One-Dimensional Mobility Increases the Capacity of Wireless Networks
IEEE Transactions on Information Theory
On the throughput scaling of wireless relay networks
IEEE Transactions on Information Theory
Network planning in wireless ad hoc networks: a cross-Layer approach
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In this article we propose a set of necessary and sufficient conditions under which the long-term averaged throughput in an ad hoc network can remain constant as the number of nodes n increases. Throughput refers to the minimum achievable rate between a source-destination pair for a given routing mechanism and physical model, when the network is shared by Θ(n) randomly chosen source-destination pairs. The main idea is to use a connectivity graph, which does not represent the actual physical network but rather the available communication resources. This graph also allows one to translate the problem of maximizing the throughput in ad hoc networks to the multicommodity flow problem and directly apply related results.