A Survey of Unicast Routing Protocols Based- Greedy Forwarding Strategies for Vehicular Ad–hoc Networks in Urban Scenario
نویسنده
چکیده
A vehicular ad hoc network (VANET) is a new technology that allows vehicles to form a self-organized network without reliance on permanent infrastructure. The characteristics of VANET such as rapid topology changes, high mobility, and frequent link disconnections makes it difficult to design an efficient routing protocol for routing data among vehicle to vehicle communication (V2V). Existing greedy routing protocols for VANET are not efficient to meet every traffic scenario such as low traffic densities. There are large numbers of surveys that have studied different greedy routing protocol categories. We select a limited, but representative number of these surveys to be reviewed in our work. This survey intends to provide a comprehensive review of these categories of greedy routing protocols. In this paper we provide a survey of greedy routing protocols for a vehicular ad-hoc network, and present a timeline of the development of existing greedy routing protocols. We discuss the advantages and disadvantages of these routing protocols and define some current issues and possible directions of future research related to using greedy routing protocols. Finally, we investigate and compare several greedy algorithms designed for urban VANET. A qualitative comparison of these approaches can serve as a guideline for network designers to choose appropriate greedy routing protocols to meet network application objectives.
منابع مشابه
Network Parameters Evaluation in Vehicular Ad-hoc Network (VANET) Routing Protocols for Efficient Message Delivery in City Environment
Abstract- Efficient message delivery in city environment is required to ensure driver’s safety and passenger’s comfortability. In cities of developed nations, routing of data in vehicular Ad hoc Network (VANET) faces many challenges such as radio obstacles, mobility constraints and uneven nodes distribution. These factors primarily makes communication between vehicles complex. To overcome and t...
متن کاملModeling of VANET Technology & Ad-Hoc Routing Protocols Based on High Performance Random Waypoint Models
Today, one of the new technologies in the modern era is Vehicular Ad-hoc Network which has takenenormous attention in the recent years. Because of rapid topology changing and frequent disconnectionmakes it difficult to design an efficient routing protocol for routing data between vehicles, called V2V orvehicle to vehicle communication and vehicle to roadside infrastructure, called V2I. Designin...
متن کاملContention-based forwarding with multi-hop connectivity awareness in vehicular ad-hoc networks
Recent vehicular routing proposals use real-time road traffic density estimates to dynamically select forwarding paths. Estimating the traffic density in vehicular ad hoc networks requires the transmission of additional dedicated messages increasing the communications load. These proposals are generally based on unicast sender-based forwarding schemes. The greedy nature of sender-based forwardi...
متن کاملRouting Protocols for Vehicular Adhoc Networks (VANETs): A Review
Routing in Vehicular Ad hoc Networks is a challenging task due to the unique characteristics of the network such as high mobility of nodes, dynamically changing topology and highly partitioned network. It is a challenge to ensure reliable, continuous and seamless communication in the presence of speeding vehicles. The performance of routing protocols depends on various internal factors such as ...
متن کاملAn Improved Junction-Based Directional Routing Protocol (IJDRP) for VANETs
Vehicular Ad-Hoc Networks (VANETs) is a novel technology that has recently emerged and due to its swift changing topology and high mobility nature, it has become problematic to design an efficient routing protocol in VANETs’ amongst both moving and stationary units. Also, the existing routing algorithms are not very effective to satisfy all requirements of VANETs. This paper explores the need o...
متن کامل