Abstract
We study the connectivity properties of an ad hoc network consisting of n nodes each moving according to the Random Waypoint mobility model. In particular, we focus on estimating two quantities, the probability that the network is connected, and the mean durations of the connectivity periods. The accuracy of the approximations is compared against numerical simulations. For the probability of connectivity, an approximation is given that is remarkably accurate. By numerical examples we also show that in sparse network the mobility has a positive effect on connectivity, whereas in dense network the situation becomes the opposite. For the mean length of the connectivity periods results are also accurate in the important region where the probability of connectivity rises rapidly.
We are grateful to Laura Nieminen for the help with the simulations. This work has been supported by the Academy of Finland (grant n:o 74524), the Finnish Defence Forces Technical Research Centre and partly the Nokia Foundation.
Chapter PDF
Similar content being viewed by others
References
C. Bettstetter, G. Resta, and P. Santi, “The node distribution of the random waypoint mobility model for wireless ad hoc networks,” IEEE Trans. on Mobile Computing, vol. 2, no. 1, pp. 25–39, 2003.
J. Yoon, M. Liu, and B. Noble, “Random waypoint considered harmful,” in Proceedings of IEEE INFOCOM, San Fransisco, California, USA, April 2003, pp. 1312–1321.
W. Navidi and T. Camp, “Stationary distributions for the random waypoint mobility model,” IEEE Trans. on Mobile Computing, vol. 3, no. 1, pp. 99–108, 2004.
Esa Hyytiä, Pasi Lassila, and Jorma Virtamo, “Spatial node distribution in the random waypoint mobility model with applications,” submitted for publication, available at http://www.netlab.tkk.fi/julkaisut/bib/, Mar. 2005.
Esa Hyytiä and Jorma Virtamo, “Random waypoint mobility model in cellular networks,” ACM/Kluwer Wireless Networks, 2005, to appear.
M. Sánchez, P. Manzoni, and Z. J. Haas, “Determination of critical transmission range in Ad-Hoc networks,” in Proceedings of Multiaccess Mobility and Teletraffic for Wireless Communications 1999 Workshop (MMT’99), Oct. 1999.
M. D. Penrose, “The longest edge of the random minimal spanning tree,” Annals of Applied Probability, vol. 7, no. 2, pp. 340–361, 1997.
M. D. Penrose, “On k-connectivity for a geometric random graph,” Random Structures and Algorithms, vol. 15, no. 2, pp. 145–164, 1999.
M. D. Penrose, “Extremes for the minimal spanning tree on normally distributed points,” Advances in Applied Probability, vol. 30, no. 3, pp. 628–639, 1998.
Peng-Jun Wan and Chih-Wei Yi, “Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks,” in Proceedings of ACM MobiHoc’ 04, 2004, pp. 1–8, ACM Press.
Christian Bettstetter, “On the connectivity of Ad Hoc networks,” Computer Journal, vol. 47, no. 4, pp. 432–447, July 2004.
H. Koskinen, “A simulation-based method for predicting connectivity in wireless multihop networks,” Telecommunication Systems, vol. 26, no. 2–4, pp. 321–338, June 2004.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Lassila, P., Hyytiä, E., Koskinen, H. (2006). Connectivity Properties of Random Waypoint Mobility Model for Ad Hoc Networks. In: Al Agha, K., Guérin Lassous, I., Pujolle, G. (eds) Challenges in Ad Hoc Networking. Med-Hoc-Net 2005. IFIP International Federation for Information Processing, vol 197. Springer, Boston, MA. https://doi.org/10.1007/0-387-31173-4_18
Download citation
DOI: https://doi.org/10.1007/0-387-31173-4_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-31171-5
Online ISBN: 978-0-387-31173-9
eBook Packages: Computer ScienceComputer Science (R0)