Latest revision as of 17:13, 3 February 2021

Abstract

Traffic congestion is a very serious problem in large cities. With the number of vehicles increasing rapidly, especially in cities whose economy is booming, the situation is getting even worse. In this paper, by leveraging the techniques of Vehicular Ad hoc Networks (VANETs) we present a dynamic navigation protocol called VAN for individual vehicles to find the shortest-time paths toward their given destinations. Specifically, a vehicle initiates a number of queries, which are routed by VANETs along different paths toward its destination. During query forwarding, the real-time road traffic information in each road segment is aggregated from multiple participating vehicles and returned to the source after the query reaches the destination. This information enables the source to calculate the shortest-time path. We also propose two forwarding optimization methods to reduce communication costs and an error handling mechanism to deal with abnormal circumstances. To evaluate its performance, we use the real traffic data of Beijing, including 2,308 road segments at two different times. Our simulation results demonstrate that our protocol, on average, could save around 30% driving time, compared to traveling along the shortest distance paths.

Original document

The different versions of the original document can be found in:

• http://www.cse.psu.edu/~szhu/papers/van.pdf

• http://www.cse.psu.edu/~sxz16/papers/van.pdf,

https://dblp.uni-trier.de/db/conf/mass/mass2010.html#ChenZL10,

http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005663936,

https://ieeexplore.ieee.org/document/5663936,

https://academic.microsoft.com/#/detail/2059099157

• http://xplorestaging.ieee.org/ielx5/5648202/5663775/05663936.pdf?arnumber=5663936,

http://dx.doi.org/10.1109/mass.2010.5663936