n source and destination pairs randomly locasted in an area wants to communicate with each other.
We identify exactly the scaling laws of the information theoretic capacity of the network. In the case of dense networks, where the area is fixed, we show that the total capacity of the network scales linearly with n. In the case of extended networks, where the density of nodes is fixed, we show that the capacity scales as n^{2-\alpha/2} for \alpha < 3 and \sqrt{n} for \alpha \ge 3, where \alpha is the power path loss exponent. Thus, much better scaling than multihop can be achieved in dense networks and in extended networks with low attenuation. The performance gain is achieved by intelligent node cooperation and distributed MIMO communication. The key ingredient is a hierarchical architecture for nodal exchange of information for realizing the cooperation
This is joint work with Ayfer Ozgur and Olivier Levesque