K-Connectivity Analysis Of One-Dimensional Linear Vanets

In a 1-D linear vehicular ad hoc network (1-DL-VANET), some vehicles may leave the network (e. g., at highway exits), which may make the 1-DL-VANET disconnected. Thus, it is important to analyze the connectivity of the 1-DL-VANET. When removal of any (k-1) arbitrary nodes from a network does not disconnect the network, the network is said to be k-connected. In this paper, we investigate the k-connectivity of the 1-DL-VANET. Sufficient and necessary conditions are derived for the 1-DL-VANET to be k-connected, and based on this, a method is provided, with the help of matrix decomposition, to obtain expression of the probability of the 1-DL-VANET being k-connected. The expectation of the maximum number of tolerable vehicle departures is also derived. Simulation results confirm the accuracy of our analysis and indicate that the expectation of the maximum number of tolerable vehicle departures almost linearly increases with the total number of vehicles.