Implementation of Efficient Cooperative Message Authentication for Vehicular Ad-Hoc Networks

Vehicular Ad-Hoc Network(VANET) is a potential area in research field to bestow Intelligent Transportation System (ITS) services to the end users. It is a exigent topic for its high mobility and frequent network distraction. Lately researchers are carrying out task on many specific issues related to VANET like routing, broadcasting, Quality of Service (QoS), security, architectures, applications, protocols, etc. The augment in vehicles in today’s life has lead to brutal road accidents and traffic jam in urban areas. One of the solution to this problem could be a means of communication between the vehicles for safety. Safety measures lack these days in VANET as malicious drivers in the network disrupt the system routine. In this paper , a new location Based Secure Routing Protocol( PBSRP) which is a hybrid of Most Forward within Radius and Border Node based Most Forward within Radius (B-MFR) routing protocols. A module for security is implemented in this protocol using station to station key agreement protocol for preventing system from several attacks. The module goes through three phases: initialization phase, optimal node selection phase and secure data delivery phase. The outcome of Simulation imparts that PBSRP has better performance than MFR in terms of end to end delay and packet delivery ratio when malicious drivers are included in the network

A Novel Heuristic Data Routing for Urban Vehicular Ad-hoc Networks

This work is devoted to solving the problem of multi-criteria multi-hop routing in vehicular ad-hoc networks (VANETs), aiming at three goals, increasing the end-to-end delivery ratio, reducing the end-to-end latency, and minimizing the network overhead. To this end and beyond the state-of-the-art, HEuristic ROuting for Vehicular Networks (HERO), which is a distributed routing protocol for urban environments, encapsulating two main components, is proposed. The first component, road-segment selection, aims to prioritize the road segments based on a heuristic function that contains two probability distributions, namely, shortest distance distribution (SDD) and connectivity distribution (CD). The mass function of SDD is the product of three quantities, the perpendicular distance, the dot-production angle, and the segment length. On the other hand, the mass function of CD considers two quantities, the density of vehicles and the inter-distance of vehicles on the road segment. The second component, vehicle selection, aims to prioritize the vehicles on the road segment based on four quantities, the relative speed, the movement direction, the available buffer size, and the signal fading. The simulation results showed that HERO achieved a promising performance in terms of delivery success ratio, delivery delay, and communication overhead

Design and analysis of a beacon-less routing protocol for large volume content dissemination in vehicular ad hoc networks

Largevolumecontentdisseminationispursuedbythegrowingnumberofhighquality applications for Vehicular Ad hoc NETworks(VANETs), e.g., the live road surveillance service and the video-based overtaking assistant service. For the highly dynamical vehicular network topology, beacon-less routing protocols have been proven to be efficient in achieving a balance between the system performance and the control overhead. However, to the authors’ best knowledge, the routing design for large volume content has not been well considered in the previous work, which will introduce new challenges, e.g., the enhanced connectivity requirement for a radio link. In this paper, a link Lifetime-aware Beacon-less Routing Protocol (LBRP) is designed for large volume content delivery in VANETs. Each vehicle makes the forwarding decision based on the message header information and its current state, including the speed and position information. A semi-Markov process analytical model is proposed to evaluate the expected delay in constructing one routing path for LBRP. Simulations show that the proposed LBRP scheme outperforms the traditional dissemination protocols in providing a low end-to-end delay. The analytical model is shown to exhibit a good match on the delay estimation with Monte Carlo simulations, as well

Routing And Communication Path Mapping In VANETS

Vehicular ad-hoc network (VANET) has quickly become an important aspect of the intelligent transport system (ITS), which is a combination of information technology, and transport works to improve efficiency and safety through data gathering and dissemination. However, transmitting data over an ad-hoc network comes with several issues such as broadcast storms, hidden terminal problems and unreliability; these greatly reduce the efficiency of the network and hence the purpose for which it was developed. We therefore propose a system of utilising information gathered externally from the node or through the various layers of the network into the access layer of the ETSI communication stack for routing to improve the overall efficiency of data delivery, reduce hidden terminals and increase reliability. We divide route into segments and design a set of metric system to select a controlling node as well as procedure for data transfer. Furthermore we propose a system for faster data delivery based on priority of data and density of nodes from route information while developing a map to show the communication situation of an area. These metrics and algorithms will be simulated in further research using the NS-3 environment to demonstrate the effectiveness

Computational Intelligence Inspired Data Delivery for Vehicle-to-Roadside Communications

We propose a vehicle-to-roadside communication protocol based on distributed clustering where a coalitional game approach is used to stimulate the vehicles to join a cluster, and a fuzzy logic algorithm is employed to generate stable clusters by considering multiple metrics of vehicle velocity, moving pattern, and signal qualities between vehicles. A reinforcement learning algorithm with game theory based reward allocation is employed to guide each vehicle to select the route that can maximize the whole network performance. The protocol is integrated with a multi-hop data delivery virtualization scheme that works on the top of the transport layer and provides high performance for multi-hop end-to-end data transmissions. We conduct realistic computer simulations to show the performance advantage of the protocol over other approaches