Scalable analysis and design of ad hoc networks via random graph theory
András Faragó · 2002
We lay down the foundations of a new approach for the scalable analysis of ad hoc networks, with special regard to the properties of the random network topology. The proposed methodology is rooted in the theory of random graphs, but we significantly extend the conventional random graph model, as in its original form it would be too “sterile ” to capture realistic ad hoc networks. We analyze some fundamental properties of the proposed new, general model and demonstrate that it is capable of solving analysis/design problems which would otherwise be difficult to capture.