Survey on Unicast, Multicast and Broadcast Routing Techniques in Vehicular Ad-hoc Networks – Present and Future
A. Navis Vigilia *
Department of Mathematics, Jyoti Nivas College, Bangalore – 560 095, India.
J. Suresh Suseela
Department of Mathematics, St. John’s College, Tirunelveli – 627 702, India.
*Author to whom correspondence should be addressed.
Abstract
Vehicular Ad hoc Networks are a special form of wireless networks made for vehicles with bidirectional communicating devices. This attracts the concept of ubiquitous and pervasive computing for the future. VANET has received more researchers and has unlocked a path to develop few applications like traffic management, propagation of emergency messages and few user defined applications. VANETs have characteristics like dynamic network structure, node mobility, low processing speed and low memory which needs special attention. These properties facilitate more graph theory algorithms to be applicable in making shortest and best routes between the source and destination. This paper presents a survey on different routing techniques which are operated based on graph theory algorithms. The outcome of this paper may be considered in future to design an efficient routing protocol for VANET.
Keywords: Graph theory, pervasive, shortest path, traffic, ubiquitous, vehicular Ad hoc networks.