The optimal throughput order of wireless ad hoc networks and how to achieve it

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(n2r3(n)/k) for a random choice of k ges Theta(n) source-destination pairs, where r(n) is the communication range in the network. In addition, we show that it is possible to attain this optimal order throughput in interference-constrained networks if nodes are capable of multiple-packet transmission and reception. This result provides an improvement of Theta(nr2(n)) over the highest achieved capacity reported to date. Furthermore, in stark contrast to the conventional wisdom that has evolved from the Gupta-Kumar results, our results show that the capacity of ad-hoc networks can actually increase with n while the communication range tends to zero!

[1]  Hamid R. Sadjadpour,et al.  Challenges: towards truly scalable ad hoc networks , 2007, MobiCom '07.

[2]  Nitin H. Vaidya,et al.  Capacity of multi-channel wireless networks: impact of number of channels and interfaces , 2005, MobiCom '05.

[3]  Oktay Günlük,et al.  A New Min-Cut Max-Flow Ratio for Multicommodity Flows , 2002, SIAM J. Discret. Math..

[4]  Donald F. Towsley,et al.  Bounds on the Gain of Network Coding and Broadcasting in Wireless Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[5]  Hamid R. Sadjadpour,et al.  Many-to-Many Communication: A New Approach for Collaboration in MANETs , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[6]  Oktay Günlük.  A New Min-Cut Max-Flow Ratio for Multicommodity Flows , 2007, SIAM J. Discret. Math..

[7]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[8]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[9]  Devavrat Shah,et al.  Product Multicommodity Flow in Wireless Networks , 2006, IEEE Transactions on Information Theory.

[10]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[11]  Andrea J. Goldsmith,et al.  Capacity regions for wireless ad hoc networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[12]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[13]  Sanjeev R. Kulkarni,et al.  A deterministic approach to throughput scaling in wireless networks , 2002, IEEE Transactions on Information Theory.

[14]  Manfred Kunde.  Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound , 1993, ESA.

[15]  Ayfer Özgür,et al.  Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks , 2006, IEEE Transactions on Information Theory.

[16]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.