The problem of determining the number of spatial degrees of freedom (d.o.f.) of the signals carrying information in a wireless network is reduced to the computation of the geometric variation of the environment with respect to the cut through which the information must flow. Physically, this has an appealing interpretation in terms of the diversity induced on the cut by the possible richness of the scattering environment. Mathematically, this variation is expressed as an integral along the cut, which we call cut-set integral, and whose scaling order is evaluated exactly in the case of planar networks embedded in arbitrary three-dimensional (3-D) environments. Presented results shed some new light on the problem of computing the capacity of wireless networks, showing a fundamental limitation imposed by the size of the cut through which the information must flow. In an attempt to remove what may appear as apparent inconsistencies with previous literature, we also discuss how our upper bounds relate to corresponding lower bounds obtained using the techniques of multihop, hierarchical cooperation, and interference alignment.

It is shown using first physical principles and without relying on stochastic fading channel models, that the number of spatial degrees of freedom available in planar wireless networks embedded in a three-dimensional propagation environment is limited by the spatial size of the cut that divides the environment into two parts. Specifically, in the case of propagation inside a cylinder of height h and base area n, containing n communicating source-destination node pairs, the number of available channels is at most proportional to h√n and hence, as the number of nodes increases, the per-user information capacity must follow an inverse square-root of n law.