On the Connectivity of Vehicular Ad Hoc Network Under Various Mobility Scenarios

In this paper, a new mobility metric called generalized speed factor (GSF) is proposed by extending the existing speed factor, which assumes that all vehicles have the same speed at all times. The GSF defines an actual relationship between the inter-vehicle spacing and the relative speed of consecutive vehicles. The vehicle connectivity in three different mobile environments based on GSF is analyzed, i.e., temporal static connectivity, low mobility connectivity, and high mobility connectivity. It is shown that the connectivity probability <inline-formula> <tex-math notation="LaTeX">$P_{c}$ </tex-math></inline-formula> is directly proportional to the mean velocity <inline-formula> <tex-math notation="LaTeX">$\mu _{v}$ </tex-math></inline-formula> up-to a specific threshold <inline-formula> <tex-math notation="LaTeX">$\mu _{\tau }$ </tex-math></inline-formula>, and after <inline-formula> <tex-math notation="LaTeX">$\mu _{\tau }$ </tex-math></inline-formula> the connectivity starts going down. Finally, network connectivity is extended to the best route selecting metric for the most strongly connected route. Simulation results show that a congested network is strongly connected as compared with sparse vehicular ad hoc network.