Message Verification Protocol Based on Bilinear Pairings and Elliptic Curves for Enhanced Security in Vehicular Ad Hoc Networks

Vehicular ad hoc networks(VANETs)provide intelligent navigation and efficient route management,resulting in time savings and cost reductions in the transportation sector.However,the exchange of beacons and messages over public channels among vehicles and roadside units renders these networks vulnerable to numerous attacks and privacy violations.To address these challenges,several privacy and security preservation protocols based on blockchain and public key cryptography have been proposed recently.However,most of these schemes are limited by a long execution time and massive communication costs,which make them inefficient for on-board units(OBUs).Additionally,some of them are still susceptible to many attacks.As such,this study presents a novel protocol based on the fusion of elliptic curve cryptography(ECC)and bilinear pairing(BP)operations.The formal security analysis is accomplished using the Burrows–Abadi–Needham(BAN)logic,demonstrating that our scheme is verifiably secure.The proposed scheme’s informal security assessment also shows that it provides salient security features,such as non-repudiation,anonymity,and unlinkability.Moreover,the scheme is shown to be resilient against attacks,such as packet replays,forgeries,message falsifications,and impersonations.From the performance perspective,this protocol yields a 37.88%reduction in communication overheads and a 44.44%improvement in the supported security features.Therefore,the proposed scheme can be deployed in VANETs to provide robust security at low overheads.

Performance of beacon safety message dissemination in Vehicular Ad hoc NETworks (VANETs)

Currently, there is a growing belief that putting an IEEE 802.11-like radio into road vehicles can help the drivers to travel more safely. Message dissemination protocols are primordial for safety vehicular applications. There are two types of safety messages which may be exchanged between vehicles: alarm and beacon. In this paper we investigate the feasibility of deploying safety applications based on beacon message dissemination through extensive simulation study and pay special attention to the safety requirements. Vehicles are supposed to issue these messages periodically to announce to other vehicles their current situation and use received messages for preventing possible unsafe situations. We evaluate the performance of a single-hop dissemination protocol while taking into account the quality of service (QoS) metrics like delivery rate and delay. We realize that reliability is the main concern in beacon message dissemination. Thus, a new metric named effective range is defined which gives us more accurate facility for evaluating QoS in safety applications specifically. Then, in order to improve the performance, the effects of three parameters including vehicle's transmission range, message transmission's interval time and message payload size are studied. Due to special characteristics of the safety applications, we model the relationship between communication-level QoS and application-level QoS and evaluate them for different classes of safety applications. As a conclusion, the current technology of IEEE 802.11 MAC layer has still some challenges for automatic safety applications but it can provide acceptable QoS to driver assistance safety applications.

On the Connectivity of One-dimensional Vehicular Ad Hoc Networks

In this paper we analyze connectivity of one-dimensional Vehicular Ad Hoc Networks where vehicle gap distribution can be approximat- ed by an exponential distribution. The probabilities of Vehicular Ad Hoc Network connectivity for difference cases are derived. Furthermore we proof that the nodes in a sub-interval [z1, z1 ＋ △z] of interval [0,z],z 〉 0 where all the nodes are independently uniform distributed is a Poisson process and the relationship of Vehicle Ad hoc Networks and one-dimensional Ad Hoc networks where nodes independently uniform distributed in [zl, z1 ＋ △z] is explained. The analysis is validated by computing the probability of network connectivity and comparing it with the Mont Carlo simu- lation results.

A Secured Message Transmission Protocol for Vehicular Ad Hoc Networks

Vehicular Ad hoc Networks(VANETs)become a very crucial addition in the Intelligent Transportation System(ITS).It is challenging for a VANET system to provide security services and parallelly maintain high throughput by utilizing limited resources.To overcome these challenges,we propose a blockchain-based Secured Cluster-based MAC(SCB-MAC)protocol.The nearby vehicles heading towards the same direction will form a cluster and each of the clusters has its blockchain to store and distribute the safety messages.The message which contains emergency information and requires Strict Delay Requirement(SDR)for transmission are called safety messages(SM).Cluster Members(CMs)sign SMs with their private keys while sending them to the blockchain to confirm authentication,integrity,and confidentiality of the message.A Certificate Authority(CA)is responsible for physical verification,key generation,and privacy preservation of the vehicles.We implemented a test scenario as proof of concept and tested the safety message transmission(SMT)protocol in a real-world platform.Computational and storage overhead analysis shows that the proposed protocol for SMT implements security,authentication,integrity,robustness,non-repudiation,etc.while maintaining the SDR.Messages that are less important compared to the SMs are called non-safety messages(NSM)and vehicles use RTS/CTS mechanism for NSM transmission.Numerical studies show that the proposed NSM transmission method maintains 6 times more throughput,2 times less delay and 125%less Packet Dropping Rate(PDR)than traditional MAC protocols.These results prove that the proposed protocol outperforms the traditional MAC protocols.

A contention-based efficient-information perception algorithm (CEiPA) for vehicular ad hoc networks

The problem of information dissemination is researched for vehicular ad-hoc networks （VANET） in this paper, and a contention-based effficient-information perception algorithm （CEiPA） is proposed. The idea of CEiPA is that beacons are delivered over VANET with limited lifetime and efficient information. CEiPA consists of two phases. The first one is initialization phase, during which the count timers Tcyce and Tlocal are set to start beacon delivery while Tcycle is also used to monitor and restart beaconing. The second one is beacon delivery phase. An elaborate distance function is employed to set contention delay for beacons of each vehicle. In this way beacons will be sent in order, which decreases the collision of beacons. Simulation results show that CEiPA enables each beacon to carry more efficient information and spread them over more vehicles with lower network overhead than the periodic beacon scheme. CEiPA is also flexible and scalable because the efficient information threshold it employs is a balance among the freshness of information, network overhead and perception area of a vehicle.

Connectivity of sparse vehicular ad hoc networks with channel randomness

In this paper, we investigate the connectivity of vehicular ad hoc networks in free-flow traffic situation with channel randonmess. In order to illustrate the realistic environment, we consider that vehicles are distributed in free-flow highway according to a Poisson point process, and signal propagation between connected vehicles is subjected to log-normal shadowing effects. We obtain the distribution of the space headway between successive vehicles and the distribution of signal coverage, which allows us to use the equivalent M/G/z~ queue theory to model the connectivity of VANETs in the form of average broadcast percolation distance and average number of connected nodes. Then, extensive simulation studies are conducted to evaluate the obtained results. The analytical model presented here is able to describe the impact of various system parameters, including traffic parameters and signal propagation parameters on the con- nectivity. We use our analytical results, along with the common signal propagation data, to understand impact of channel randomness on the connectivity of VANETs.

Cluster-based RSU deployment strategy for vehicular ad hoc networks with integration of communication,sensing and computing

The integration of communications,sensing and computing(I-CSC)has significant applications in vehicular ad hoc networks(VANETs).A roadside unit(RSU)plays an important role in I-CSC by performing functions such as information transmission and edge computing in vehicular communication.Due to the constraints of limited resources,RSU cannot achieve full coverage and deploying RSUs at key cluster heads of hierarchical structures of road networks is an effective management method.However,direct extracting the hierarchical structures for the resource allocation in VANETs is an open issue.In this paper,we proposed a network-based renormalization method based on information flow and geographical location to hierarchically deploy the RSU on the road networks.The renormalization method is compared with two deployment schemes:genetic algorithm(GA)and memetic framework-based optimal RSU deployment(MFRD),to verify the improvement of communication performance.Our results show that the renormalization method is superior to other schemes in terms of RSU coverage and information reception rate.

VDCM: A Data Collection Mechanism for Crowd Sensing in Vehicular Ad Hoc Networks

With the rapid development of mobile devices,aggregation security and efficiency topics are more important than past in crowd sensing.When collecting large-scale vehicle-provided data,the data transmitted via autonomous networks are publicly accessible to all attackers,which increases the risk of vehicle exposure.So we need to ensure data aggregation security.In addition,low aggregation efficiency will lead to insufficient sensing data,making the data unable to provide data mining services.Aiming at the problem of aggregation security and efficiency in large-scale data collection,this article proposes a data collection mechanism(VDCM)for crowd sensing in vehicular ad hoc networks(VANETs).The mechanism includes two mechanism assumptions and selects appropriate methods to reduce consumption.It selects sub mechanism 1 when there exist very few vehicles or the coalition cannot be formed,otherwise selects sub mechanism 2.Single aggregation is used to collect data in sub mechanism 1.In sub mechanism 2,cooperative vehicles are selected by using coalition formation strategy and auction cooperation agreement,and multi aggregation is used to collect data.Two sub mechanisms use Paillier homomorphic encryption technology to ensure the security of data aggregation.In addition,mechanism supplements the data update and scoring steps to increase the amount of available data.The performance analysis shows that the mechanism proposed in this paper can safely aggregate data and reduce consumption.The simulation results indicate that the proposed mechanism reduces time consumption and increases the amount of available data compared with existing mechanisms.

Fast Confidentiality-Preserving Authentication for Vehicular Ad Hoc Networks

This paper studies the existing problems of message authentication protocols in vehicular ad hoc networks(VANETs) due to their significance in the future of commuting and transportation. Our contribution has been devoted to implementing a new protocol for VANETs so that inherent security problems in past works are resolved. Exclusive security measures have been considered for the system which protects the users against threat of any attack. The new protocol shows a great hardness guaranteed by certificate based 80 bit security which assures messages to remain confidential in any time. Also, new unprecedented features like V2 X which improves system performance effectively have been instantiated. The simulation results indicate that message signature generation and verification both take place in much less time than present comparable rival protocols.

Caching Strategies in NDN Based Wireless Ad Hoc Network:A Survey

Wireless Ad Hoc Networks consist of devices that are wirelessly connected.Mobile Ad Hoc Networks(MANETs),Internet of Things(IoT),and Vehicular Ad Hoc Networks(VANETs)are the main domains of wireless ad hoc network.Internet is used in wireless ad hoc network.Internet is based on Transmission Control Protocol(TCP)/Internet Protocol(IP)network where clients and servers interact with each other with the help of IP in a pre-defined environment.Internet fetches data from a fixed location.Data redundancy,mobility,and location dependency are the main issues of the IP network paradigm.All these factors result in poor performance of wireless ad hoc networks.The main disadvantage of IP is that,it does not provide in-network caching.Therefore,there is a need to move towards a new network that overcomes these limitations.Named Data Network(NDN)is a network that overcomes these limitations.NDN is a project of Information-centric Network(ICN).NDN provides in-network caching which helps in fast response to user queries.Implementing NDN in wireless ad hoc network provides many benefits such as caching,mobility,scalability,security,and privacy.By considering the certainty,in this survey paper,we present a comprehensive survey on Caching Strategies in NDN-based Wireless AdHocNetwork.Various cachingmechanism-based results are also described.In the last,we also shed light on the challenges and future directions of this promising field to provide a clear understanding of what caching-related problems exist in NDN-based wireless ad hoc networks.

On the security of warning message dissemina-tion in vehicular Ad hoc networks

Information security is an important issue in vehicular networks as the accuracy and integrity of information is a prerequisite to the satisfactory performance of virtually all vehicular network applications.We study the information security of a vehicular Ad hoc network whose message could be tampered by malicious vehicles.An analytical framework is developed to analyze the process of message dissemination in a vehicular network with malicious vehicles randomly distributed in the network.The probability that a destination vehicle at a xed distance can receive the message correctly from the source vehicle is obtained.Simulations are conducted to validate the accuracy of the theoretical analysis.Our results demonstrate the impact of network topology and the distribution of malicious vehicles on the correct delivery of a message in vehicular Ad hoc networks,and provides insight on the design of security mechanisms to improve the security of message dissemination in vehicular networks.

Data dissemination model using Epidemic and Transmission-Segment-based Geographic Routing protocol:a new perspective in vehicular ad hoc networks

Purpose-The purpose of this paper is to introduce a new data dissemination model in order to improve the performance of transmission in VANET.It proposes a protocol named Epidemic and Transmission-Segmentbased Geographic Routing(ETSGR)and outlining the issues due to high mobility of nodes and uncertain physical topologies in the network.The proposed ETSGR is mainly used to analyze the vehicle state,direction,distance,traffic density and link quality of the network.Design/methodology/approach-This research work based on ETSGR protocol mainly uses epidemic algorithmin order to find the vehicle state based on susceptible,infected and recovered(SIR)model.Furthermore,the vehicle position and finding the head node in the network is utilized using the transmission segment protocol based on geographic routing and analyses each node to formthe segments and find the destination to transmit the data in timely manner.Findings-The paper provides the enhancement of the performance based on some metrics such as end-to-end delaythat obtained 0.62%,data throughput as 32.3%,packetdelivery ratio as 67%and one-hop communicationas 13%.The proposed ETSGR protocolanalyzes the state of the vehiclecorrectly and each node segmented to transmit the data with the timely manner and obtaining reliable performanceeven with highmobility of nodes in the network.Research limitations/implications-The proposed ETSGR protocol may have some limitation when considering the timing which should improve even in increasing many number of vehicles and different road segments.Practical implications-This paper includes some suggestions for the practical deployment of the approach in which a real-time traffic analysis can be evaluated for taking prior actions during an emergency situation and proper dissemination of data in timely manner can help utilize the guidance of proper planning of roads.Originality/value-This research fulfills an enhanced protocol to improve the performance of data dissemination.

Modeling of Propagation of Road Hazard Information in Sparse Vehicular ad hoc Networks

In this paper, we study the propagation of road hazard information to vehicles which enter the hazard segment of a highway in a sparse 1D vehicular ad hoc network(VANET) with store-and-forward mechanism. Store-and-forward is an option for message propagation in sparse vehicular networks where connectivity is intermittent. Upon receiving the message, the vehicle becomes an informed vehicle, it carries the message for a while and then forwards it to the approaching vehicles which are about to enter the highway segment. In this way, a platoon of informed vehicles is formed. We establish an analytical model to obtain the probability that a vehicle receives the message and joins the informed platoon. Moreover, we prove that traffic dynamics increase the reception probability of messages. We find the expected message propagation delay in the platoon using the store-and-forward policy. We also show that the propagation delay in store-and-forward inter-vehicle communications is tightly related to traffic parameters such as traffic flow rate and vehicle speeds on the highway. Results show that for smaller transmission ranges, smaller platoons are formed, the expected message propagation delay in the platoon is low, and it increases very slightly as the traffic flow rate increases. But for larger transmission ranges, larger platoons are formed, the expected delay is high, and it increases remarkably with a small increase in the traffic flow rate. The impacts of some network and traffic parameters such as transmission range, speed of vehicles, and highway speed limits on the message propagation are investigated as well. Finally, the accuracy of the analytical results is evaluated by an extensive simulation study.

An Adaptive and Opportunistic Broadcast Protocol for Vehicular Ad Hoc Networks

A primary goal of broadcasting in vehicular ad hoc network (VANET) is to improve the road safety by transmitting alert messages to all surrounding vehicles as soon as possible. In this paper, we adopt the concept of opportunistic routing and propose a multiple candidate relays opportunistic broadcast (MCROB) protocol for VANET. The MCROB protocol is a sender-driven broadcast scheme independent of node density. The packet delivery ratio (PDR) is derived and an expected transmission speed (ETS) for the MCROB is proposed. A priority rule for selecting a proper candidate relay and an adaptive algorithm for forwarding timers of candidate relays are also presented in this paper. Simulations show that MCROB is adaptive to the rapid changing of network conditions. It keeps a low communication overhead introduced by the broadcast and increases the average transmission speed by around 40%.

An Improved Cooperative Adaptive Cruise Control(CACC) Algorithm Considering Invalid Communication

For the Cooperative Adaptive Cruise Control （CACC） Algorithm, existing research studies mainly focus on how inter-vehicle communication can be used to develop CACC controller, the influence of the communication delays and lags of the actuators to the string stability. However, whether the string stability can be guaranteed when inter-vehicle communication is invalid partially has hardly been considered. This paper presents an improved CACC algorithm based on the sliding mode control theory and analyses the range of CACC controller parameters to maintain string stability. A dynamic model of vehicle spacing deviation in a platoon is then established, and the string stability conditions under improved CACC are analyzed. Unlike the traditional CACC algorithms, the proposed algorithm can ensure the functionality of the CACC system even if inter-vehicle communication is partially invalid. Finally, this paper establishes a platoon of five vehicles to simulate the improved CACC algorithm in MATLAB/Simulink, and the simulation results demonstrate that the improved CACC algorithm can maintain the string stability of a CACC platoon through adjusting the controller parameters and enlarging the spacing to prevent accidents. With guaranteed string stability, the proposed CACC algorithm can prevent oscillation of vehicle spacing and reduce chain collision accidents under real-world circumstances. This research proposes an improved CACC algorithm, which can guarantee the string stability when inter-vehicle communication is invalid.

A Review on the Recent Trends of Image Steganography for VANET Applications

Image steganography is a technique of concealing confidential information within an image without dramatically changing its outside look.Whereas vehicular ad hoc networks(VANETs),which enable vehicles to communicate with one another and with roadside infrastructure to enhance safety and traffic flow provide a range of value-added services,as they are an essential component of modern smart transportation systems.VANETs steganography has been suggested by many authors for secure,reliable message transfer between terminal/hope to terminal/hope and also to secure it from attack for privacy protection.This paper aims to determine whether using steganography is possible to improve data security and secrecy in VANET applications and to analyze effective steganography techniques for incorporating data into images while minimizing visual quality loss.According to simulations in literature and real-world studies,Image steganography proved to be an effectivemethod for secure communication on VANETs,even in difficult network conditions.In this research,we also explore a variety of steganography approaches for vehicular ad-hoc network transportation systems like vector embedding,statistics,spatial domain(SD),transform domain(TD),distortion,masking,and filtering.This study possibly shall help researchers to improve vehicle networks’ability to communicate securely and lay the door for innovative steganography methods.

Secure and Reliable Routing in the Internet of Vehicles Network:AODV-RL with BHA Attack Defense

Wireless technology is transforming the future of transportation through the development of the Internet of Vehicles(IoV).However,intricate security challenges are intertwinedwith technological progress:Vehicular ad hoc Networks(VANETs),a core component of IoV,face security issues,particularly the Black Hole Attack(BHA).This malicious attack disrupts the seamless flow of data and threatens the network’s overall reliability;also,BHA strategically disrupts communication pathways by dropping data packets from legitimate nodes altogether.Recognizing the importance of this challenge,we have introduced a new solution called ad hoc On-Demand Distance Vector-Reputation-based mechanism Local Outlier Factor(AODV-RL).The significance of AODVRL lies in its unique approach:it verifies and confirms the trustworthiness of network components,providing robust protection against BHA.An additional safety layer is established by implementing the Local Outlier Factor(LOF),which detects and addresses abnormal network behaviors.Rigorous testing of our solution has revealed its remarkable ability to enhance communication in VANETs.Specifically,Our experimental results achieve message delivery ratios of up to 94.25%andminimal packet loss ratios of just 0.297%.Based on our experimental results,the proposedmechanismsignificantly improves VANET communication reliability and security.These results promise a more secure and dependable future for IoV,capable of transforming transportation safety and efficiency.

Real traffic-data based evaluation of vehicular traffic environment and state- of-the-art with future issues in location-centric data dissemination for VANETs

Extensive investigation has been performed in location-centric or geocast routing protocols for reliable and efficient dissemination of information in Vehicular Adhoc Networks （VANETs）. Various location-centric routing protocols have been suggested in literature for road safety ITS applications considering urban and highway traffic environment. This paper characterizes vehicular environments based on real traffic data and investigates the evolution of location-centric data dissemination. The current study is carded out with three main objectives： （i） to analyze the impact of dynamic traffic environment on the design of data dissemination techniques, （ii） to characterize location-centric data dissemination in terms of functional and qualitative behavior of protocols, properties, and strengths and weaknesses, and （iii） to find some future research directions in information dissemination based on location. Vehicular traffic environments have been classified into three categories based on physical characteristics such as speed, inter-vehicular distance, neighborhood stability, traffic volume, etc. Real traffic data is considered to analyze on-road traffic environments based on the measurement of physical parameters and weather conditions. Design issues are identified in incorporating physical parameters and weather conditions into data dissemination. Functional and qualitative characteristics of location-centric techniques are explored considering urban and highway environments. Comparative analysis of location-centric techniques is carded out for both urban and highway environments individually based on some unique and common characteristics of the environments. Finally, some future research directions are identified in the area based on the detailed investigation of traffic environments and location-centric data dissemination techniques.

A Scalable Privacy Preserving Scheme in Vehicular Network

Vehicles enlisted with computing, sensing and communicating devices can create vehicular networks, a subset of cooperative systems in heterogeneous environments, aiming at improving safety and entertainment in traffic. In vehicular networks, a vehicle＇s identity is associated to its owner＇s identity as a unique linkage. Therefore, it is of importance to protect privacy of vehicles from being possibly tracked. Obviously, the privacy protection must be scalable because of the high mobility and large population of vehicles. In this work, we take a non-trivial step towards protecting privacy of vehicles. As privacy draws public concerns, we firstly present privacy implications of operational challenges from the public policy perspective. Additionally, we envision vehicular networks as geographically partitioned subnetworks （cells）. Each subnetwork maintains a list of pseudonyms. Each pseudonym includes the cell＇s geographic id and a random number as host id. Before starting communication, vehicles need to request a pseudonym on demand from pseudonym server. In order to improve utilization of pseudonyms, we address a stochastic model with time-varying arrival and departure rates. Our main contribution includes： 1） proposing a scalable and effective algorithm to protect privacy; 2） providing analytical results of probability, variance and expected number of requests on pseudonym servers. The empirical results confirm the accuracy of our analytical predictions.

A RELIABILITY ENHANCED DENSITY ADAPTIVE DATA DISSEMINATION SCHEME FOR VANETS

In this paper,a reliability enhanced and density adaptive data disseminating scheme is proposed for Vehicular Ad hoc NETworks(VANETs).The distributed on demand inquiring and responding mechanism is employed to get nodes' connectivity information.The announcing-listening process is also designed to find the nodes with bigger additional degree to rebroadcast,by which the relaying node is selected freely from density's influence.Simultaneously,a reliability parameter is designed to choose redundant relays for each hop.According to the importance of the broadcast,the parameter is set by the source node properly.Simulation results show that the scheme has achieved good performances such as low forwarding ratio,short latency and low load.The broadcast coverage ratio is ensured against the influence of key link errors and relaying nodes failure by paying suitable additional communication.