Vehicular Ad Hoc Networks Routing Protocols Research Articles

IRPanet: Intelligent Routing Protocol in VANET for Dynamic Route Optimization

This paper presents novel routing protocol, IRPANET (Intelligent Routing Protocol in VANET) for Vehicular Adhoc Network (VANET). Vehicular Ad Hoc Networks are special class of Mobile Adhoc Network, created by road vehicles installed with wireless gadgets). Since the environment is dynamic due to high mobility and the topology changes are too frequent, no connection or path can be established between nodes. The issues are challenging for the design of an effective and efficient protocol for such a dynamic environment. This problem can be solved using probabilistic, heuristic and even machine learning based approaches incorporated with store and forward mechanism. Here, we proposed a design framework using heuristics and probabilistic approaches composite with the time series techniques for selecting best and optimize path for forwarding packets using open street map (OSM). Our proposed algorithm uses various parameters (Heuristics Based Routing) for calculating optimal path for packets to be sent, such geographical position (GPS installed in every vehicle), velocity / speed of vehicle, priority of the packets, distances (Euclidean, Haversine, Vicinity) between vehicle, direction of vehicle, communication range of the vehicle, free buffer of nodes and network congestion. These networks can be used for medical emergency, security, entertainment and routing purposes (applications of VANET). These parameters while used in collaboration provide us a very strong and admissible heuristics. We have mathematically proved that the proposed technique is efficient for the routing of packets especially in medical emergency situation.

VANET routing protocol with traffic aware approach

Vehicular ad hoc network (VANET) is a type of mobile ad hoc network (MANET) that forms vehicles as nodes. Routing is the basic fundamental requirement of VANET applications. Therefore, it is necessary to devise a routing protocol that fits well for rapid topology changes and disconnected network conditions. To address these specific needs of VANET, we present a novel greedy routing protocol for vehicular networks called VRPTA that suite well for both city environment and the high way environment. With the help of localisation system named global positioning system (GPS), the proposed protocol is designed to efficiently relay the data in the network by considering different scenarios like road traffic variation and various environment characteristics. The protocol communicates in between vehicles as well as vehicle to infrastructure whichever is applicable, thereby ensuring reliable transmission. In addition, we also consider the information about vehicles speed, direction and density of a city traffic configuration consisting of double direction roads, multi lanes and highway scenario. The work is implemented using NS2 simulator.

A Survey of Vehicular ad Hoc Network Routing Protocols

Vehicular Ad-hoc Network (VANET) is an emerging autonomous dynamic topology network. It is a special kind of Mobile Ad-hoc Network in which the vehicles exchange their information with each other. VANET turns every car in it into a mobile node and use these nodes to create a mobile dynamic network. The purpose of VANET is to supply a wireless connectivity and deploy various applications such as collision avoidance, safety and improving the traffic efficiency as provisioned by the Intelligent Transportation System (ITS). The vehicles are constrained by the realistic traffic environment, and now the simulations are mainly network simulations which cannot simulate the real trace of the vehicle. But as nodes in VANETS have very high mobility, so there are lots of challenges to route the packets to there final destination which need to be addressed by existing/proposing new solutions for the same. Keeping view of above, In this paper, We summarize the existing VANET routing protocols and classify and compare them. Then, We list several classic routing algorithms and analyze their characteristics and advantages and disadvantages. Finally, by analyzing the status quo of vehicle-mounted routing protocols, we illustrate the difficulties and challenges that vehicle-mounted routing protocols will encounter in the future.

A Qualitative Assessment of VANET Routing Protocols Under Different Mobility Models

Vehicular Ad-hoc Networks (VANET) is an advanced wireless network that came to increase traffic safety, efficiency and to improve driving experience. The high mobility of nodes is the major characteristic in these networks. The aim of this paper is to figure out the impact of various mobility models on the performance of Ad-hoc On-demand Distance Vector (AODV), Cluster-Based Directional Routing (CBDR) and Greedy Perimeter Stateless Routing (GPSR) protocols. In this study, we analyze the performance of these routing protocols in different mobility models namely: Street Random Waypoint (STRWP), Gauss Markov and Freeway having varying speed. The simulation results show that STRWP provides a good performance with the three routing protocols in terms of packet delivery ratio, throughput and end to end delay.

Improvement and Performance Evaluation of GPSR-Based Routing Techniques for Vehicular Ad Hoc Networks

Geographic routing has been widely studied over the years as an effective solution for Vehicular Ad Hoc Networks (VANETs), especially because of the availability of wireless devices and global positioning system services. Given the unpredictable behavior of VANETs, selecting the next relay node has been proved a very challenging task. Therefore, in order to maintain acceptable network performance, the routing algorithm needs to be carefully designed to adapt to the fast network changes. The Geographic Perimeter Stateless Routing (GPSR) protocol is a widely adopted position-based routing protocol for VANETs, which makes it a good benchmark candidate. In this paper, we analyze the shortcomings of GPSR and propose a new strategy named Path Aware GPSR (PA-GPSR), which includes additional extension tables in the Neighbors' Table to select the best path and bypass the nodes that have delivered such previous packets in recovery mode. Moreover, our proposed algorithm can eliminate packet routing loops avoiding the delivery of the same packet to the same neighbor node. These PA-GPSR features can, for instance, help to overcome link-breakage due to the unavoidable reasons, such as road accidents or dead-end roads. We used the Simulation of Urban MObility (SUMO) and Network Simulator-version 3 (NS-3) platform to compare our proposed algorithm to the traditional GPSR and Maxduration-Minangle GPSR (MM-GPSR) in scenarios varying the number of nodes as well as the number of source-destination pairs. Our results show that the proposed PA-GPSR strategy performed better than the traditional GPSR and MM-GPSR when packet loss rate, end-to-end delay, and network yield are considered as performance metrics.

Secure Tilted-Rectangular-Shaped Request Zone Location-Aided Routing Protocol (STRS-RZLAR) for Vehicular Ad Hoc Networks

Securing data communication in Vehicular Ad Hoc Networks (VANETs) becomes a demand to provide safe and secure warning messages to drivers. In this paper, a secure routing protocol for VANETs was proposed. The protocol integrates a security unit that adopts a modified Diffie-Hellman key agreement protocol with an optimized location-aided routing protocol (LAR) that adopts a tilted rectangular shaped (TRS) request zone. The proposed Secure Tilted-Rectangular-Shaped Request Zone Location-Aided Routing Protocol (STRS-RZLAR) provides a secure communication between vehicles in VANETs and thus protects the overall communication scheme from man-in-the-middle attack (MITMA). By conducting extensive simulation results using two main network parameters: vehicular node density and the number of the malicious nodes, the proposed routing protocol outperforms the insecure TRS-LAR and the standard LAR in terms of secure data delivery.

Multiobjective Optimized Routing Protocol for VANETs

Vehicular ad hoc network (VANET) routing protocols have been attracting a considerable attention of both research and industrial communities, due to their significant role in intelligent transportation system applications. The present paper adopts an optimized integrated multicast, multicriteria, adaptive route lifetime as a routing protocol for VANETs. Whereby only an optimal subset of neighbor vehicles is chosen to relay route request (RREQ) messages based on distance, direction, speed, and future direction information in a combined sender-receiver manner. Among those selected optimal paths for route discovery, the best route with lowest cost will be chosen for forwarding data packets for a specified duration assigned depending on the obtained cost and number of intermediate vehicles of that route. Fuzzy controllers were employed to assess routes’ costs and their lifetimes. Furthermore, artificial bee colony (ABC) algorithm was used to concurrently optimize all used fuzzy systems and obtain the optimal highest rank of links’ cost values within which the neighbors could be selected as relay nodes in route discovery process. Simulation results prove that the proposed routing scheme significantly improves the network performance in both urban and highway scenarios, under different situations of vehicle density.

VANETs QoS-based routing protocols based on multi-constrained ability to support ITS infotainment services

Vehicular ad hoc networks (VANETs) present an intriguing platform for several applications on e.g., intelligent transportation system (ITS) and infotainment applications aspire to be the main pattern of communication among vehicles while travelling. This can significantly impact on the amount of data exchanged by vehicles, increasing the contention on communication links and thus, degrading the quality of service of these applications. So, discrimination of data becomes imperative and forwarding critical information on suitable routes becomes decisive. Hence, a quality of service (QoS)-driven mechanism is needed to handle and assign network resources according to the stringent application data traffic demands. But, VANETs high node mobility and frequent link failure, stuck a big challenge in implementing an effective policy to meet and enforce these QoS requirements. A promising way to tackle this issue is to enforce QoS at the network layer, since it is the crucial point in VANETs’ communication. So, over the years, many QoS-aware routing protocols were specifically conceived for VANETs. In this paper, we present a comprehensive survey of QoS-aware routing protocols in VANETs’ literature. We examined the protocols based on their ability to support ITS infotainment services, their multi-constraint path problem (MCP), protocol’s functionality and weakness, objectives and design challenges. This way, we outline future directions for VANETs QoS-aware protocol research.

Improvised dynamic network connectivity model for Vehicular Ad-Hoc Networks (VANETs)

The Road traffic modeling in Vehicular Ad Hoc Networks (VANETs) may require disseminating information to specific geographical areas like Road Intersection. The communications, network connectivity and routing are the central issues in VANETs. The Vehicular Ad Hoc Network (VANETs) have high mobility and high density of mobile nodes. Managing this mobility is very important to ensure routing efficiency and network connectivity in VANETs. VANETs are characterized by topology changes and link disconnections. The research challenges for applications of VANETs remains to design of intelligent algorithms for dynamic network connectivity and efficient routing problem in VANETs becomes a challenging event because of the active nature of mobile clients. In this paper, we have proposed an appropriate routing protocol for VANETs based on the dynamic network connectivity behavior of urban traffic at road crossings or Intersection. The dynamic network connectivity model for VANETs is based on parallel processing concept are essential for designing an efficient routing protocol for VANETs at Road Intersection in urban scenarios. Our simulation result showed that different control mechanisms are applied at road crossings and we likened the performance of our proposed scheme with the competitive schemes (Modeling Urban Traffic (MUT) Scheme, Dynamic Connectivity Scheme (DCS), Cellular Automaton Model for Car Traffic (CAMCT) and Dynamic Connectivity-Aware Routing for Internet-based Services (D-CAR)) in terms of Inter-vehicle spacing, number of vehicles in one road block and distance from road crossings or Intersection against varying node density.

Multi‐objective auto‐regressive whale optimisation for traffic‐aware routing in urban VANET

Vehicular ad-hoc network (VANET) is a growing networking concept that has been used increasingly in various applications including traffic alert broadcasting. The main purpose of VANET is to provide safety to the drivers by alerting them to the dangers that may happen. This study presents a traffic-aware routing protocol in VANET by the introduction of multi-objective auto-regressive whale optimisation (ARWO) algorithm. ARWO algorithm selects the best path from the multiple paths by considering the multiple objectives, such as end-to-end delay (EED), link life time, packet delay and distance, in the fitness function. Here, the traffic density and the expected average speed of the vehicle are predicted by the exponential weighted moving average approach. The performance of ARWO protocol is compared with four existing techniques, like stable CDS-based routing protocol, fractional glow worm swarm optimisation, glow worm swarm optimisation, and Whale Optimization Algorithm (WOA), using the metrics, EED, distance, traffic density, and throughput. The simulation results show that the proposed ARWO algorithm achieves EED of 2.941, a distance of 2.15, traffic density of 0.009 and throughput of 0.1, respectively, at maximum constraints, i.e. at a maximum number of vehicles and simulation time and thus proves its efficiency against the comparative protocols.

A greedy traffic light and queue aware routing protocol for urban VANETs

Vehicular Ad-hoc Networks (VANETs) require reliable data dissemination for time-sensitive public safety applications. An efficient routing protocol plays a vital role to achieve satisfactory network performance. It is well known that routing is a challenging problem in VANETs due to the fast-changing network typology caused by high mobility at both ends of transmission. Moreover, under urban environment, there are two non-negligible factors in routing protocol design, the non-uniform vehicle distribution caused by traffic lights, and the network congestion due to high traffic demand in rush hours. In this paper, we propose a greedy traffic light and queue aware routing protocol (GTLQR) which jointly considers the street connectivity, channel quality, relative distance, and queuing delay to alleviate the packet loss caused by vehicle clustering at the intersection and balance the traffic load among vehicles. Through performance evaluation, we show that our proposed protocol outperforms both TLRC and GLSR-L in terms of packet delivery ratio and end-to-end delay.

CISRP: connectivity‐aware intersection‐based shortest path routing protocol for VANETs in urban environments

Vehicular ad hoc networks (VANETs) are a key technology for intelligent transportation system providing different services in safety and entertainment applications. Routing in VANET encounters high mobility of nodes, heterogeneous node distribution and dynamic network topology. These characteristics of the VANET demand a routing protocol capable of inhibiting intermittent connectivity due to network fragmentation. The proposed work is a connectivity-aware intersection-based shortest path routing protocol (CISRP) for VANETs in an urban environment. The CISRP has been designed to look into the prevailing road conditions and route the packets in a less congestion and less link breakage path to avoid intermittent connectivity. The results evaluated show the enhanced performance of the CISRP protocol.

A Traffic Aware Segment-based Routing protocol for VANETs in urban scenarios

Vehicular ad-hoc networks (VANETs) offer a diverse set of applications and therefore gain more and more attention from both academic and industrial communities. However, the deployment of VANETs is not very straight-forward. One challenge is highlighted by an uphill task of establishing and subsequently sustaining a robust communication. The need to obviate extra relay infrastructure in dynamically fluctuating topologies plus concurring shielding obstacles only magnifies this arduous task. In this context, information about traffic-density and about its estimated progress are valuable assets to tackle this issue. This paper proposes a novel routing protocol called Traffic Aware Segment-based Routing (TASR) protocol. The proposed protocol comprises two major parts: 1) Real-time vehicular traffic information for route selection allows for calculating the Expected Connectivity Degree (ECD) on different segments, and 2) a new forwarding method based on geographical information transfers packets from source to destination node. The new metric ECD takes vehicle densities into account, estimating the connectivity on each segment and thus the connectivity of nodes and data delivery ratio for transmitting packets. Furthermore, extensive simulations help analyzing the efficiency of TASR, indicating that it outperforms competing routing protocols.

Dynamic Multiple Junction Selection Based Routing Protocol for VANETs in City Environment

VANET (Vehicular Ad-hoc Network) is an emerging offshoot of MANETs (Mobile Ad-hoc Networks) with highly mobile nodes. It is envisioned to play a vital role in providing safety communications and commercial applications to the on-road public. Establishing an optimal route for vehicles to send packets to their respective destinations in VANETs is challenging because of quick speed of vehicles, dynamic nature of the network, and intermittent connectivity among nodes. This paper presents a novel position based routing technique called Dynamic Multiple Junction Selection based Routing (DMJSR) for the city environment. The novelty of DMJSR as compared to existing approaches comes from its novel dynamic multiple junction selection mechanism and an improved greedy forwarding mechanism based on one-hop neighbors between the junctions. To the best of our knowledge, it is the first ever attempt to study the impact of multiple junction selection mechanism on routing in VANETs. We present a detailed depiction of our protocol and the improvements it brings as compared to existing routing strategies. The simulation study exhibits that our proposed protocol outperforms the existing protocols like Geographic Source Routing Protocol (GSR), Enhanced Greedy Traffic Aware Routing Protocol (E-GyTAR) and Traffic Flow Oriented Routing Protocol (TFOR) in terms of packet delivery ratio, end-to-end delay, and routing overhead.

RESEARCH SURVEY ON VANET ISSUES IN TABLE DRIVEN AND ON DEMAND ROUTING PROTOCOLS

vehicular Ad Hoc Networks (VANET) is derived from Mobile ad hoc networks (MANET) which provide a communications as on unstructured creation of a wireless network for data exchange to the domain of vehicles. The comparative survey of routing protocols in VANET is making main role in wireless network, important and required for Intelligent Transport System (ITS) ITS. This paper we discuss the nature work of various protocols and flaws different routing protocols for vehicular ad hoc networks. It explores the motivation behind the designed, and traces the development of these routing protocols. This paper discusses the table driven and on demand mechanisms. Through this paper we discussed working behaviour of wireless network protocols and disadvantages of existing protocols

An Efficient Cross Layer Routing Protocol for Safety Message Dissemination in VANETS with Reduced Routing Cost and Delay Using IEEE 802.11p

For successful message dissemination in urban vehicular ad hoc networks (VANETs) with reduced route cost and delay is challenging task due to high mobility of the vehicles. Existing cross-layer cooperative routing (CLCR) protocol in VANETs utilizes vast transmission power and increases route cost due to unnecessary broadcast of Hello messages in selecting relay nodes for packet routing. In this paper an enhanced CLCR (ECLCR) with IEEE 802.11p has been proposed, by introducing new mechanism: selecting appropriate relay nodes by calculating neighbor set ratio (NSR) using neighborhood knowledge to acquire more robust route for successful dissemination of packet, then adding a parameter to packet header such as mobility, which can store total network NSR for each route request packet to reduce delay. The performance of the newly proposed algorithm has been evaluated with network simulator-2.34 tool and compare with existing protocols under different conditions. Furthermore, an extensive simulation experiments have been carried out and it is observed that the proposed ECLCR using IEEE 802.11p standard outperforms over existing approaches.

Influence of intersections on the performance of position-based routing protocols for VANETs

PurposeThe vehicular ad hoc network (VANET) is an emerging area for smart cities as observed in last few decades. However, some hurdles for VANET exist that need to be resolved before its full implementation in smart cities. Routing is one of the main factors for having effective communication between smart vehicles that urgently needs to be addressed. One factor that affects communication between the vehicles is the intersection points that obstruct the communication. The paper aims to discuss these issues.Design/methodology/approachThe conventional routing schemes fail to address the intersection problems that occur during the two points of communication. Therefore, this paper analyses the performance of existing position-based routing protocol for inter-vehicle ad hoc networks, considering the impact of a number of intersections. This simulation evaluates different position-based routing protocols such as Intersection-based Distance and Traffic-Aware Routing (IDTAR), Greedy Traffic-Aware Routing, Anchor-based Street and Traffic-Aware Routing and Geographic Source Routing, based on road topology and the number of intersections.FindingsAs a result, the protocol IDTAR has a lower end-to-end delay and high packet delivery ratio in terms of the number of intersections as a case study of smart cities. This concludes that IDTAR can be adaptive to smart cities communication, although some questions need to be considered in terms of its security, compatibility, reliability and robustness.Practical implicationsThe role of VANET has been highlighted in smart cities due to its implications in day-to-day life. The vehicles in VANET are equipped with wireless communication nodes to provide network connectivity. Such types of network operate without the legacy infrastructure, as well as legacy client/servers.Originality/valueAdditionally, the study contributes to smart cities by measuring the performance of position-based routing protocols for VANETs.

Secured AODV Routing Protocol for the Detection and Prevention of Black Hole Attack in VANET

Vehicular ad hoc networks (VANETs) are becoming promising and popular technologies in the recent intelligent transportation world. They are used to provide an Intelligent Transportation System (ITS), efficient Traffic Information System (TIS), and Life Safety. The mobility of the vehicles and the volatile nature of the connections in the network have made VANET vulnerable to many security threats. Black hole attack is one of the security threat in which node presents itself in such a way to the other vehicles that it has the freshest and the shortest path to the destination. Hence in this research paper an efficient approach for the detection and prevention of the Black hole attack in the Vehicular Ad Hoc Networks (VANET) is presented. The proposed solution is implemented on AODV (Ad hoc On demand Distance Vector) routing protocol one of the most popular routing protocol for VANET. The proposed strategy can detect both the single and the Cooperative Black hole attacks in the early phase of route discovery. The simulation is carried on NS-2 and the results of the proposed scheme are compared to the fundamental DYMO routing protocol, this results are examined on various network performance metrics such as packet delivery ratio, throughput and end-to-end delay. The found results show the efficiency of the proposed method as the delivery ratio and end to end delay of the network does not deteriorate under a black hole attack.

Secured AODV Routing Protocol for the Detection and Prevention of Black Hole Attack in VANET

Vehicular ad hoc networks (VANETs) are becoming promising and popular technologies in the recent intelligent transportation world. They are used to provide an Intelligent Transportation System (ITS), efficient Traffic Information System (TIS), and Life Safety. The mobility of the vehicles and the volatile nature of the connections in the network have made VANET vulnerable to many security threats. Black hole attack is one of the security threat in which node presents itself in such a way to the other vehicles that it has the freshest and the shortest path to the destination. Hence in this research paper an efficient approach for the detection and prevention of the Black hole attack in the Vehicular Ad Hoc Networks (VANET) is presented. The proposed solution is implemented on AODV (Ad hoc On demand Distance Vector) routing protocol one of the most popular routing protocol for VANET. The proposed strategy can detect both the single and the Cooperative Black hole attacks in the early phase of route discovery. The simulation is carried on NS-2 and the results of the proposed scheme are compared to the fundamental DYMO routing protocol, this results are examined on various network performance metrics such as packet delivery ratio, throughput and end-to-end delay. The found results show the efficiency of the proposed method as the delivery ratio and end to end delay of the network does not deteriorate under a black hole attack.

Performance analysis of various link estimation time methods in vehicular ad hoc network

The primary work of vehicular ad hoc network (VANET) is to route the packets and to can handle a high mobility of vehicles in the frequently changing topology. The fast dynamic changing topology is the major problem in VANET, so it is necessary to compute the link estimation time (LET) of every relay node in the network. The LET is one of the recent research finding to solve VANET routing issues. This paper depicts the overall survey of different V2V (or) V2I link estimation techniques developed for VANET and also compare the Position based protocol, cross-layer and prediction based protocol. The objective of this paper is to analyse the performance of the different protocols by applying various types of LET in terms of speed, distance and signal and noise rate (SNR) using NS3. The results show that cross-layer protocol has significant performance than comparing to other routing protocols in VANET with the help of plotted graph.