Date Added: Jul 2009
In this paper, the authors analyze the connectivity dynamics of vehicular ad-hoc networks in a generic signalized urban route. Given the velocity profile of an urban route as a function of space and time, they utilize a fluid model to characterize the general vehicular traffic flow, and a stochastic model to capture the randomness of individual vehicle. From the fluid and stochastic models, they can acquire respectively the densities of the mean number of vehicles along the road and the corresponding distribution. With the knowledge of the vehicular density dynamics, they determine the probability that the communication network is fully connected, i.e., each node can communicate with every other node through a multi-hop path, and the problem is also investigated for a general case of a k-connected network.