scholarly journals A Link Quality Prediction Metric for Location based Routing Protocols under Shadowing and Fading Effects in Vehicular Ad Hoc Networks

2014 ◽  
Vol 34 ◽  
pp. 565-570 ◽  
Author(s):  
Chi Trung Ngo ◽  
Hoon Oh
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocols ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Link Quality ◽  
Quality Prediction ◽  
Hoc Networks ◽  
Link Quality Prediction

Geocast Routing Protocols for Ad-Hoc Networks

2021 ◽  
pp. 23-45
Author(s):  
Indrani Das ◽  
Sanjoy Das
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocols ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Geographical Area ◽  
Destination Node ◽  
Specific Geographical Area ◽  
Fast Network ◽  
Hoc Networks ◽  
Future Direction

Geocasting is a subset of conventional multicasting problem. Geocasting means to deliver a message or data to a specific geographical area. Routing refers to the activities necessary to route a message in its travel from source to the destination node. The routing of a message is very important and relatively difficult problems in the context of Ad-hoc Networks because nodes are moving very fast, network load or traffic patterns, and topology of the network is dynamical changes with time. In this chapter, different geocast routing mechanisms used in both Mobile Ad-hoc Networks and Vehicular Ad-hoc Networks. The authors have shown a strong and in-depth analysis of the strengths and weaknesses of each protocol. For delivering geocast message, both the source and destination nodes use location information. The nodes determine their locations by using the Global Positioning System (GPS). They have presented a comprehensive comparative analysis of existing geocast routing protocols and proposed future direction in designing a new routing protocol addressing the problem.

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