View article

We establish a tight max-flow min-cut theorem for multicommodity routing in random geometric graphs. We show that, as the number of nodes in the network n tends to infinity, the maximum concurrent flow (MCF) and the minimum cut-capacity scale as Theta(n ² r ³ (n)/k) for a random choice of k ges Theta(n) source-destination pairs, where r(n) is the communication range in the network. We exploit the fact, that the MCF in a random geometric graph equals the interference-free capacity of an ad-hoc network under the protocol model, to derive scaling laws for interference-constrained network capacity. We generalize all existing results reported to date by showing that the per-commodity capacity of the network scales as Theta(1/r(n)k) for the single-packet reception model suggested by Gupta and Kumar, and as Theta(nr(n)/k) for the multiple-packet reception model suggested by others. More importantly, we show that …