scholarly journals Sparsely-deployed relay node assisted routing algorithm for vehicular ad hoc networks

2013 ◽  
Vol 15 (9) ◽  
pp. 1309-1319 ◽  
Author(s):  
Rui Tian ◽  
Baoxian Zhang ◽  
Cheng Li ◽  
Jian Ma
Keyword(s):  
Ad Hoc Networks ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Relay Node ◽  
Hoc Networks

A prediction-based routing algorithm for Vehicular Ad Hoc Networks

2015 ◽  
Author(s):  
Leandro N. Balico ◽  
Horacio A.B.F. Oliveira ◽  
Raimundo S. Barreto ◽  
Antonio A.F. Loureiro ◽  
Richard W. Pazzi
Keyword(s):  
Ad Hoc Networks ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Hoc Networks

scholarly journals Inter-Vehicular Communications Using Wireless Ad Hoc Networks

2010 ◽  
pp. 120-138 ◽  
Author(s):  
Raúl Aquino-Santos ◽  
Víctor Rangel-Licea ◽  
Miguel A. García-Ruiz ◽  
Apolinar González-Potes ◽  
Omar Álvarez-Cardenas ◽  
...  
Keyword(s):  
Ad Hoc Networks ◽  
Large Scale ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Delivery Ratio ◽  
Test Bed ◽  
Limited Bandwidth ◽  
Hoc Networks ◽  
Large Scale Networks

This chapter proposes a new routing algorithm that allows communication in vehicular ad hoc networks. In vehicular ad hoc networks, the transmitter node cannot determine the immediate future position of the receiving node beforehand. Furthermore, rapid topological changes and limited bandwidth compound the difficulties nodes experience when attempting to exchange position information. The authors first validate their algorithm in a small-scale network with test bed results. Then, for large-scale networks, they compare their protocol with the models of two prominent reactive routing algorithms: Ad-Hoc On-Demand Distance Vector and Dynamic Source Routing on a multi-lane circular dual motorway, representative of motorway driving. Then the authors compare their algorithm with motorway vehicular mobility, a location-based routing algorithm, on a multi-lane circular motorway. This chapter then provides motorway vehicular mobility results of a microscopic traffic model developed in OPNET, which the authors use to evaluate the performance of each protocol in terms of: Route Discovery Time, End to End Delay, Routing Overhead, Overhead, Routing Load, and Delivery Ratio.

scholarly journals W-GPCR Routing Method for Vehicular Ad Hoc Networks

Sensors ◽  
2020 ◽  
Vol 20 (12) ◽  
pp. 3406 ◽  
Author(s):  
Min Li ◽  
Zhiru Gu ◽  
Yonghong Long ◽  
Xiaohua Shu ◽  
Qing Rong ◽  
...  
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Rapid Change ◽  
Relay Node ◽  
Geographic Routing ◽  
Delivery Ratio ◽  
Local Optimum ◽  
Hoc Networks

The high-speed dynamics of nodes and rapid change of network topology in vehicular ad hoc networks (VANETs) pose significant challenges for the design of routing protocols. Because of the unpredictability of VANETs, selecting the appropriate next-hop relay node, which is related to the performance of the routing protocol, is a difficult task. As an effective solution for VANETs, geographic routing has received extensive attention in recent years. The Greedy Perimeter Coordinator Routing (GPCR) protocol is a widely adopted position-based routing protocol. In this paper, to improve the performance in sparse networks, the local optimum, and the routing loop in the GPCR protocol, the Weighted-GPCR (W-GPCR) protocol is proposed. Firstly, the relationship between vehicle node routing and other parameters, such as the Euclidean distance between node pairs, driving direction, and density, is analyzed. Secondly, the composite parameter weighted model is established and the calculation method is designed for the existing routing problems; the weighted parameter ratio is selected adaptively in different scenarios, so as to obtain the optimal next-hop relay node. In order to verify the performance of the W-GPCR method, the proposed method is compared with existing methods, such as the traditional Geographic Perimeter Stateless Routing (GPSR) protocol and GPCR. Results show that this method is superior in terms of the package delivery ratio, end-to-end delay, and average hop count.

A new position based routing algorithm for vehicular ad hoc networks

2015 ◽  
Vol 75 (2) ◽  
pp. 205-220 ◽  
Author(s):  
Ravi Shankar Shukla ◽  
Neeraj Tyagi ◽  
Ashutosh Gupta ◽  
Kamlesh Kumar Dubey
Keyword(s):  
Ad Hoc Networks ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Hoc Networks
Sign in / Sign up

Export Citation Format

Share Document