A Connectivity-Based Multi-Lane Routing Optimization Algorithm in Vehicular Communication

This paper proposed a connectivity-based multi-lane geographic routing protocol (CGRP) for vehicular ad hoc networks. The proposed CGRP is based on an effective selection of road intersections through which a package must pass from source to destination. The cooperative connectivity probability and delay are taken into consideration when choosing the most suitable path for delay-sensitive safety traffic. Analytical expressions for cooperative connectivity probability is derived based on a three-lanes path model. Geographical forwarding is used to transfer packets between any two intersections on the path, reducing the path sensitivity to individual node movements. Furthermore, forwarding packets between two adjacent intersections also depend on geographic location information. Neighbor nodes’ priority are assigned according to position, speed, direction and other factors. Node with the highest priority will be selected as the next hop. Numerical and simulation results show that the proposed algorithm outperforms the exsiting routing protocols in terms of the end-to-end delay and the number of hops with a little cost of routing overhead in city environments.