Abstract: In recent years, mobile computing and wireless networks have enjoyed a tremendous rise in popularity and technology advancement. The design of smaller and more powerful communication devices is rapidly changing the way humans interact and communicate. Amidst the unprecedented growth of mobile computing, Vehicular ad hoc networks (VANET) have emerged as an import Vehicle field in the wireless arena. Mobile ad hoc network is a collection of mobile nodes that communicates with one another via wireless links without the need for any fixed infrastructure. Due to its dynamic nature, a primary challenge of VANET is the design of effective routing algorithm that can adapt its behavior to frequent and rapid changes in the network. This project will present novel scheme for VANET routing enhancement called the Vehicular Routing Algorithm (VRA). VRA is inspired by the ant-colony optimization heuristics to solve complex problems. It utilizes a collection of mobile agents or “Vehicular” to perform optimal routing activities. These “Vehicular” are simple routing packets that collect and disseminate useful routing information as they travel throughout the network. VRA offers quick adaptation to dynamic link conditions, low processing and memory overhead, low network utilization, and determines unicast routes to destinations within the ad hoc network. By combining the capability of reactive routing with distributed and multipath routing mechanism, VRA displays a satisfactory performance in terms of throughput, packet delivery ratio, delay and overhead. Utilizing the benefits of pheromones, third-party reply model, ring search model, two-way route establishment method, VRA enables optimal path routing, fast route discovery and effective route failure handling.
Keywords: VANET, Automated Traffic lights, Traffic Routing, Ad hoc Network, Automation.