Vehicular Ad Hoc Networks Protocols Research Articles

SL-PPCP: Secure and Low-Cost Privacy-Preserving Communication Protocol for Vehicular Ad Hoc Networks

SL-PPCP: Secure and Low-Cost Privacy-Preserving Communication Protocol for Vehicular Ad Hoc Networks

Comparative analysis of reactive routing protocols for vehicular adhoc network communications

In the recent past, vehicular adhoc networks (VANETs) have gained a lot of importance. The routing protocols play a vital role to deliver payloads from one vehicle to another one while they are moving at relative speeds. It is a challenging task to select a routing protocol for VANETs because of the uneven distribution and high mobility of vehicles. In this paper, we have analysed the two standard reactive protocols, adhoc on-demand distance vector (AODV) and ant colony optimization (ACO). The performance comparison of AODV and ACO routing protocols has been presented in this paper. The results show AODV performed better in terms of energy consumption and routing overhead. While considering the throughput, energy loss ratio, and delay ACO has performed. ACO resulted as upperhand.

Multi-TA model-based conditional privacy-preserving authentication protocol for fog-enabled VANET

The rapid growth of Vehicular Ad-hoc Networks (VANET), fueled by advancements in the Internet-of-Things, cloud computing, Intelligent Transportation Systems, and fog computing, has led to the introduction of fog node-based VANET to serve resource-constrained devices. In the traditional security models of VANET, due to the use of a centralized trusted authority, there is a chance of single-point-of-failure and service unavailable with the increased service access requests. Also, there was one-to-one communication between each roadside unit and trusted authority. This may increase the system complexity and increase the traffic load. To address these issues, a novel authentication protocol for fog-enabled VANET based on multiple trusted authority model is discussed which reduces the chance of service unavailability and single-point-of-failure as the entire traffic load is distributed among multiple sub-trusted authority. Due to the incorporation of fog node, a group of roadside units can be controlled centrally, where trusted authority does not need to perform individual authentication for each roadside unit. The proposed protocol's security is rigorously examined through both informal and formal security analysis. Additionally, the protocol exhibits enhanced security features, as demonstrated in a performance comparison section, showcasing its ability to meet the security and privacy requirements while incurring relatively low communication and computation and storage costs. Thus, the proposed protocol offers a secure and efficient authentication protocol for fog-enabled VANET.

Shared group session key-based conditional privacy-preserving authentication protocol for VANETs

Vehicular Ad-Hoc Networks (VANETs) have significantly enhanced driving safety and comfort by leveraging vehicular wireless communication technology. Due to the open nature of VANETs, conditional privacy-preserving authentication protocol should be offered against potential attacks. Efficient and secure authentication among vehicles in VANETs are important requirements, but there are various limitations in the existing conditional privacy-preserving authentication protocols for securing VANETs. To cope with the inherent issues, we propose a conditional privacy-preserving authentication protocol based share group session key (SGSK) by integrating the self-healing key distribution technique, blockchain, and MTI/C0 protocol. In our protocol, we use SGSK instead of the time-consuming Certificate Revocation List (CRL) checking, and we revoke malicious vehicles by updating SGSK. It is shared among unrevoked vehicles within a domain and across-domain. As a result, when a malicious revoked vehicle enters a new domain, it is difficult for it to access the system and send false messages. Furthermore, our protocol can not only achieve computation efficiency by reducing the number of computing operations of bilinear pairing but also resist various attacks while keeping conditional privacy protection. We implement our protocol in the Hyperledger Fabric platform. The experimental results show that our protocol is available to revoke 180 malicious vehicles in across-domain scenarios within one second, and it can meet the requirement of verifying 600 messages per second easily. Moreover, our comprehensive performance evaluations demonstrates that our protocol outperforms other approaches in terms of vehicle revocation checking cost, computation overhead, and communication overhead. In addition, to show the feasibility and validity of our protocol, we use SUMO and NS2 to simulate the actual VANET scenario and validate the efficiency and performance of our protocol. Simulation results prove the practicability of our protocol for VANETs.

Prioritization and scheduling in the vehicle-to-infrastructure (V2I) scheme for vanets using enhanced congestion control source based ant colony optimization

Mobile ad hoc networks (MANETs), which include vehicular ad hoc networks (VANETs), are a promising method for intelligent transportation systems. The major challenges of VANET protocols are symmetric links and changing topology of the networks and hence a proper routing method is necessary for VANET. A crucial issue with VANETs is the transmission of data from a starting point to the base station. To discover the least path with the lowest cost and fewest hops between the source and the destination, existing work uses a novel priority-based direction-aware collision avoidance (P-DVCA). To direct the ants to develop a shorter path with fewer hops for data transmission, the suggested method uses the prioritising and scheduling enhanced congestion control-based source ant colony optimization (ECC-ACO) for VANETs. Based on the message type and network situation, this technique provides precedence for privacy messages communications. Privacy messages can also be divided into beacon messages and occurrence messages. At that point, each message is routed into the appropriate queue predicated on its primary consideration, and each message in each queue is planned. When compared to renowned VANET communication architecture, simulation and analytical findings show that proposed ECC-ACO offers a respectable reduction in collisions.

Design of Blockchain and ECC-Based Robust and Efficient Batch Authentication Protocol for Vehicular Ad-Hoc Networks

Design of Blockchain and ECC-Based Robust and Efficient Batch Authentication Protocol for Vehicular Ad-Hoc Networks

Analysing and Evaluation of Routing Protocols in VANET

Among the application of Ad Hoc network we have Vehicular Ad Hoc Network (VANET), which is an important data research domain today. VANET can improve the traffic road efficiency in order to overcome many problems and offer more services to customer. For instance, VANET can lead to reduce traffic jam or improve road safety by minimizing vehicles’ accident. Like any wireless network without infrastructure, the routing task is the most difficult task especially when nodes are mobile. The mobility of nodes, which are vehicles in VANET, causes a rapid change of network topology and leads to bread connection between source and destination nodes. In this paper, we will analyze some routing protocols in order to evaluate their performances. In this study we have proposed some scenarios of VANET routing protocols. The simulation has been done on NS3 simulator and SUMO. Simulation proves that routing protocols have a huge impact on VANET network performances.

RTRV: An RSU-assisted trust-based routing protocol for VANETs

Routing in vehicular ad hoc networks (VANETs) enables efficient communication and data exchange between vehicles and infrastructure components, which is a critical aspect of providing intelligent transportation systems (ITS). Due to the dynamic nature of VANETs, where vehicles have high mobility and frequent link disconnections, secure routing protocols are essential for establishing reliable and efficient communication paths. Employing trust criteria in routing is an effective solution that routing protocols use to become secure. In this paper, we propose an RSU-assisted trust-based routing protocol for VANETs (RTRV), which considers trust criteria to provide secure routing. To identify and limit malicious nodes from disrupting the routing, RTRV provides a more reliable monitoring process for trust management, which increases resistance to trust-based attacks. In the monitoring process, as each data packet is sent to a next-hop, two vehicles observe the behavior of the next-hop in forwarding the packet, and the observations are then used to update the direct trust of the next-hop. The observations are additionally reported to RSUs, which gather the reports to update the indirect trust of the next-hop and provide recommendations to vehicles within their transmission range. In addition to indirect trust management, in RTRV, RSUs play an active role in the routing of data packets, which improves the routing performance. We simulated the proposed protocol in different scenarios with SUMO and OMNeT++ tools and then compared it with the TGRV protocol. The results of our analysis conclusively show that RTRV outperforms TGRV in terms of packet delivery ratio, end-to-end delay, and average hop count in both scenarios, with and without RSU. Specifically, in the RTRV without RSU scenario, when the percentage of malicious vehicles reaches 25%, RTRV achieves a 3.8% higher packet delivery ratio compared to TGRV. Furthermore, RTRV demonstrates significantly reduced end-to-end delay and average hop count, with values 0.14 and 0.11 times lower than TGRV, respectively. In addition, the cost and security analysis demonstrate that the proposed protocol has acceptable overheads in memory, communication, and computation and is also resistant to critical trust-based attacks.

Comparative study of proactive and reactive routing protocols in vehicular ad-hoc network

<p>In recent years, the vehicular ad-hoc network (VANET), which is an ad-hoc network used by connected autonomous vehicles (CAV) for information processing, has attracted the interest of researchers in order to meet the needs created by the accelerating development of autonomous vehicle technology. The enormous amount of information and the high speed of the vehicles require us to have a very reliable communication protocol. The objective of this paper is to determine a topology-based routing protocol that improves network performance and guarantees information traffic over VANET. This comparative study was carried out using the simulation of urban mobility (SUMO) and network simulator (NS-3). Through the results obtained, we will show that the choice of the type of protocol to use depends on the size of the network and also on the metrics to be optimized.</p>

Decentralized Receiver-based Link Stability-aware Forwarding Scheme for NDN-based VANETs

The inter-vehicle communication in the vehicular ad-hoc network (VANET) providing ubiquitous mobility to mobile users is considered an essential component of intelligent transportation systems (ITS), enabling a wide range of safety and non-safety applications in which the vehicles seamlessly interact and co-operate with each other. The recent paradigm shift in VANETs protocols has led to the adoption of name data networking (NDN) as an underlying communication protocol in VANETs that replaces traditional address-based communication philosophy, treats content as a first-class citizen, and assigns unique names to contents consequently enabling name-based routing and forwarding, caching, and security. Although NDN has significantly improved the underlying communication issues in VANETs, a plethora of challenges such as message broadcast storms, in-efficient packet suppression mechanisms, intermittent connectivity owing to frequent topological changes, and reverse path partioning (RPP) require further attention from the research community. To cope with these issues, this paper proposes decentralized receiver-based link stability-aware forwarding (DRLSF) protocol. The DRLSF is a beacon-less receiver-based multi-hop protocol, well-suited for pull-based applications where end users request desired data by sending packets. The comparative performance analysis validates the effectiveness of the DRLSF protocol in different VANET environments and application scenarios.

Provably Secure and Anonymous V2I and V2V Authentication Protocol for VANETs

Vehicular Ad-hoc Networks (VANETs) enable the connection and information exchange between vehicles and transportation infrastructure (V2I), vehicle and vehicle (V2V) to improve the safety and efficiency of the transportation system. In previous protocols, V2I and V2V authentication protocols based on bilinear pairings or identity-based cryptography are computationally heavy or difficult to protect the user’s identity and privacy. In addition, lightweight authentication protocols have not achieve both V2I and V2V authentication, and may suffer from Onboard Unit (OBU) intrusion attacks, Roadside Unit (RSU) captured attacks, and difficult to track malicious vehicles. Therefore, a lightweight and anonymous V2I and V2V authentication protocol with batch verification based on Elliptic Curves Cryptography (ECC) is proposed. We use Physical Unclonable Function (PUF) and biological key to avoid RSU captured attacks and OBU intrusion attacks, design a feature embedding strategy with dynamic pseudo-identity to recover the malicious vehicle’s identity by the Trusted Authority (TA). In the application test simulating the actual scenario, our protocol is more efficient because of lower overhead and batch authentication strategy. The semantic security of the protocol is formally proved under the random oracle model. The comparative analysis and security proof results show that our protocol is more superior to others.

OPBRP - obstacle prediction based routing protocol in VANETs

Vehicular Ad-hoc Networks (VANETs) are recently getting high attention from different researchers due to increasing traffic problems, especially in densely populated countries. Increasing rates of accidents call for an Intelligent Transportation System (ITS) with efficient performance to reduce and mitigate this trend. The required enhancement of the ITS can be more focused on traffic performance, integrity, and reduction of the vehicles’ CO 2 emissions. Existing routing protocols for VANETs consider different situations and methods to establish reliable communication between the vehicles and infrastructures. However other situations have not been addressed carefully like the link stability between vehicles during packet exchange. This paper develops an Obstacle Prediction Based Routing Protocol (OPBRP) for vehicle detection, packets transmission to Roadside Units (RSU) and choosing a better route in terms of reliability via using vehicle's Kinematics and Mobility prediction in VANET. Two fundamental contributions are included in this paper: (1) Upgrading prediction routing protocol to transfer packets using a reliable path, and (2) Adding new logic in choosing the intermediate nodes to the destination to achieve a higher Packet delivery ratio (PDR). The OPBRP uses the predictive greedy as forwarding algorithm and the predictive perimeter forwarding as recovery algorithm after introducing enhancements to both algorithms to meet the requirements of VANETs environment. To materialize the value achieved from the mentioned contributions we tested the newly developed OPBRP against the existing routing protocols using Vehicle in Network Simulation (Veins) which shows that our proposed protocol outperformed current existing routing protocols in terms of PDR by achieving 18.46% improvement, end-to-end delay (E2E-Delay) by achieving 10.51% improvement, and total power consumption used in transmission by achieving 23.80% improvement.

Intelligent energy aware optimization protocol for vehicular adhoc networks

Vehicular adhoc network (VANET) plays a vital role in smart transportation. VANET includes a set of vehicles that communicate with one another via wireless links. The vehicular communication in VANET necessitates an intelligent clustering protocol to maximize energy efficiency. Since energy acts as an essential factor in the design of VANET, energy-aware clustering protocols depending upon metaheuristic optimization algorithms are required to be developed. This study introduces an intelligent energy-aware oppositional chaos game optimization-based clustering (IEAOCGO-C) protocol for VANET. The presented IEAOCGO-C technique aims to select cluster heads (CHs) in the network proficiently. The proposed IEAOCGO-C model constructs clusters based on oppositional-based learning (OBL) with the chaos game optimization (CGO) algorithm to improve efficiency. Besides, it computes a fitness function involving five parameters, namely throughput (THRPT), packet delivery ratio (PDR), network lifetime (NLT), end to end delay (ETED) and energy consumption (ECM). The experimental validation of the proposed model is accomplished, and the outcomes are studied in numerous aspects with existing models under several vehicles and measures. The simulation outcomes reported the enhanced performance of the proposed approach over the recent technologies. As a result, it has resulted in maximal NLT (4480), minimal ECM (65.6), maximal THRPT (81.6), maximal PDR (84.5), and minimal ETED (6.7) as average values over the other methods under all vehicle numbers.

A novel k-means powered algorithm for an efficient clustering in vehicular ad-hoc networks

<p>Considerable attention has recently been given to the routing issue in vehicular ad-hoc networks (VANET). Indeed, the repetitive communication failures and high velocity of vehicles reduce the efficacy of routing protocols in VANET. The clustering technique is considered an important solution to overcome these difficulties. In this paper, an efficient clustering approach using an adapted k-means algorithm for VANET has been introduced to enhance network stability in a highway environment. Our approach relies on a clustering scheme that accounts for the network characteristics and the number of connected vehicles. The simulation indicates that the proposed approach is more efficient than similar schemes. The results obtained appear an overall increase in constancy, proven by an increase in cluster head lifetime by 66%, and an improvement in robustness clear in the overall reduction of the end-to-end delay by 46% as well as an increase in throughput by 74%.</p>

IP address allocation protocols in vehicular ad hoc networks

SummaryIn vehicular ad hoc networks (VANETs), communication takes place between vehicles to vehicles, the vehicles to the road side units, and vice‐versa. The basic purpose of these communications is to share and exchange tremendous amount of data and information. For efficient information sharing, a systematic and structured connection establishment algorithm is needed. In VANETs, each connected node of the network need to be assigned a unique address. Hence, an algorithm is needed for the proper assignment of unique address to all nodes in the network. This paper explains different types of IP address protocols in VANETs. We have also explained advantage and disadvantage of existing IP address allocation protocols in VANETs.

BCGS: Blockchain-assisted privacy-preserving cross-domain authentication for VANETs

Vehicular Ad-Hoc Networks (VANETs) have significantly enhanced driving safety and comfort by leveraging vehicular wireless communication technology. Secure authentication among vehicles in VANETs is an important requirement, but there are various limitations in many existing authentication protocols, for example, in terms of privacy protection, malicious entity tracking, and cross-domain authentication. In response, we first reconstruct a secure and effective short group signature scheme for realizing anonymous authentication and traceable identity within a domain. We then propose a secure blockchain-based privacy-preserving cross-domain authentication protocol for VANETs, namely BCGS, by integrating both blockchain and group signature. In BCGS, blockchain is leveraged to facilitate trusted information sharing and consequently supports cross-domain authentication among vehicles, and the group signature scheme is used to provide conditional privacy protection. Our comprehensive security and performance evaluations demonstrate that BCGS outperforms other similar approaches in terms of security, computation, and storage costs.

Energy efficient clustering with Heuristic optimization based Ro/uting protocol for VANETs

Vehicle networks have been the subject of increasing amounts of study from both academia and industry as a way of enhancing traffic safety and providing real-time data to motorists and passengers. But beyond that, the need for a safe and secure network in moving vehicles is what's pushing the spread of VANETs. Intelligent, on-the-road vehicles that can exchange data with one another and with fixed roadside infrastructure make up what are known as ad hoc vehicular networks. It's anticipated that it will soon provide a wide variety of exciting new services. There are a lot of distinguishing features of ad hoc networks in autos, such as their adaptability to a wide range of situations. Vehicular Ad hoc Networks (VANET) use a network of moving automobiles as nodes to create a wireless network. Clustering and routing can be thought of as a multi-objective minimization issue that can be handled with metaheuristic optimization methods. With this in view, this work proposes the ANFC-QGSOR protocol for VANET, which combines adaptive neural fuzzy clustering (ANFC) and quantum glowworm swarm optimization-based routing (QGSOR). The presented ANFC-QGSOR technique initially allows the vehicles to communicate with one another. For effective cluster head (CH) selection and cluster assembly, the ANFC technique is used with three input parameters: residual energy, distance, and node degree. In addition, by developing a fitness function, the QGSOR approach is used to select the best routes to the destination. Network Simulator is used to simulate the proposed ANFC-QGSOR method (NS3 tool). The experimental results demonstrated that the ANFC-QGSOR technique surpassed earlier state-of-the-art technologies in a variety of evaluation variables.

Weight-Based Clustering Algorithm for Military Vehicles Communication in VANET

In vehicular ad-hoc network (VANET), every vehicle node indicates a mobile node and it acts as a transmitter, receiver and router for the delivery of the information. VANET is a subgroup of mobile ad-hoc network (MANET) and is related to the dynamic topology. Dynamic network scenarios are more challenging issues as compared to MANET topologies, so finding a suitable algorithm for all VANET applications is the major challenge for the researchers. Routing protocols in VANET are divided into six parts i.e., cluster-based, geocast-based, topology-based, position-based, and broadcast-based. Autonomous robots and unmanned military vehicles (UMVs) become part of the advanced warfare strategy to execute dangerous war field operations and military combat missions. The military vehicles (MVs) transfer information to each other in order to achieve required military tasks collectively. In the proposed work, rhombus shaped area is divided into multiple clusters using a weight-based clustering algorithm for transmitting the event information to the vehicles. Intersection clustering with rhombus shaped area which are very effective for clustering. To choose cluster head (CH), the proposed method has used two weighted metrics, one is real time average speed and the other parameter is degree. This work is useful for choosing right CH in the network. Each vehicle in the same cluster transmits the data to the CH instead of broadcasting it. The simulation has been done in the SUMO and NETSIM simulator, which shows the network performance for the different protocols like Ad-hoc on-demand distance vector (AODV), dynamic source routing (DSR) in terms of packet delivery ratio, throughput, delay, overhead transmission, mean and standard deviation.

A key-insulated secure multi-server authenticated key agreement protocol for edge computing-based VANETs

Authenticated key agreement is an important mechanism for the protection of data transmission in vehicular ad hoc networks (VANETs). However, in the existing authenticated key agreement protocols for VANETs, the key exposure problem has hardly been considered. Generally, the security of these protocols is based on a tamper-proof device (TPD), which stores secret parameters for vehicles. But the adversary can destroy the TPD to acquire some important information via side-channel attack. Once the secret key is exposed, the security of the entire VANET system will collapse. To resolve the above problem, we elaborate a key-insulated secure multi-server authenticated key agreement protocol for edge computing-based VANETs. In the proposed protocol, the secret key of the vehicle is periodically updated with the assistance of a delegation server. In this way, even if the key exposure in the current time period, it does not destroy the key security in earlier or later time period. Moreover, it is worth noting that our protocol has a more simplified setup phase with smaller public parameters, especially without the need to produce the master public key. Finally, the security proof and the performance analysis display the proposed scheme is secure and suitable regarding computation and communication overhead.

B-HAS: Blockchain-Assisted Efficient Handover Authentication and Secure Communication Protocol in VANETs

The traditional handover authentication protocols in Vehicular Ad-hoc Network (VANET) suffer from important issues like single source of trust, Single-Point-of-Failure (SPoF), and fails to provide robust authentication due to several potential threats. In state-of-the-art of handover authentication, it takes high computation and communication overhead. The main aim of this paper is to integrate blockchain technology into the VANET system and to design a robust handover authentication protocol to solve the above-mentioned challenges. In this article, we design blockchain-based mutual authentication and session key agreement protocols for intra-vehicular and inter-vehicular (handover case) scenarios by implementing the hash function and Elliptic Curve Cryptography (ECC). We also validate the proposed model by using the Scyther tool and Real-Or-Random (ROR) oracle, standard model. The proposed scheme confirms security against all applicable attacks during security analysis. Furthermore, a detailed comparative analysis reveals that the proposed method has low communication and computation overheads and achieves more functionality features and security attributes than the relevant schemes.