A novel route guidance algorithm using beamforming techniques for vehicular networks

Abstract

Route guidance systems become indispensable for car drivers because of its great convenience. To be efficient, these systems require optimal selection of the routes according to the preferences of drivers. In this paper, a novel route guidance algorithm is proposed for vehicular networks (VANETS). It uses the MVDR beamforming technique which can enhance coverage and reduce radio interference in wireless networks. The proposed algorithm aims to optimize coverage and connectivity of drivers to public hotspots while ensuring a reasonable total traversed distance. Performance results show that our algorithm outperforms the route guidance system using omnidirectionnal antennas and the shortest path algorithm.Index Terms-route guidance system, MVDR beamforming, vehicular networks.

Review of algorithms for monitoring urban traffic in smart cities

“…There are several types of shortest path algorithms [15]: Dijkstra algorithm, Floyd-Warshall algorithm, Bellman-Ford algorithm, and Genetic algorithm. One of the most wellknown algorithms for shorter paths is the Dijkstra algorithm, which has proven to be reliable in solving the problem of single-source graphs, directed and non-directed graphs [16]. Dijkstra algorithm in some cases of traffic congestion, do not suggest the shortest path.…”