Message Transmission Using VANET

Vehicular ad-hoc networks (VANETs) technology has emerged as an important research area over the last few years. Being ad-hoc in nature, VANET is a type of network that is created from the concept of establishing a network of cars for a specific need or situation. VANETs have now been established as reliable networks that vehicles use for communicating on highways or urban environments. While there are great benefits, there are a large number of challenges in VANET such as provisioning of QoS, high connectivity, bandwidth, security to vehicle and individual privacy. Finding the best route from source to destination in a complex and complicated road network is a major challenge because of the traffic conditions in modern cities. This paper presents an application of graph theory in VANET that offers a solution to this problem. We have made use of the Bellman-Ford algorithm and Dijktra algorithm.  This application aims at reducing the total travel time of the message/packet by providing the best route. This paper also includes 2 error correcting codes; the Hamming (7,4) code and the Cyclic Redundancy Check (CRC) that will help detect and correct bit errors while transmitting information in VANET. We have also made use of the Lempel-Ziv-Welch (LZW) Encoding technique to encode the message in its respective bit format before transmission.