Connectivity of Ad Hoc networks with random mobility models

We analyze the connectivity of simulation ad hoc networks, which use random mobility models. Based on the theorem of minimum degree, the study of connectivity probability is converted into an analysis of the probability of minimum node degree. Detailed numerical analyses are performed for three mobility models: random waypoint model, random direction model, and random walk model. For each model, the connectivity probability is calculated and its relations with the communication range r and the node number n are illustrated. Results of the analyses show that with the same network settings, the connectivity performance decreases in the following order: random walk model, random direction model, and random waypoint model. This is because of the nonuniform node distribution in the last two models. Our work can be used by researchers to choose, modify, or apply a reasonable mobility model for network simulations.