Abstract—In this paper, we propose a two purpose structure that can do vehicle navigating and packet routing simultaneously in an efficient way. The algorithm suggests the shortest travel time path to the drivers and finds reliable routes for traffic information messages. In order to reduce traveling time, vehicles are directed to the paths with lower car congestion. Because such paths have a higher risk of radio coverage partitioning, it is more desired to disseminate traffic information packets from routes that have more probability of radio connectivity, to increase successful ratio on delivering messages. For this purposes, it is necessary to assess vehicles distribution on city roads periodically to evaluate real-time car congestion and radio connectivity of roads. The peer-to-peer layer is constructed in a fast and simple way, without any overhead or extra message exchanging between nodes. The system can optimally save the limited bandwidth of vehicular network as well as reducing the travel time of vehicles. Due to completely cooperative characteristic of this system, there is no need to install any infrastructure at road network.
Index Terms—Two-purpose, VANET, ITS, TIS, navigation, routing.
Ali Asghar Valibak, Nik Mohammad Balouchzahi, Mahmood Fathy, Ahmad Akbari are with the Department of Computer Engineering, Iran University of Science and Technology, Tehran, Iran (e-mail: valibak@gmail.com, balouchzahi@iust.ac.ir, mahfathy@iust.ac.ir, akbari@iust.ac.ir).
Kaamran Raahemifar is with the Department of Electrical and Computer Engineering, Ryerson University, Toronto, Ontario, Canada (e-mail: kraahemi@ee.ryerson.ca).
[PDF]
Cite: Ali Asghar Valibak, Nik Mohammad Balouchzahi, Kaamran Raahemifar, Mahmood Fathy, and Ahmad Akbari, "An Optimized Two-Purpose Peer-to-Peer VANET to Disseminate Traffic Information and Reduce Travel Time," International Journal of Future Computer and Communication vol. 4, no. 1, pp. 1-6, 2015.
