Abstract

This article describes how a vehicular ad-hoc network (VANET) is an infrastructureless network in which vehicles are connected without wires. Routing in VANET is challenging nowadays due to increased number of a vehicle, the high mobility of nodes, dynamically changing topology and highly partitioned network, so the challenges on the roads are also increased like the road congestion, the safety problem, speed, etc. Various protocol designs have been suggested by various authors to search and forward packets to the destination node. These various algorithms use different schemes like greedy forwarding, perimeter forwarding, carry and store approach, geographic location base approach, etc. The proposed system uses both beacon packets and a geographic closure node approach to forward packets. The beacon-based strategy includes a carry and search approach to search for a routing path. Geographic forwarding will start when carry and search forwarding fails to transmit packets. Route requests will perform multicasting while a route reply follows a unicast strategy. The new proposed system achieves good PDR and an end to end delay.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call