A Novel Route Guidance Algorithm with Maximum Coverage and Minimum Handover for Vehicular Networks

In this paper, we propose a novel route guidance algorithm that provides better wireless network availability. Using a GPS device, geographical information is considered to select a short geographical path while ensuring the maximum covered distance and the minimum handovers number. An efficient algorithm is derived to tackle the problem in polynomial time. Our solution is optimal and well suited to all possible scenarios including low and high hotspots density. By comparing our algorithm with some common practices, we minimize significantly the handovers number and decrease the wireless uncovered distance, with a negligible overhead in the traversed distance.

[1]  I. Chabini,et al.  A vehicle-centric logic for decentralized and hybrid route guidance , 2003, Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems.

[2]  F. Benjamin Zhan,et al.  Shortest Path Algorithms: An Evaluation Using Real Road Networks , 1998, Transp. Sci..

[3]  E. Murakami,et al.  Can using global positioning system (GPS) improve trip reporting , 1999 .

[4]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[5]  Wei Zhang,et al.  Dynamic Route Guidance Using Neurodynamic Programming , 2006, Sixth International Conference on Intelligent Systems Design and Applications.

[6]  K. Izumi,et al.  Car navigation with route information sharing for improvement of traffic efficiency , 2004, Proceedings. The 7th International IEEE Conference on Intelligent Transportation Systems (IEEE Cat. No.04TH8749).

[7]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[8]  Sung-Soo Kim,et al.  A study on design of dynamic route guidance system using forecasted travel time based on GPS data and modified shortest path algorithm , 1999, Proceedings 199 IEEE/IEEJ/JSAI International Conference on Intelligent Transportation Systems (Cat. No.99TH8383).