Degree distribution and hopcount in wireless ad-hoc networks

This article is a contribution to mathematical modeling and better understanding of fundamental properties of wireless ad-hoc networks. Our focus in this article is on the degree distribution and hopcount in these networks. The results presented here are useful in the study of connectivity and estimation of the capacity in ad-hoc networks. We model a wireless ad-hoc network as an undirected geometric random graph. For the calculation of the link probability between nodes we have suggested to use a realistic radio model; the socalled log-normal shadowing model. Through a combination of mathematical modeling and simulations we have shown that the degree distribution in wireless ad-hoc networks is binomial for low values of the mean degree. Further, we have investigated the hopcount and have shown that the hopcount in wireless adhoc networks can vary between the expected values for lattice networks and random graphs, depending on radio propagation conditions.

[1]  Josep Díaz Cort,et al.  Random geometric problems on $[0,1]^2$ , 1998 .

[2]  Ramjee Prasad,et al.  Universal wireless personal communications , 1998, Mobile communications series.

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

[4]  Maria J. Serna,et al.  Random Geometric Problems on [0, 1]² , 1998, RANDOM.

[5]  R. Dorf,et al.  The handbook of ad hoc wireless networks , 2003 .

[6]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[7]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[8]  S H Strogatz,et al.  Random graph models of social networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Piet Van Mieghem,et al.  Interference in Wireless Multi-Hop Ad-Hoc Networks and Its Effect on Network Capacity , 2004, Wirel. Networks.

[10]  M. Penrose.  On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.

[11]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  J. Schmee.  Applied Statistics—A Handbook of Techniques , 1984 .

[13]  P. V. Mieghem,et al.  PATHS IN THE SIMPLE RANDOM GRAPH AND THE WAXMAN GRAPH , 2001, Probability in the Engineering and Informational Sciences.

[14]  G Németh,et al.  Giant clusters in random ad hoc networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[16]  Christian Bettstetter,et al.  On the minimum node degree and connectivity of a wireless multihop network , 2002, MobiHoc '02.