Re-Broadcast AODV(reAODV) Based Routing Protocol Modification Over AODV for VANET In City Scenario

2018 ◽  
Vol 9 (1) ◽  
pp. 51-65
Author(s):  
Soumen Saha ◽  
Utpal Roy ◽  
D.D. Sinha

Vehicular ad-hoc networks or VANETs are a new method of training an ad-hoc network in traffic. The authors have numbers of routing algorithms on a MANET. But none of them works efficiently in a VANET with respect to being a safe and secure transport system. The authors have proposed a modification on an AODV routing algorithm for VANET with the introduction of the double-ended queue or dqAODV in a request packet header. A comparable good result was found in the throughput. In the present work, the authors introduce a modification of an original AODV by applying a partial re-broadcast of the request packet (RREQ) of an AODV. They found a comparable result in the throughput of the packet delivery aspect for this work with the original algorithm and dqAODV. This is compared to the complexity in the original AODV algorithm.

2018 ◽  
Vol 7 (3) ◽  
pp. 1674
Author(s):  
Dania Mohammed ◽  
Ahmed Ghanim Wadday

the successful solutions used to manage traffic at intersections is the Vehicular ad hoc Network (VANET). The main problems in VANET are the preparation of the blocked route, repeated topology differences, and continuous vehicle movement. These problems are difficult to route data towards destinations. To work around this problem, use the Position-Based Routing Protocol (MDORA) name. One of the objectives of this protocol is to choose the best way to rely on the jump by the jump and on the footing of the farthest dis-tance of the interface from the source, thus ensuring the full transfer of data. This protocol reduces frequent connections by detecting the following packets and sending packets without first discovering the path. The environment is simulated by the Matlab program to show protocol results. The random distribution of nodes generation in the simulation environment has been changed in order to change con-tract locations compared to the first state of simulation and to show new result in second state of the protocol. as well The time unit value is also changed to reach the ratio of the number of dropped packets.  


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.


2017 ◽  
Vol 11 (5) ◽  
pp. 30 ◽  
Author(s):  
Zaid A. Abdulkader ◽  
Azizol Abdullah ◽  
Mohd Taufik Abdullah ◽  
Zuriati Ahmad Zukarnain

Vehicular ad hoc network (VANET) technologies are evolving networked communications advances that incorporate mobile-based routing protocol sets for inter-vehicular exchanges of information in support of smart transportation networks. Privacy and security difficulties are primary concerns in VANET research as a result of the repeated vehicular movements, time-critical responses, and hybrid VANET architectures that differentiate these from other ad hoc networking types. Therefore, the design of secure mechanisms for authenticating and validating message transmissions between vehicles and eliminating adversarial elements from networks are of considerable importance in VANET research. This report offers a review of VANET features and security difficulties. The paper also summarizes certain chief threats to the authentication, confidentiality, and availability of secure services.


Author(s):  
Linna Oktaviana Sari ◽  
Agusurio Azmi ◽  
Ery Safrianti ◽  
Feranita Jalil

Pekanbaru city is a large area, therefore traffic congestion often occurs due to the density of society’s vehicles. From this problem, it is needed a technology that can exchange information between vehicles. Information Technology that can involve many vehicles with special network types without dependence on an infrastructure is Ad Hoc Network. One type of this network is Vehicular Ad Hoc Network (VANET). VANET is a new concept in enabling communication between Vehicle to Vehicle (V2V). For efficient data packet delivery, VANET requires a routing protocol. In this research, for simulated and analyzed performance is used the Dynamic Source Routing (DSR) and Temporally Ordered Routing Algorithm (TORA) protocol. NS-2 is used to simulated a moved nodes, SUMO software is used to simulated real map of SKA Mall crossroad and parameter the quality of performance routing protocol DSR can determined by End to End Delay, Packet Delivery Ratio (PDR) and Routing Overhead (RO). This simulation uses scenario 100 nodes, 150 nodes, 200 nodes and 250 nodes. The simulation results with the scenario of changing the number of nodes, the DSR routing protocol produces better performance with an average of  End to End Delay is 0.1066 s, average of PDR is 95.45% and average of RO is 1.0076. While the TORA routing protocol has an average of End to End Delay is 0.1163s, average of PDR is 93.49% and average of RO is 1.0801. And in the scenario of node speed changes, the TORA routing protocol produces better performance with an average of End to End Delay is 0.0861 s and average of PDR 97.37%. While the DSR routing protocol is better with an average of RO is 1.0076.


Author(s):  
Shrirang Ambaji Kulkarni ◽  
G. Raghavendra Rao

Vehicular Ad Hoc Networks represent a specialized application of Mobile Ad Hoc Networks. Here the mobile nodes move in lanes and their mobility can be modeled based on realistic traffic scenarios. To meet the above challenge the goal of defining the mobility model for vehicular ad hoc network along with a realistic traffic pattern is an important research area. Vehicular mobility is characterized by acceleration, deceleration, possibility of different lanes and intelligent driving patterns. Also a modeling of traffic is necessary to evaluate a vehicular ad hoc network in a highway environment. The traffic model has to take into account the driver behavior in order to take decisions of when to overtake, change lanes, accelerate and decelerate. To overcome the limitation of traditional mobility models and mimic traffic models, many traffic model based simulators like CORSIM, PARAMICS and MOVE have been proposed. In this chapter we provide taxonomy of mobility models and analyze their implications. To study the impact of mobility model on routing protocol for vehicular motion of nodes we analyze the performance of mobility models with suitable metrics and study their correlation with routing protocol. We also discuss the fundamentals of traffic engineering and provide an insight into traffic dynamics with the Intelligent Driver Model along with its lane changing behavior.


2018 ◽  
Vol 7 (2.26) ◽  
pp. 35
Author(s):  
Miss Divya ◽  
Dr R. Gobinath

This paper describes the characteristics and techniques of Ad Hoc network. Ad Hoc networks are temporary network, set anywhere with-out any need of external infrastructure like wires. The essential premise of this paper is to exchange confidential message over wireless medium without route break and unauthorized eavesdroppers. In recent years, the research of routing protocol for AdHoc network has caused public concern widely. The multi hopping routing protocol has failed to meet the needs of network topology and route restructure. It must also consider the bandwidth and high error rate. The new routing protocol suitable for solving these problems in Ad Hoc network is AODV. 


Now a day’s mobile ad-hoc network (MANET) is engaged by numerous scientists and endeavoring to be conveyed by and by. To accomplish this objective, these two components are a significant issue that we need to consider. The first is "overhead". As it were, messages that is not important to be sent when setting up a system association between versatile hubs. The following issue is the parcel sending rate from source to the goal hub that sufficiently high to ensure a successful system association. This paper is concentrating on improving the exhibition of the Location-Aided Routing Protocol (LAR) regarding overhead decrease by adjusting the calculation of the MANET course disclosure process. The consequence of the reproduction shows that the proposed convention can decrease overhead definitely, growing system lifetime and increment parcel sending rate while contrasting and other traditional conventions.


2015 ◽  
Vol 738-739 ◽  
pp. 1115-1118
Author(s):  
Li Cui Zhang ◽  
Xiao Nan Zhu ◽  
Zhi Gang Wang ◽  
Guang Hui Han

Considering the shortcoming of the traditional Greedy Perimeter Stateless Routing Protocol in the Vehicular Ad hoc Networks ,this paper focuses on an improved GPSR protocol based on the density of vehicle flow .This new scheme includes macro-directing algorithm , micro-forwarding strategy and the maintenance of the neighbor list.The simulation result shows that compared with the traditional GPSR protocol, the new GPSR protocol improves data packet delivery ratio, but its average end-to-end delay is slightly larger than before.


2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
David Chunhu Li ◽  
Li-Der Chou ◽  
Li-Ming Tseng ◽  
Yi-Ming Chen ◽  
Kai-Wei Kuo

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.


Vehicular ad-hoc networks VANETs has become one of the great research topics related to automotive industry, as they are the suitable way to describe the real scenarios of the car movement through our daily life. Routing protocols used in the network description of a vehicular ad-hoc network are to balance between the responsiveness of the network to the rapid change of the topology and bandwidth efficiency. Different approaches for routing protocols are introduced to address the routing strategies to be followed in the constructed vehicular ad-hoc network considering its perspective of the routing algorithm to be followed. Each approach is consists of different routing protocols that inherits the main theme of the parent approach. Evaluating the measurements for each approach is very important for the developer of the network through network simulation prior to the expensive direct implementation of the vehicular ad-hoc networks. In this paper, we will discuss three main routing approaches: reactive, proactive and position based routing protocols, discussing the main theme for each approach followed by analytical simulations for three different protocols representing the three approaches. Ad-hoc on demand vector AODV representing the reactive approach, destination-sequenced distance vector DSDV representing the proactive approach and greedy perimeter stateless routing GPSR representing the position based approach.


Sign in / Sign up

Export Citation Format

Share Document