Abstract
Unlike traditional mobile ad hoc networks, the high node mobility in VANETs can cause frequent network topology changes and fragmentations. As discussed in Sect. 1.3, any change in network topology is directly or indirectly related to the change in distance headways among vehicles. This chapter presents a novel microscopic mobility model to facilitate VANET analysis. Firstly, A discrete-time finite-state Markov chain with state dependent transition probabilities is proposed to model the distance headway. The model captures the time variations of a distance headway and its dependency on distance headway value. Secondly, highway vehicular traffic is simulated using microscopic vehicle traffic simulator, VISSIM. Vehicle trajectory data collected from highways in the U.S. and that simulated by VISSIM are used to demonstrate the validity of the proposed mobility model for three vehicle density ranges. Finally, the proposed mobility model is extended to a group mobility model that describes the time variations of a system of distance headways between two non-consecutive vehicles. Using lumpability theory, a Markov chain with reduced state-space is proposed to represent the mobility of a group of vehicles.
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
Notes
- 1.
Consider an i.i.d. desired vehicle speed with a mean of 100 km per hour and a standard deviation of 10 km per hour, i.e., \(P(\bar{v} \leq 36) = 0.99\). In this case, the choice of τ = 2 s for L s = 20 m, reduces the transition probability of the distance headway to a non-neighboring state to less than 0.0054.
References
X. Chen, L. Li, and Y. Zhang, “A markov model for headway/spacing distribution of road traffic,” IEEE Trans. Intelligent Transportation Systems, vol. 11, no. 4, pp. 773–785, 2010.
Q. Gong, S. Midlam-Mohler, V. Marano, and G. Rizzoni, “An iterative markov chain approach for generating vehicle driving cycles,” SAE Inter. J. Engines, vol. 4, no. 1, pp. 1035–1045, 2011.
K. Abboud and W. Zhuang, “Analysis of communication link lifetime using stochastic microscopic vehicular mobility model,” in Proc. IEEE Globecom, 2013, pp. 383–388.
K. Abboud and W. Zhuang, “Stochastic analysis of single-hop communication link in vehicular ad hoc networks,” IEEE Trans. Intelligent Transportation Systems, vol. 15, no. 5, pp. 2297–2307, 2014.
A. May, Traffic Flow Fundamentals. Prentice Hall, 1990.
M. Krbalek and K. Kittanova, “Theoretical predictions for vehicular headways and their clusters,” Physics: Data Analysis, Statistics and Probability (arXiv), 2012.
L. Li, W. Fa, J. Rui, H. Jian-Ming, and J. Yan, “A new car-following model yielding log-normal type headways distributions,” Chinese Physics B, vol. 19, no. 2, 2010.
Next generation simulation community, vehicle trajectory data sets. http://ngsim-community.org/. Accessed Nov. 4, 2012.
M. Fellendorf and P. Vortisch, “Microscopic traffic flow simulator VISSIM,” Fundamentals of Traffic Simulation, pp. 63–93, 2010.
PTV, “VISSIM 5.40 user manual,” Karlsruhe, Germany, 2012.
K. Abboud and W. Zhuang, “Stochastic modeling of single-hop cluster stability in vehicular ad hoc networks,” IEEE Trans. Vehicular Technology, 2015 (to appear).
K. Abboud and W. Zhuang, “Impact of node mobility on single-hop cluster overlap in vehicular ad hoc networks,” in Proc. ACM MSWiM, 2014, pp. 65–72.
P. Buchholz, “Exact and ordinary lumpability in finite Markov chains,” J. Applied probability, vol. 31, no. 1, pp. 59–75, 1994.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 The Author(s)
About this chapter
Cite this chapter
Abboud, K., Zhuang, W. (2015). Microscopic Vehicle Mobility Model. In: Mobility Modeling for Vehicular Communication Networks. SpringerBriefs in Electrical and Computer Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-25507-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-25507-1_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25505-7
Online ISBN: 978-3-319-25507-1
eBook Packages: Computer ScienceComputer Science (R0)