Routing In Vehicular Ad Hoc Networks Research Articles

MBR: A Map-Based Relaying Algorithm For Reliable Data Transmission Through Intersection in VANETs

In recent years, a number of routing protocols have been proposed for urban vehicular ad-hoc networks (VANETs). Yet, a common issue in these protocols is that the building shadow effect at intersections is not carefully considered. As a result, the performance of these routing protocols may degrade as the data transmission at the intersections can be severely affected by the building shadowing. To solve this problem, in this paper, we propose MBR, a map-based relaying algorithm in the MAC layer, to enhance the performance of the routing protocols in urban VANETs. To improve the reliability of data transmission at intersections, MBR novelly utilizes the digital map and the Geohash coding system to relay the packets (frames) in the MAC layer, and selects the optimal relay node based on the relative position of the nodes and the intersection. In this paper, we propose two versions of the algorithm: MBR-S utilizes a single IEEE 802.11p radio; and MBR utilizes a collaboration of the IEEE 802.11p channel and the Sub-1GHz channel, which has border communication range in the intersections than that of MBR-S. Both our real world experiments and extensive simulations demonstrate that MBR-S can significantly improve the performance of the state-of-the-art VANET routing protocols, which can be further enhanced with the collaboration of two channels.

Modified Ant Colony Optimization (ACO) Algorithm for Routing in Vehicular Adhoc Networks

Vehicular Ad hoc Network (VANET) is divided as Mobile Ad-hoc Networks (MANETs) application which comprises the capability to offer Intelligent Transportation System (ITS) and to enhance road safety. VANET has many difficulties that various from instability problem that gives higher topological change and higher energy utilization with many advantages. The main aim to construct a route optimal path technique is to reduce the probability of linkage failure and decrease the node energy utilization within the network. ACO heuristic for vehicle routing is proposed in this paper. In this method mobility prediction is employed for stability of network and to reduce the utilized energy two-tier mechanism is employed by Location Aided Routing (LAR) protocol. The simulation outcomes in Network simulator 2 of the proposed method enhanced the node energy utilization within the network and it takes lower energy.

A traffic-aware electric vehicle charging management system for smart cities

The expected increase in the number of electric vehicles (EVs) in the coming years will contribute to reducing CO2 pollution in our cities. Currently, EVs' users may suffer from distress due to long charging service times and overloaded charging stations (CSs). Critical traffic conditions (e.g., traffic jams) affect EVs' trip time (TT) towards CSs and thus influence the total trip duration. With this concern, Intelligent transport systems (ITS) and more specifically connected vehicle technologies, can leverage an efficient real-time EV charging service by jointly considering CSs status and traffic conditions in the city. In this work, we propose a scheme to manage EVs' charging planning, focusing on the selection of a CS for the energy-requiring EV. The proposed scheme considers anticipated charging slots reservations performed through a vehicular ad hoc network (VANET), which has been regarded as a cost-efficient communication framework. In specific, we consider two aspects: 1) the EV's total trip time towards its destination considering an intermediate charging at each candidate CS, and 2) the communication delay of the VANET routing protocol. First, in order to estimate the EV's total trip time, our CS selection scheme takes into account the average road speed, traffic lights, and route distance, along the path of the EV. The optimal CS that produces the minimum total charging service time (including the TT) is suggested to that energy-requiring EV. Then, we introduce two communication modes based on geographical routing protocols for VANETs to attain an anticipated charging slot reservation. Simulation results show that with our charging scheme EVs' charging service time is reduced and more EVs are successfully charged.

Intelligent firefly-based algorithm with Levy distribution (FF-L) for multicast routing in vehicular communications

Vehicular ad hoc network (VANET) is an interesting technology used to attain inter-vehicle communication in intelligent transportation system (ITS). In VANET, the timely and unfailing vehicular communication is an important challenge to achieved good service. So, efficient routing techniques are highly needed for proper data transmission in VANET. In this paper, we concentrate on the quality of service (QoS) constrained multicast routing problem by considering it as an NP-complete problem. Several studies reported that bio-inspired algorithms work well than the traditional algorithms to resolve the NP-complete problem. So, a firefly with Levy distribution (FF-L) algorithm is presented to manage the multicast routing problem. To prevent the FF algorithm stuck into local optima, Levy distribution is incorporated to the FF algorithm. The FF-L algorithm for multicasting routing in VANET is validated using a set of experiments on three different scenarios. The experimental values verified that the FF-L algorithm identifies the optimal routes and it can be implemented in practical scenarios where the network structure remains quite stable.

A comparative study on routing protocols for VANETs

Vehicular Ad Hoc Networks (VANETs) is an emerging area of research and have been gaining significant attention over recent years due to its role in designing intelligent transportation system. It includes vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) message flows, supported by wireless access technology such as, IEEE 1609 WAVE and IEEE 802.11p. One of the major scientific challenge in VANET implementation, is the design of routing protocol that could provide efficient and reliable node-to-node packet transmission. Routing in VANETs is a complex task in urban environment. This paper reports the overall performance evaluation of two existing routing protocols namely, Ad hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR) for VANETs. This study aims at optimizing the selection of best possible routing protocol for providing reliability to data packet dissemination in an efficient way. The impact and effectiveness of existing topology based routing protocol for VANETs application has been evaluated through the use of NetSim software tool. The simulated results shows that a combination of proper channel model together with an efficient routing protocol enhance the link throughput of the VANET for a fixed network size. Further, performance evaluation also demonstrate the impact of network sizes and routing protocols on packet loss, packet delivery ratio, average end-to-end delay and overhead transmission.

Randomized Link Repair Reactive Routing Protocol for Vehicular Ad Hoc Network

Background and Objective: Vehicular Ad hoc Network (VANET) now-a-days is popular research area due to numerous challenges such as congestion control, network management, and security issues. Methods: VANET is a subtype of Mobile Ad hoc Network (MANET), therefore, allows a vehicle to exchange information with neighboring vehicles and with roadside infrastructure units. High mobility of vehicles results to frequent link breakages. The existing VANET routing protocols follow a trivial link repair mechanism. Therefore, there is a need to compute stable and reliable routes for vehicular communication as well as frequently repair the broken links. Ad hoc On-demand Distance Vector (AODV) routing protocol is a reactive routing protocol which is suitable for very dynamic environment such as VANET. In this paper, an improved Randomized Link Repair based AODV (RLRAODV) routing protocol is proposed which uses the multiple route reply packets for data transmission through alternate paths during link failure. The proposed methodology also reduces the network congestion overhead generated due to broadcasting of route request packets. Results and Conclusion: The simulation analysis shows that RLR-AODV gives better performance with respect to performance parameters such as average end-to-end delay, average packet delivery ratio, and average packet loss ratio as compared to AODV and AOMDV.

An optimization framework for routing protocols in VANETs: a multi-objective firefly algorithm approach

With Automobiles becoming the main form of transportation adopted in all parts of the world, it has become a necessity to develop useful applications providing safety and entertainment by harnessing the communication between the vehicles. Vehicular adhoc networks (VANET) forms the backbone for efficiently communicating among the vehicles. VANETs on the downside do not have a stable topology and has frequent network disconnections due to its high mobility. Taking all these factors into consideration, designing and implementing VANET routing protocols is a challenge. The proposed framework depends on the use of network resources to further reflect the current system condition and adjust the arrangement between continuous network topology changes and the QoS needs. It consists of three stages: The VANET scenario generator for creating network road and traffic scenarios, formulating the weighted cost function, and finally the optimization phase to identify the optimized configuration based on the weighted cost function formulated. The proposed approach (FA-OLSR) was simulated and the simulation results revealed and improved Packet Delivery Ratio, Mean Routing Load, and End-to-End Delay.

Design and Development of Secured Framework for Efficient Routing in Vehicular Ad-Hoc Network

Due to many challenging issues in vehicular ad-hoc networks (VANETs), such as high mobility and network instability, this has led to insecurity and vulnerability to attacks. Due to dynamic network topology changes and frequent network re-configuration, security is a major target in VANET research domains. VANETs have gained significant attention in the current wireless network scenario, due to their exclusive characteristics which are different from other wireless networks such as rapid link failure and high vehicle mobility. In this are, the authors present a Secured and Safety Protocol for VANET (STVAN), as an intelligent Ad-Hoc On Demand Distance Vector (AODV)-based routing mechanism that prevents the Denial of Service attack (DoS) and improves the quality of service for secured communications in a VANET. In order to build a STVAN, the authors have considered a smart traffic environment in a smart city and introduced the concept of load balancing over VANET vehicles in a best effort manner. Simulation results reveal that the proposed STVAN accomplishes enhanced performance when compared with other similar protocols in terms of reduced delay, better packet delivery ratio, reasonable energy efficiency, increased network throughput and decreased data drop compared to other similar approach.

MMIR: a microscopic mechanism for street selection based on intersection records in urban VANET routing

In urban vehicular ad hoc networks (VANETs), the intersection-based routing scheme has represented its greater applicability and better efficiency to adapt to high and constrained mobility. How to make an accurate decision for street selection is a challenging issue due to the rapid topology changes in VANETs. In this paper, we propose a microscopic mechanism based on intersection records (MMIR) in which the intersection vehicle nodes maintain and update a records table with every passing vehicle’s individual information. By analyzing and processing these entries, we evaluate these vehicles’ current positions so as to compute the connectivity probability or estimated delivery delay for all candidate streets to support street selection. In contrast to the statistical and macroscopic information for the common condition, we firstly make use of the individual and microscopic data to enhance the accuracy of estimated results. Furthermore, according to the quantity and the running interval, we classify vehicles into two categories: individual and queue vehicles, in order to effectively decrease the complexity of position estimation. Lastly, since there are no dedicated control packets generated in MMIR, the network overhead is low. The simulation results show that the proposed MMIR outperforms existing approaches of street selection in terms of the accuracy of computed connectivity probability and estimated delay.

Delay-Minimization Routing for Heterogeneous VANETs With Machine Learning Based Mobility Prediction

Establishing and maintaining end-to-end connections in a vehicular ad hoc network (VANET) is challenging due to the high vehicle mobility, dynamic inter-vehicle spacing, and variable vehicle density. Mobility prediction of vehicles can address the aforementioned challenge, since it can provide a better routing planning and improve overall VANET performance in terms of continuous service availability. In this paper, a centralized routing scheme with mobility prediction is proposed for VANET assisted by an artificial intelligence powered software-defined network (SDN) controller. Specifically, the SDN controller can perform accurate mobility prediction through an advanced artificial neural network technique. Then, based on the mobility prediction, the successful transmission probability and average delay of each vehicle's request under frequent network topology changes can be estimated by the roadside units (RSUs) or the base station (BS). The estimation is performed based on a stochastic urban traffic model in which the vehicle arrival follows a non-homogeneous Poisson process. The SDN controller gathers network information from RSUs and BS that are considered as the switches. Based on the global network information, the SDN controller computes optimal routing paths for switches (i.e., BS and RSU). While the source vehicle and destination vehicle are located in the coverage area of the same switch, further routing decision will be made by the RSUs or the BS independently to minimize the overall vehicular service delay. The RSUs or the BS schedule the requests of vehicles by either vehicle-to-vehicle or vehicle-to-infrastructure communication, from the source vehicle to the destination vehicle. Simulation results demonstrate that our proposed centralized routing scheme outperforms others in terms of transmission delay, and the transmission performance of our proposed routing scheme is more robust with varying vehicle velocity.

Traffic-Aware VANET Routing for City Environments—A Protocol Based on Ant Colony Optimization

This paper presents a traffic-aware position-based routing protocol for vehicular ad hoc networks (VANETs) suitable for city environments. The protocol is an enhanced version of the geographical source routing (GSR) protocol. The proposed protocol, named efficient GSR, uses an ant-based algorithm to find a route that has optimum network connectivity. It is assumed that every vehicle has a digital map of the streets comprised of junctions and street segments. Using information included in small control packets called ants, the vehicles calculate a weight for every street segment proportional to the network connectivity of that segment. Ant packets are launched by the vehicles in junction areas. In order to find the optimal route between a source and a destination, the source vehicle determines the path on a street map with the minimum total weight for the complete route. The correct functionality of the proposed protocol has been verified, and its performance has been evaluated in a simulation environment. The simulation results show that the packet delivery ratio is improved by more than 10% for speeds up to 70 km/h compared with the VANET routing protocol based on ant colony optimization (VACO) that also uses an ant-based algorithm. In addition, the routing control overhead and end-to-end delay are also reduced.

An optimized routing algorithm for vehicle ad-hoc networks

Efficient routing algorithms are essential to guarantee reliable communication in Vehicular Adhoc Networks (VANETs). In this paper, we present a twofold approach entailing the design of a new route metric for VANET communication, which considers important parameters such as the received signal strength; transmit power, frequency and the path loss. We further present an improved genetic algorithm-based route optimization technique (IGAROT) that guarantees better routing in VANETs. We used IGAROT to determine optimal routes required to communicate road anomalies effectively between vehicles in VANETs. The performance of our proposed algorithm was compared with the well-known conventional Genetic Algorithm (GA) route optimization technique under same simulation conditions. Based on the average route results obtained, our findings indicate that IGAROT provided 4.24%, 75.7% and 420% increment over the conventional GA in the low, medium and high car density scenarios, respectively. Our findings suggest that IGAROT improves road anomaly communication among vehicles thus enabling drivers to better navigate anomalous roads with the aim to reduce road-anomaly induced accidents. Further benefits of our system may include the prompt notification of road maintenance agencies concerning persisting road conditions via vehicle to infrastructure communication.

An Enhancement of Greedy Perimeter Stateless Routing Protocol in VANET

The technological development in the world has increased rapidly and touched various areas, especially communication technology, which evolves with the evolution of wireless technology. This technology has invaded several areas, including the transport sector which has benefited from a new technology allowing the communication between vehicles through a specific network called Vehicular Ad-Hoc NETwork (VANET). Hence, the purpose of this network is to maintain road safety and traffic efficiency as well as ensure driving assistance and internet services to vehicles. This objective is ensured through many sensors and a system of geolocation that allows the measurement of speed and distance between vehicles and also microcontrollers or even microprocessors. As a matter of fact, they are capable of processing the information from the sensors and thus allowing the vehicle to react to unexpected events.Despite this development, routing in VANETs has left mysterious points for researchers because of the high mobility of vehicles, which causes frequent changes in the topology. In this paper, we propose an enhanced version of GPSR that minimized transfer delays and control messages. We compare our proposal version to traditional GPSR using the network simulator (NS2).

An Efficient and Reliable QoF Routing for Urban VANETs With Backbone Nodes

Because of the dynamic topology, high mobility of nodes, and complicated channel environments in urban areas, existing routings methods are susceptible to frequent link interruptions and channel congestions. To address these issues, a Quality of Forwarding (QoF)-based reliable geographic routing (QFRG) in urban vehicular ad hoc networks (VANETs) is proposed, where the best route is determined by guaranteeing the QoF and satisfying the link reliability requirement. Two theoretical models for QoF and link reliability analysis are first presented. Taking into consideration the transmission cost and the packet delivery ratio, the QoF is, then, employed to provide the quantitative evaluation to the road segments through the presented road weight evaluation (RWE) scheme, which takes into account the impact of the relative position of links on the network performance. Next, to accommodate the network scale of an urban city, the city map is divided into smaller grid zones. Based on the position of the destination, different transmission strategies are presented for packet forwarding. The extensive simulations demonstrate our protocol’s superiority in both transmission delay and packet delivery ratio compared with the existing schemes.

Evaluating the Impact of Routing Protocol on VANET

Vehicular Ad Hoc Networks (VANETs) are self-organizing, self-healing networks that offer wireless communication among vehicles and roadside equipment. Providing safety and comfort for drivers and passengers is a promising goal of those networks. Designing an applicable routing protocol according to the network application is one among the essential necessities for implementing a victorious vehicular network. In this paper, we tend to report the results of a study on routing protocols associated with conveyance applications and their communication desires. The main aim of our study was to spot that routing technique has higher performance in extremely mobile environment of VANET. The thesis works is based on comparison between Ad hoc on demand Distance Vector routing protocol (AODV), Modified Ad hoc on demand distance vector routing (MAODV) and Destination sequenced distance vector routing (DSDV) in VANET on the basis of packet delivery ratio and end-to-end delay. The tool which we used for the work of performance is Network Simulator 2 (NS-2).

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.

Bio-Inspired Routing Protocol in VANET Networks- A Case Study

Vehicular Ad-Hoc NETworks (VANETs) have received considerable attention in recent years, due to its unique characteristics, which are different from Mobile Ad-Hoc NETworks (MANETs) such as rapid topology change, frequent link failure, and high vehicle mobility. VANET will provide several applications and services such as cooperative collision avoidance, emergency warning messages, cooperative intersection collision avoidance, and traffic management. VANET’s routing objective is to conduct packets through a path in the network to their final destinations. Currently, most of the proposed VANET routing protocols focus on urban or highway environments. The contribution of the paper falls within the study of VANET routing protocol in extreme and complex environments such as underground mines. This paper addresses the need for a bio-inspired adaptive routing protocol in VANETs which can tolerate low-density network traffic with little throughput and delay variation.

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.

Destination-aware context-based routing protocol with hybrid soft computing cluster algorithm for VANET

Due to the rapid topology change, frequent link failure, high vehicle mobility and hard delay constraints, the vehicular ad hoc network (VANET) became a hot research topic in this smart era. VANET has vast application areas including road congestion notification, parking, traffic management, smart transportation, road-side business advertisements. In all these applications, the messages should reach the target location within certain time limits. So, there must be efficient soft computing-enabled routing in VANET which meets these delay constraints. Two soft computing algorithms were proposed in this paper: First, a hybrid clustering algorithm is proposed which combines the geographic- and context-based clustering approaches. The hybrid clustering reduces the control overhead and traffic in the network. Second, the destination-aware routing protocol is proposed for inter-clustering routing which improves the overall packet delivery ratio and reduces the end-to-end delay. The performance of the proposed approach is compared with the well-known cluster-based approaches. The result shows that the proposed approach outperforms the existing approaches.