Greedy Curvemetric-based Routing Protocol for VANETs

摘要

Routing in Vehicular Ad-hoc Networks (VANETs) received an important attention in the recent years, which represents a real challenging task due to dynamic changes in the network topology, high vehicular speed, and city environment characteristics. Moreover, as nodes in VANETs have very high mobility and limited transmission range between nodes which leads to communication breakdown, so there are lots of challenges to route the packets to their final destination. Recently, geographic routing protocols called also position-based routing protocols, which are mostly based on greedy routing, are more suited to highly dynamic and mobile networks. However, this kind of protocols faces greater challenge in city environment due to the radio obstacles such as buildings, trees and other obstacles, which reduce signal quality and decrease the packet successful reception. This paper, provides a detailed description of various existing position-based routing protocols and proposes a novel routing protocol by using the curvemetric distance instead of Euclidean distance to choose next hop, called Greedy Curvemetric Routing Protocol (GCRP). Finally, we evaluated the performance of our proposed routing scheme via simulations in city environment and comopare it with GPSR protocol.