Scalable routing technique using road hierarchy for vehicular networks

In this paper, we describe a new route discovery technique known as scalable routing technique. This technique enhances the performance of the routing protocol density aware routing using road hierarchy (DAR-RH), which involves a route discovery procedure using Dijkstra algorithm before transferring data from source to destination. When DAR-RH is used in large road network scenarios the time complexity increases as Dijkstra algorithm considers all road intersections for route discovery. The solution proposed in this paper minimizes the road intersections to be considered for route discovery by dividing the city in terms of road hierarchies. By restricting Dijkstra algorithm to act on necessary data instead of entire city data shows significant performance improvement and effectiveness of our proposed technique when incorporated in DAR-RH.