FINDING SHORTEST PATH IN VANET: A SURVEY
V. Vijayakumar 1 R.Sivasangeetha 2 M.Subhalakshmi 3 G.Sumada Iswarya 4N. Danapaquaime5| Journal Title | : | Asian Journal of Multidisciplinary Research |
|---|---|---|
| DOI | : | |
| Page No | : | 1-4 |
| Volume | : | 3 |
| Issue | : | 3 |
| Month/Year | : | 3/2017 |
Keywords
VANET, protocols, message, algorithm, optimal, obstacle.
Abstract
Vehicular Ad hoc Networks (VANET) is an increasing technology among vehicles which provides Intelligent Transport System (ITS) technology. VANET is a subcategory of MANET in which the vehicles act as mobile nodes for transferring data. This in turn increases the importance of bandwidth efficiency by maintaining requirements on energy consumption, delay and throughput. The existing system employs greedy forwarding algorithm in which the message transferred from source to destination by any path. It does not choose the optimum path for transferring message every time so that it doesn’t lead efficient QoS. So far there are many improvements in vehicular advancing features has moved organizations, foundations to focus their activities on enhancing street security and it is of principal need now a days. This article provides the information about finding shortest path in VANET.