New efficient velocity-aware probabilistic route discovery schemes for high mobility Ad hoc networks

• We investigate the impact of the velocity on the probabilistic based broadcast in MANETs.
• Two new velocity aware probabilistic route discovery models have been proposed in this study.
• The proposed algorithms have been examined and have shown superiority against their counterparts.

Most existing route discovery schemes in MANETs are based on probabilistic models by which MANETs usually deploy broadcast mechanisms to discover routes between nodes. This is implemented by flooding the network with routing requests (RREQ) packets which usually result in the well-known broadcast storm problem. Due to the high mobility, frequent breakages are more likely to occur, leading to re-discovering the same routes frequently uncontrolled RREQ packets. Thus, the network may incur more channel contention and high packets collision rate. Existing solutions cannot accommodate the desired performance levels, especially in high mobility. Thus, this paper is the first that considers the velocity vector probabilistic route discovery in MANETs. Two new velocity-aware probabilistic route discovery models are presented to exclude unstable nodes while constructing routes between the source and its destination. The simulation experiments confirm the superiority of the proposed schemes in terms of RREQ packet overhead and link stability.