Abstract
The high-level contribution of this paper is a simulation based analysis of the network connectivity, hop count and lifetime of the routes determined for vehicular ad hoc networks (VANETs) using the City Section and Manhattan mobility models. The Random Waypoint mobility model is used as a benchmark in the simulation studies. Two kinds of paths are determined on the sequence of static graphs representing the topology over the duration of the network session: paths with the minimum hop count (using the Dijkstra algorithm) and stable paths with the longest lifetime (using our recently proposed OptPathTrans algorithm). Simulation results indicate that the City Section model provided higher network connectivity compared to the Manhattan model for all the network scenarios. Minimum hop paths and stable paths determined under the Manhattan model have a smaller lifetime and larger hop count compared to those determined using the City Section and Random Waypoint mobility models.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Taleb, T., Ochi, M., Jamalipour, A., Nei, K., Nemoto, Y.: An Efficient Vehicle-Heading Based Routing Protocol for VANET Networks. In: International Wireless Communications and Networking Conference, pp. 2199–2204. IEEE, Las Vegas (2006)
Siva Ram Murthy, C., Manoj, B.S.: Ad Hoc Wireless Networks: Architectures and Protocols. Prentice Hall, Upper Saddle River (2004)
Meghanathan, N., Farago, A.: On the Stability of Paths, Steiner Trees and Connected Dominating Sets in Mobile Ad hoc Networks. Elsevier Ad hoc Networks 6(5), 744–769 (2008)
Bettstetter, C., Hartenstein, H., Perez-Costa, X.: Stochastic Properties of the Random-Way Point Mobility Model. Wireless Networks 10(5), 555–567 (2004)
Camp, T., Boleng, J., Davies, V.: A Survey of Mobility Models for Ad Hoc Network Research. Wireless Communication and Mobile Computing 2(5), 483–502 (2002)
Bai, F., Sadagopan, N., Helmy, A.: IMPORTANT: A Framework to Systematically Analyze the Impact of Mobility on Performance of Routing Protocols for Ad hoc Networks. In: International Conference on Computer Communications, pp. 825–835. IEEE, San Francisco (2003)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press/ McGraw Hill, New York (2001)
Farago, A., Syrotiuk, V.R.: MERIT: A Scalable Approach for Protocol Assessment. Mobile Networks and Applications 8(5), 567–577 (2003)
Abolhasan, M., Wysocki, T., Dutkiewicz, E.: A Review of Routing Protocols for Mobile Ad hoc Networks. Elsevier Ad hoc Networks 2(1), 1–22 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meghanathan, N. (2009). On the Connectivity, Lifetime and Hop Count of Routes Determined Using the City Section and Manhattan Mobility Models for Vehicular Ad Hoc Networks. In: Ranka, S., et al. Contemporary Computing. IC3 2009. Communications in Computer and Information Science, vol 40. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03547-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-03547-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03546-3
Online ISBN: 978-3-642-03547-0
eBook Packages: Computer ScienceComputer Science (R0)