Analysis of Greedy Strategies in Geographic Routing of VANETs

Abstract

The study and creation of networks that are independent of any pre-existing infrastructure has become highly popular in recent years. These networks fall under the category of Vehicular Ad-hoc Networks (VANETs), in which each car takes part in routing by sending data to other vehicles. However, geographic routing attracts VANETs networks because they lack route discovery and routing databases and the accessibility of low-cost GPS systems as well as the advent of the 128-bit address structure of IPv6 have enhanced the advantages of geographical routing over classical routing techniques. Additionally, the proposed algorithms based on greedy routing are the main method for the next hop selection in multi-hop communication for optimal and optimized solution in geographic routing. In this article, the study takes place with a number of hops per route and greedy algorithm selection success ratio in VANETs with source-to-destination pairs. A comparative study is taken out in which LLP affects node density, hop count, and transmission range. Monte Carlo simulations have been done with two important network parameters which are transmission range and node density. This study will be a guideline for the choice of greedy decisions to meet the objectives of network applications.