Abstract |
Given the inherent potential for improvement in road safety, traffic management, and convenience, Vehicular Ad Hoc Networks (VANETs) have garnered significant research interest in recent years. However, high node mobility combined with a lack of infrastructure and stability on such a network renders routing-table based schemes nonviable. Geometric routing protocols provide an attractive solution to the routing problem on VANETs due to their scalability and statelessness. Thus, we apply Concurrent Face Routing (CFR), an asymptotically optimal geometric routing algorithm achieving improved path stretch relative to other known geometric routing algorithms. We consider possible reduction in packet overhead during transmission sessions with the addition of a Backtracking algorithm (CFR+B). Furthermore, we compare CFR+B against other popular routing algorithms such as GPSR, GOAFR+, AODV, DSR, and flooding via simulation with parameters including node density and session length.
|