scholarly journals An Optimized Node Selection Routing Protocol for Vehicular Ad-hoc Networks – A Hybrid Model

2015 ◽  
Vol 11 (2) ◽  
pp. 80
Author(s):  
Thangakumar Jeyaprakash ◽  
Rajeswari Mukesh
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Communication Link ◽  
Link Failure ◽  
Node Selection ◽  
Distance Vector ◽  
Hoc Networks

Vehicular Ad-hoc networks (VANETs) are a subset of Mobile Ad-hoc Networks made by vehicles communicating among themselves on roadways. The Routing protocols implemented for MANETs such as Ad-hoc on Demand Distance Vector Routing Protocol (AODV), Dynamic Source Routing (DSR), and Destination Sequence Distance Vector Routing Protocol (DSDV) are not suitable for VANET due to high Mobility. Trusted routing in VANET is a challenging task due to highly dynamic network topology and openness of wireless architecture. To avoid a frequent communication link failure, to reduce the communication overhead and to provide a trusted routing among the vehicular nodes for achieving high packet transmission, we implemented an Optimized Node Selection Routing protocol (ONSRP) of VANET based on Trust. In our proposed work, we implemented an enhanced routing protocol which prevents the network from communication link failure frequently. The testing results stated that the ONSRP routing have a high performance measures than the above mentioned existing routing protocols.

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.

scholarly journals A Bipolar Traffic Density Awareness Routing Protocol for Vehicular Ad Hoc Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
David Chunhu Li ◽  
Li-Der Chou ◽  
Li-Ming Tseng ◽  
Yi-Ming Chen ◽  
Kai-Wei Kuo
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Path Selection ◽  
Traffic Density ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Hoc Networks

To support an increasing amount of various new applications in vehicular ad hoc networks (VANETs), routing protocol design has become an important research challenge. In this paper, we propose a Bipolar Traffic Density Awareness Routing (BTDAR) protocol for vehicular ad hoc networks. The BTDAR aims at providing reliable and efficient packets delivery for dense and sparse vehicle traffic network environments. Two distinct routing protocols are designed to find an optimal packet delivery path in varied vehicular networks. In dense networks, a link-stability based routing protocol is designed to take vehicles connectivity into consideration in its path selection policy and maximize the stability of intervehicle communications. In sparse networks, a min-delay based routing protocol is proposed to select an optimal route by analyzing intermittent vehicle connectivity and minimize packets delivery latency. Intervehicles connectivity model is analyzed. The performance of BTDAR is examined by comparisons with three distinct VANET routing protocols. Simulation results show that the BTDAR outperforms compared counterpart routing protocols in terms of packet delivery delay and packet delivery ratio.

scholarly journals Performance of Reactive Routing Protocols DSR and AODV in Vehicular Ad-Hoc Networks Based on Quality of Service (Qos) Metrics

2020 ◽  
Vol 9 (4) ◽  
pp. 2033-2039
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Node Density ◽  
Traffic Models ◽  
Reactive Routing ◽  
Hoc Networks

This article analyzes and compares the service quality metrics in reactive routing protocols AODV and DSR in VANET. Through the revision of the recorded information we study the characteristics, classification, applications and different traffic models. All these parameters are taken into account in the modelling of vehicular traffic in the downtown of Loja City. In order to get the corresponding results, three different scenarios each with a different node density have been created. According to the collected data, it is possible to verify which routing protocol is the most suitable for the Ad-Hoc networks proposed in this study.

scholarly journals A collaborative routing protocol for video streaming with fog computing in vehicular ad hoc networks

2019 ◽  
Vol 15 (3) ◽  
pp. 155014771983283 ◽  
Author(s):  
Paulo Bezerra ◽  
Adalberto Melo ◽  
Allan Douglas ◽  
Hugo Santos ◽  
Denis Rosário ◽  
...  
Keyword(s):  
Ad Hoc Networks ◽  
Video Streaming ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Visual Information ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Video Data ◽  
Hoc Networks ◽  
Collaborative Routing

Vehicular ad hoc networks play an important role in the efficiency of road traffic by improving safety and acting as a facilitator of services for passengers, drivers, and public safety officers. Recent improvements in the routing protocols and topologies used in vehicular networks have contributed to improvements in scalability, reliability, and the quality of the information-sharing experience. Vehicles can cooperate with each other to stream videos of accidents or disasters and provide visual information of the monitored area with great precision. This article proposes a collaborative routing protocol for video streaming vehicular ad hoc networks using the service of fog storage to minimize the sharing of content. The routing table is based on an indicator that is generated by combining the speed, location, and recording angle parameters of each vehicle involved in vehicular collaboration to reduce the unnecessary exchange of video data in vehicle-to-vehicle communications. The results of the simulations show that the proposed model performs favorably when compared with other routing protocols with respect to the availability of end-to-end communication.

scholarly journals Greedy Intersection-Mode Routing Strategy Protocol for Vehicular Networks

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Marwan Mahmoud ◽  
Mahmoud Ahmad Al-Khasawneh
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Vehicular Networks ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Strategy ◽  
Hoc Networks ◽  
Intersection Method ◽  
Selection Of

The advantages of vehicular ad hoc networks (VANETs) have been acknowledged, particularly during the last decade. Furthermore, VANET-related issues have been addressed by different researchers. Forwarding information professionally in a VANET is considered a challenging task precisely at the intersections where forwarding the information turns out to be extremely problematic. To elucidate this problem, many researchers have established routing protocols. The improved greedy perimeter stateless routing protocol (IGPSR) has been suggested, in the direction of employing greedy-mode proceeding traditional transportation's streets as well as to employ intersection-method at the joints. In view of greedy mode, the selection of the following stage is as in GPSR. By contrast, in the mode at an intersection, we would expect the vehicle guidelines to govern the following stage. The recreated consequences expose the algorithm, which is anticipated to undeniably demonstrate its competency.

Sign in / Sign up

Export Citation Format

Share Document