scholarly journals A routing protocol for urban vehicular ad hoc networks to support non-safety applications

2018 ◽  
Vol 4 (3) ◽  
pp. 189-199 ◽  
Author(s):  
S.K. Bhoi ◽  
P.M. Khilar ◽  
M. Singh ◽  
R.R. Sahoo ◽  
R.R. Swain
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Hoc Networks ◽  
Safety Applications

GreeAODV: An Energy Efficient Routing Protocol for Vehicular Ad Hoc Networks

2018 ◽  
pp. 670-681 ◽  
Author(s):  
Thar Baker ◽  
Jose M. García-Campos ◽  
Daniel Gutiérrez Reina ◽  
Sergio Toral ◽  
Hissam Tawfik ◽  
...  
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Energy Efficient Routing ◽  
Hoc Networks

A Probabilistic Routing Protocol in VANET

2010 ◽  
Vol 2 (4) ◽  
pp. 21-37 ◽  
Author(s):  
Gongjun Yan ◽  
Stephan Olariu ◽  
Shaharuddin Salleh
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
High Speed ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Probability Model ◽  
Proposed Model ◽  
Probabilistic Routing ◽  
Hoc Networks ◽  
Manet Networks

The key attribute that distinguishes Vehicular Ad hoc Networks (VANET) from Mobile Ad hoc Networks (MANET) is scale. While MANET networks involve up to one hundred nodes and are short lived, being deployed in support of special-purpose operations, VANET networks involve millions of vehicles on thousands of kilometers of highways and city streets. Being mission-driven, MANET mobility is inherently limited by the application at hand. In most MANET applications, mobility occurs at low speed. By contrast, VANET networks involve vehicles that move at high speed, often well beyond what is reasonable or legally stipulated. Given the scale of its mobility and number of actors involved, the topology of VANET is changing constantly and, as a result, both individual links and routing paths are inherently unstable. Motivated by this latter truism, the authors propose a probability model for link duration based on realistic vehicular dynamics and radio propagation assumptions. The paper illustrates how the proposed model can be incorporated in a routing protocol, which results in paths that are easier to construct and maintain. Extensive simulation results confirm that this probabilistic routing protocol results in more easily maintainable paths.

An Efficient Two-Mode Routing Protocol in Dense and Sparse Vehicular Ad Hoc Networks

2015 ◽  
Vol 764-765 ◽  
pp. 817-821
Author(s):  
Ing Chau Chang ◽  
Yuan Fen Wang ◽  
Chien Hsun Li ◽  
Cheng Fu Chou
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Intersection Graph ◽  
Least Cost Path ◽  
Transmission Delays ◽  
Packet Delivery ◽  
Hoc Networks

This paper adopts a two-mode intersection graph-based routing protocol to support efficient packet forwarding for both dense and sparse vehicular ad hoc networks (VANET). We first create an intersection graph (IG) consisting of all connected road segments, which densities are high enough. Hence, the source vehicle leverages the proposed IG/IG bypass mode to greedily forward unicast packets to the boundary intersection via the least cost path of current IG. We then perform the IG-Ferry mode to spray a limited number of packet copies via relay vehicles to reach the boundary intersection of another IG where the destination vehicle resides. NS2 simulations are conducted to show that the two-mode IG/IG-Ferry outperforms well-known VANET routing protocols, in terms of average packet delivery ratios and end-to-end transmission delays.

Sign in / Sign up

Export Citation Format

Share Document