scholarly journals Routing in Vehicular Ad Hoc Networks: Main Characteristics and Tendencies

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Joilson Alves Junior ◽  
Emilio C. G. Wille

The message routing in vehicular ad hoc networks (VANETs) is an attractive and promising area for research. These networks do not have a central coordination, the nodes are mobile, and the topology is highly dynamic, making the routing process a big challenge, since it is responsible for ensuring message delivery with small overhead and delay. In the literature, there are several routing protocols that can be used in VANETs; in this way, the main objective of this work is to classify, discuss, and compare such protocols through a review of research in this field. The protocol classification is based on the following criteria: type of architecture and mode of operation. Moreover, this work emphasizes the potential of the application of bioinspired and bus-based techniques in the routing problem solutions, which has been revealed as a main tendency nowadays. Bioinspired routing protocols are based on the behavior of entities in the nature, and they are meant to work in a distributed mode, using mobile agents to find routes with specific features. In a parallel line of research, the differentiated behavior of urban transport vehicles suggests that a system that makes use of buses to create a communication infrastructure can perform better when compared to a system that does not distinguish between vehicles.

Author(s):  
Yuh-Shyan Chen ◽  
Yun-Wei Lin

Vehicular Ad hoc Network (VANET), a subclass of mobile ad hoc networks (MANETs), is a promising approach for the intelligent transportation system (ITS). The design of routing protocols in VANETs is important and necessary issue for support the smart ITS. The key difference of VANET and MANET is the special mobility pattern and rapidly changeable topology. It is not effectively applied the existing routing protocols of MANETs into VANETs. In this chapter, we mainly survey new routing results in VANET. The authors introduce unicast protocol, multicast protocol, geocast protocol, mobicast protocol, and broadcast protocol. It is observed that carry-and-forward is the new and key consideration for designing all routing protocols in VANETs. With the consideration of multi-hop forwarding and carryand- forward techniques, min-delay and delay-bounded routing protocols for VANETs are discussed in VANETs. Besides, the temporary network fragmentation problem and the broadcast storm problem are further considered for designing routing protocols in VANETs. The temporary network fragmentation problem caused by rapidly changeable topology influence on the performance of data transmissions. The broadcast storm problem seriously affects the successful rate of message delivery in VANETs. The key challenge is to overcome these problems to provide routing protocols with the low communication delay, the low communication overhead, and the low time complexity.


2016 ◽  
pp. 105-108
Author(s):  
Chia-Ho Ou ◽  
Chih-Feng Chao ◽  
Wei-Pu He ◽  
Chong-Min Gao

Sensors ◽  
2022 ◽  
Vol 22 (2) ◽  
pp. 643
Author(s):  
Muhammad Bilal Latif ◽  
Feng Liu ◽  
Kai Liu

An autonomous driving environment poses a very stringent requirement for the timely delivery of safety messages in vehicular ad hoc networks (VANETs). Time division multiple access (TDMA)-based medium access control (MAC) protocols are considered a promising solution because of their time-bound message delivery. However, in the event of mobility-caused packet collisions, they may experience an unpredicted and extended delay in delivering messages, which can cause catastrophic accidents. To solve this problem, a distributed TDMA-based MAC protocol with mobility-caused collision mitigation (MCCM-MAC) is presented in this paper. The protocol uses a novel mechanism to detect merging collisions and mitigates them by avoiding subsequent access collisions. One vehicle in the merging collisions retains the time slot, and the others release the slot. The common neighboring vehicles can timely suggest a suitable new time slot for the vacating vehicles, which can avoid access collisions between their packet transmissions. A tie-breakup mechanism is employed to avoid further access collisions. Simulation results show that the proposed protocol reduces packet loss more than the existing methods. Consequently, the average delay between the successfully delivered periodic messages is also reduced.


Author(s):  
Indrani Das ◽  
Sanjoy Das

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.


Electronics ◽  
2020 ◽  
Vol 9 (12) ◽  
pp. 2010
Author(s):  
Daniel Domingos Adriano ◽  
Carlos Montez ◽  
Antonio G. N. Novaes ◽  
Michelle Wangham

Milk-run tours with time windows are an essential strategy to collect goods to minimize production and transportation costs. Due to unexpected events at the supplier production or traffic congestion, delays can occur during the vehicle route execution, causing non-compliance between the logistics operator and the company. This paper describes the DMRVR (Dynamic Milk-Run Vehicle Routing) solution that uses a dynamic routing algorithm along with fog-based vehicular ad hoc networks for implementing the collection of goods in milk-run operations that respect the company’s time window. When a production delay occurs, the supplier sends a message through the vehicular network to alert the pickup vehicle, forcing it to make dynamic route changes to satisfy the constraints. We have implemented a queue with a timeout and retransmission features to improve the vehicular network’s message delivery. To assess the DMRVR solution, we analyzed the efficiency of the dynamic vehicle routing and the vehicular network impacts. In the experiments, we used an event-based network simulator OMNeT++ bidirectionally coupled with SUMO (Simulation of Urban Mobility), aiming to make the most realistic simulations. Simulation results show the average route time was lower than the time limit imposed by the company with the DMRVR solution. In dense vehicular network scenarios, the message delivery success rate is higher. Conversely, when the vehicular network scenario is sparse, it is necessary to balance network coverage and distribute more RSUs in specific places.


2015 ◽  
Vol 764-765 ◽  
pp. 817-821
Author(s):  
Ing Chau Chang ◽  
Yuan Fen Wang ◽  
Chien Hsun Li ◽  
Cheng Fu Chou

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