Node density and connectivity properties of the random waypoint model

Computer Communications

Volumn 27, Issue 10, 2004, Pages 914-922

  Chu, T ^a   Nikolaidis, I ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Mobile ad hoc networks; Mobility models; Random waypoint model

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ASYMPTOTIC STABILITY; COMPUTER SIMULATION; DEGREES OF FREEDOM (MECHANICS); GRAPH THEORY; NETWORK PROTOCOLS; RANDOM PROCESSES;

MOBILE AD HOC NETWORKS; MOBILITY MODELS; NODE DENSITY; RANDOM WAYPOINT MODEL;

MOBILE TELECOMMUNICATION SYSTEMS;

EID: 1942452344     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2004.01.003     Document Type: Conference Paper

References (16)

1. C. Bettstetter, Smooth is better than sharp: a random mobility model for simulation of wireless networks, Proceedings of the MSWiM 2001, Rome, Italy, July 2001, pp. 19-27.
2. Bollobas B. Random Graphs. second ed. 2001;Cambridge University Press, Cambridge.
3. J. Broch, D.A. Maltz, D. Johnson, Y.-C. Hu, J. Jetcheva, A performance comparison of multi-hop wireless ad hoc network routing protocols, Proceedings of the MOBICOM 1998, Dallas, TX, October 1998, pp. 85-97.
4. Bui-Xuan B., Ferreira A., Jarry A. Computing shortest, fastest, and foremost journeys in dynamic networks. Intl J. Found. Comput. Sci. 14:(2):2003;267-285.
5. A. Faragó, V.R. Syrotiuk, MERIT: a unified framework for routing protocol assessment in mobile ad hoc networks, Proceedings of the MOBICOM 2001, Rome, Italy, July 2001, pp. 53-60.
6. Z. Haas, A new routing protocol for the reconfigurable wireless networks, Proceedings of the ICUPC 1997, San Diego, CA, October 1997, pp. 562-566.
7. X. Hong, M. Gerla, G. Pei, C.-C. Chiang, A group mobility model for ad hoc wireless networks, Proceedings of the MSWiM '99, Seattle, WA, August 1999, pp. 53-60.
8. Y.C. Hu, D.B. Johnson, Caching strategies in on-demand routing protocols for wireless ad hoc networks, Proceedings of the MOBICOM 2000, Boston, MA, August 2000, pp. 231-242.
9. Johnson D., Maltz D. Dynamic source routing in ad hoc wireless networks. Imielinski T., Korth H. Mobile Computing. 1996;153-181 Kluwer Academic Publishers, Dordrecht.
10. L. Kleinrock, J. Silvester, Optimum transmission radii for packet radio networks or why six is a magic number, Proceedings of the IEEE National Telecommunications Conference, Birmingham, Alabama, December 1978, pp. 4.3.1-4.3.5.
11. B. Krishnamachari, S.B. Wicker, R. Bejar, Phase transition phenomena in wireless ad-hoc networks, Proceedings of the Symposium on Ad-Hoc Wireless Networks, IEEE Globecom, 2001.
12. B. Liang, Z.J. Haas, Predictive distance-based mobility management for PCS networks, Proceedings of the INFOCOM '99, New York, NY, March 1999, pp. 1377-1384.
13. C.E. Perkins, E.M. Royer, Ad hoc on-demand distance vector routing, Proceedings of the WMCSA '99, New Orleans, LA, February 1999, pp. 90-100.
14. E.M. Royer, P.M. Melliar-Smith, L.E. Moser, An analysis of the optimum node density for ad hoc mobile networks, Proceedings of the ICC 2001, Helsinki, Finland, June 2001, pp. 857-861.
15. M. Sanchez, P. Manzoni, Z.J. Haas, Determination of critical transmission range in ad-hoc networks, Proceedings of Multiaccess Mobility and Teletraffic for Wireless Communications, Venice, Italy, October 1999.
16. J. Yoon, M. Liu, B. Noble, Random waypoint considered harmful, Proceedings of INFOCOM 2003, San Francisco, CA, April 2003, pp. 1312-1321.