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.

Network Connectivity Probability of Linear Vehicular Ad Hoc Networks on Two-Way Street

In this paper, we present an analytical model to determine the network connectivity probability of a linear vehicular ad hoc network (VANET) formed by communication equipped vehicles on a two-way street scenario. We consider the highway to be consisting of two lanes with vehicles moving in both directions on these lanes and focus on the probability of being able to convey messages from a source vehicle to a destination vehicle, which may be multiple hops away. Closed form analytical expression is obtained for the network connectivity probability in the presence of Nakagami fading channel. In our model, the transmission range of each vehicle is modeled as a random variable due to channel fading. The analytical results are validated by extensive simulations.

Review of the Security Issues in Vehicular Ad Hoc Networks (VANET)

There is a significant increase in the rates of vehicle accidents in countries around the world and also the casualties involved ever year. New technologies have been explored relating to the Vehicular Ad Hoc Network (VANET) due to the increase in vehicular traffic/congestions around us. Vehicular communication is very important as technology has evolved. The research of VANET and development of proposed systems and implementation would increase safety among road users and improve the comfort for the corresponding passengers, drivers and also other road users, and a great improvement in the traffic efficiency would be achieved. This research paper investigates the current and existing security issues associated with the VANET and exposes any slack amongst them in order to lighten possible problem domains in this field.

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.

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.

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.

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%.

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.

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.

The research of traffic density extraction method under vehicular ad hoc network environment

Purpose–Traffic density is one of the most important parameters to consider in the traffic operationfield.Owing to limited data sources,traditional methods cannot extract traffic density directly.In the vehicular ad hoc network(VANET)environment,the vehicle-to-vehicle(V2V)and vehicle-to-infrastructure(V2I)interaction technologies create better conditions for collecting the whole time-space and refined traffic data,which provides a new approach to solving this problem.Design/methodology/approach–On that basis,a real-time traffic density extraction method has been proposed,including lane density,segment density and network density.Meanwhile,using SUMO and OMNet11 as traffic simulator and network simulator,respectively,the Veins framework as middleware and the two-way coupling VANET simulation platform was constructed.Findings–Based on the simulation platform,a simulated intersection in Shanghai was developed to investigate the adaptability of the model.Originality/value–Most research studies use separate simulation methods,importing trace data obtained by using from the simulation software to the communication simulation software.In this paper,the tight coupling simulation method is applied.Using real-time data and history data,the research focuses on the establishment and validation of the traffic density extraction model.

Vehicle Positioning Method Based on RFID in Vehicular Ad-Hoc Networks

With the rapid development of vehicular ad hoc network( VANET) technology,VANET applications such as safe driving and emergency rescue demand high position accuracy,but traditional GPS is difficult to meet new accuracy requirements. To overcome this limitation,a new vehicle positioning method based on radio frequency identification( RFID) is proposed. First RFID base stations are divided into three categories using fuzzy technology,and then Chan algorithm is used to calculate three vehicles' positions,which are weighed to acquire vehicles' accurate position. This method can effectively overcome the problem that vehicle positioning accuracy is not high resulting from the factors such as ambient noise and base distribution when Chan algorithm is used. Experimental results show that the performance of the proposed method is superior to Chan algorithm and 2-step algorithm based on averaging method,which can satisfy the requirements of vehicle positioning in VANETs.

Effective Life and Area Based Data Storing and Deployment in Vehicular Ad-Hoc Networks

In vehicular ad-hoc networks (VANETs), store-carry-forward approach may be used for data sharing, where moving vehicles carry and exchange data when they go by each other. In this approach, storage resource in a vehicle is generally limited. Therefore, attributes of data that have to be stored in vehicles are an important factor in order to efficiently distribute desired data. In VANETs, there are different types of data which depend on the time and location. Such kind of data cannot be deployed adequately to the requesting vehicles only by popularity-based rule. In this paper, we propose a data distribution method that takes into account the effective life and area in addition to popularity of data. Our extensive simulation results demonstrate drastic improvements on acquisition performance of the time and area specific data.

Tree-Based Revocation for Certificateless Authentication in Vehicular Ad-Hoc Networks

This work proposes authentication based on identity as a way to increase the efficiency and security of communications in vehicular ad-hoc networks. When using identity-based cryptography to achieve certificateless authentication, membership revocation is not a trivial problem. Thus, in order to improve the performance of revocation in such networks, the use of a dynamic authenticated data structure based on perfect k-ary hash trees combined with a duplex version of the new standard SHA-3 is here presented. Efficient algorithms in the used revocation trees allow reaching a refresh rate of at most simple updates per inserted node. Consequently, the proposal is especially useful for situations with frequent revocations, which are foreseeable when vehicular ad- hoc networks are widely deployed.