Time-distance path recommendation mechanisms for vanets

Abstract

In most of modern cities and urban areas, roads have been constructed following Manhattan layout. The grid layout of Manhattan introduces many different paths that could be followed towards each vehicle's targeted destination. Different from other works that consider a centralized server, this paper aims at introducing three distributed and real-time path recommendation mechanisms for VANETs. The introduced mechanisms aim to find the fastest path towards each destination without significantly increasing the vehicle's traveling distance.