Random Graph Models and the Limits of Scalability in Ad Hoc and Sensor Networks
Reference29 articles.
1. A. Agarwal and P.R. Kumar, “Improved Capacity Bounds for Wireless Networks”, Wireless Communications and Mobile Computing, 4(2004), pp. 251–261.
2. M.J.B. Appel and R.P. Russo, “The Minimum Vertex Degree of a Graph on Uniform Points in
$$[0, 1]^d$$
”, Advances in Applied Probability, 29(1997), pp. 582–594.
3. P. Billingsley, Probability and Measure, Wiley, 1979.
4. B. Bollobás, Random Graphs, Second Edition, Cambridge University Press, 2001.
5. C. Cooper and A. Frieze, “On the Connectivity of Random
$$K^{th}$$
Nearest Neighbour Graphs”, Combinatorics, Probability and Computing 4(1996), pp. 343–362.