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.

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.

Cybersecurity and Privacy Protection in Vehicular Networks (VANETs)

As Vehicular ad hoc networks (VANETs) become more sophisticated, the importance of integrating data protection and cybersecurity is increasingly evident. This paper offers a comprehensive investigation into the challenges and solutions associated with the privacy implications within VANETs, rooted in an intricate landscape of cross-jurisdictional data protection regulations. Our examination underscores the unique nature of VANETs, which, unlike other ad-hoc networks, demand heightened security and privacy considerations due to their exposure to sensitive data such as vehicle identifiers, routes, and more. Through a rigorous exploration of pseudonymization schemes, with a notable emphasis on the Density-based Location Privacy (DLP) method, we elucidate the potential to mitigate and sometimes sidestep the heavy compliance burdens associated with data protection laws. Furthermore, this paper illuminates the cybersecurity vulnerabilities inherent to VANETs, proposing robust countermeasures, including secure data transmission protocols. In synthesizing our findings, we advocate for the proactive adoption of protective mechanisms to facilitate the broader acceptance of VANET technology while concurrently addressing regulatory and cybersecurity hurdles.

Software Defined Networking Based On-Demand Routing Protocol in Vehicle Ad-Hoc Networks

This paper comes up with a SDN Based Vehicle Ad-Hoc On-Demand Routing Protocol(SVAO),which separates the data forwarding layer and network control layer,as in software defined networking(SDN),to enhance data transmission efficiency within vehicle ad-hoc networks(VANETs).The roadside service unit plays the role of local controller and is in charge of selecting vehicles to forward packets within a road segment.All the vehicles state in the road.Correspondingly,a two-level design is used.The global level is distributed and adopts a ranked query scheme to collect vehicle information and determine the road segments along which a message should be forwarded.On the other hand,the local level is in charge of selecting forwarding vehicles in each road segment determined by the global level.We implement two routing algorithms of SVAO,and compare their performance in our simulation.We compare SVAO with popular ad-hoc network routing protocols,including Optimized Link State Routing(OLSR),Dynamic Source Routing(DSR),Destination Sequence Distance Vector(DSDV),and distance-based routing protocol(DB)via simulations.We consider the impact of vehicle density,speed on data transmission rate and average packet delay.The simulation results show that SVAO performs better than the others in large-scale networks or with high vehicle speeds.

Navigation Route Based Stable Clustering for Vehicular Ad Hoc Networks

Due to high node mobility, stability has been always one of the major concerns of vehicle clustering algorithms in vehicular ad hoc networks. In this paper, we propose a novel clustering algorithm based on the information of routes planned by vehicular navigation systems. In the clustering algorithm, we design a residual route time function to quantitatively calculate the overlapping time among vehicles based on route information, with which a novel clusterhead selection metric is presented. We further design a mechanism of future-clusterhead, which can help avoid message exchanges at intersections and reduce the overhead of cluster maintenance. The simulation results show that, compared with previous works, our clustering algorithm can achieve higher stability and at the same time lower communication cost.

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.

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.

VANET中隐私保护的格基异构签密方案

针对车载自组织网络(Vehicular Ad hoc Network,VANET)中车辆跨密码系统通信过程中的隐私泄露问题,提出了一种格基异构签密方案.首先,方案实现了无证书密码系统(Certificateless Cryptosystem,CLC)的车辆与基于身份密码系统(Identity-Based Cryptosystem,IBC)的车辆相互通信;其次利用签密的机密性和可认证性防止车辆用户在跨密码系统通信过程中发生隐私泄露,并实现了接收方对消息完整性以及发送方身份合法性的认证;最后在随机预言机模型下证明了方案在适应性选择密文攻击下具有不可区分性(Indistinguishability against adaptive Chosen Cipher Text Attack,IND-CCA2),在适应性选择消息攻击下具有存在性不可伪造性(Existential Unforgeability against adaptive Chosen Messages Attack,EUF-CMA).性能分析表明,与其他方案相比,本文方案在计算开销、通信开销和安全性方面具有一定优势,适用于车辆跨密码系统通信的场景.

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.

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.

车载Ad Hoc网络中基于移动网关的数据传输

由于车载Ad hoc网络拓扑的动态变化及车载节点的快速移动,应用现有传输方法在其上进行Internet接入点向移动车辆(Infrastructure-to-Vehicle,I2V)数据传输时成功率较低,而且传输延迟高、延迟抖动大.为了解决这一问题,文中利用公交车路线固定、运行特征可预测、节点及线路分布稠密等特性,将公交车作为移动网关(Mobile Gateway,MG),提出了一种新的基于MG转发的I2V数据传输方法(Mobile Gateway based Forwarding,MGF).文中首先将公路网模型化为状态-空间图,再运用马尔可夫决策方法建立了一种基于MG转发的I2V数据传输优化模型,然后通过对模型求解得出I2V数据传输的最优转发决策,最优转发决策指的就是每个状态下对应的最优动作序列,最后在目的车辆行驶轨迹上选取满足传输成功率阈值,并使I2V传输延迟最小的路口节点作为数据包与目的车辆的最优汇聚节点,即目标节点.应用MGF方法,MG节点将以最优概率转发序列向目标节点转发数据包.文中利用模拟平台对MGF方法的传输性能进行了评估,结果表明该方法在满足传输成功率阈值前提下,能够获得最小传输延迟期望.理论分析同样也证明了该方法的有效性.

一种基于方向优先的车载Ad hoc路由策略

针对城市车载网络在十字路口路由选择效率低下的问题,结合已有的地理位置路由协议,提出一种基于方向优先的地理位置路由策略。该策略通过信标的广播信息确定节点的类型,是属于普通节点、预测节点或者十字路口节点;然后再判断采取什么样的方式转发数据包,普通节点采取贪婪转发的方式,预测节点采取受限的贪婪转发,而十字路口节点决定路由策略的方向。通过NS2仿真分析,该路由策略能够以更少的跳数、更短的路径成功传递数据包。

VANET随机部署环境下基于改进型共享最近邻密度峰聚类的快速分簇算法

针对车辆高速移动场景下,网络拓扑变化过大导致网络分簇结果不稳定的问题,提出一种基于改进型共享最近邻密度峰聚类的快速成簇算法SNNCA(shared nearest neighbor clustering algorithm);通过综合考虑节点的链路生存周期和移动相似性,提出一种全新的节点连接稳定程度评估指标,并将该评估指标应用于节点共享最近邻的计算过程,以组织网络节点为划分合理的多跳簇结构;为适应网络环境的动态变化,提出一种簇维护策略,其中每个层级的簇成员承担着维护下一层级簇成员的任务,该策略能够对簇成员进行批量分离或合并,从而实现了算法的分布式快速收敛;根据随机部署场景中进行的仿真实验结果显示,相比其他较新算法,SNNCA算法降低了74%的簇数量,并且簇成员的平均存活时间增加了近1倍,表现出更好的网络稳定性和健壮性。

车载Ad Hoc网络中位置服务机制研究与设计

作为移动Ad Hoc网络具体应用之一的车载Ad Hoc网络具有许多自身特征,如车辆节点处于十字路口时存在许多等待绿灯的静止节点以及通行速度相对缓慢的通行节点。在考虑了上述特征之后,提出了一种适用于车载Ad Hoc网络的新的位置服务设计方案,该设计方案将位置服务与基于位置的路由协议如无状态路由协议GPSR进行融合。在城市场景下的仿真结果表明:通过与GLS和HLS相比,ILSV获得相当高的查询成功率并具有较优的可缩放性。

Secure Model to Generate Path Map for Vehicles in Unusual Road Incidents Using Association Rule Based Mining in VANET

Logical behavioral arrangements are a class of conventional arrangements to illustrate the happening of incidents in an appropriate and structured approach in vehicular ad hoc network （VANET）. These incidents are characterized as a list of path segments that are passed through by the vehicles for the duration of their journeys from a pre-decided local source to a local destination in a structured manner. A set of proper description illustrating the paths traversed by the vehicles as logical behavioral arrangements is describedin this paper. The data gathering scheme based on secure authentication to gather the data from the vehicles is proposed in this paper. This proposed data gathering scheme based on secure authentication is compared with the existing data gathering schemes by using veins framework and the results of analysis reflect that the proposed scheme outperforms among others. The data collected from the vehicles by the proposed data gathering scheme is stored at distributed road side units （RSUs）. From these collected paths, the common and frequent paths opted by the vehicles in a certain region are determined by using frequent arrangement mining approach. An estimation model is used to decidethe next path and the whole path map opted by the vehicles in unusual situations like accident, jams, or a particular time of day. The proposed scheme will helpthe society in reducing the waiting time in vent of emergency or normal working days.

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.

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 routing protocol based on relative positions in VANETs

After presenting weaknesses of several classic routing protocols applied in vehicular ad hoc networks （VANETs） by a qualitative comparison, this paper proposes a novel self-adaptive routing protocol, named ARPP. With respect to the specific characteristics of VANETs, the proposed routing protocol adopts a dynamic topology establishment and time-varying control message sending mechanism. A direction-based forwarding strategy and a specific warning solution enhance the routing performance in ARPP. Simulation results show that the ARPP protocol outperforms the classic AODV in urban vehicle environment.