RIVER: A reliable inter-vehicular routing protocol for vehicular ad hoc networks

Vehicular Ad hoc NETworks (VANETs), an emerging technology, would allow vehicles on roads to form a self-organized network without the aid of a permanent infrastructure. As a prerequisite to communication in VANETs, an efficient route between communicating nodes in the network must be established, and the routing protocol must adapt to the rapidly changing topology of vehicles in motion. This is one of the goals of VANET routing protocols. In this paper, we present an efficient routing protocol for VANETs, called the Reliable Inter-VEhicular Routing (RIVER) protocol. RIVER utilizes an undirected graph that represents the surrounding street layout where the vertices of the graph are points at which streets curve or intersect, and the graph edges represent the street segments between those vertices. Unlike existing protocols, RIVER performs real-time, active traffic monitoring and uses these data and other data gathered through passive mechanisms to assign a reliability rating to each street edge. The protocol then uses these reliability ratings to select the most reliable route. Control messages are used to identify a node’s neighbors, determine the reliability of street edges, and to share street edge reliability information with other nodes.     

带协作式监视节点的安全VANETs路由算法

车载网VANETs(vehicular ad hoc networks)的路由协议中总是存在VANETs恶意节点试图破坏消息的正常传递。为此,对车载网无信标路由算法BRAVE(beacon-less routing algorithm for vehicular environments)进行改进,提出一种带协作式监视节点的安全路由算法S-BRAVE。在公钥基础设施PKI(public key infrastructure)的基础上,引用证书交互策略,对消息加载证书并传递过程中进行验证;在路由协议中设置协作式监视节点监视消息的传递,如消息不能传递到目的节点,该节点将担任传递消息的任务,同时调整BRAVE内消息格式使得S-BARVE能防御选择性转发攻击;将S-BRAVE与BRAVE协议在分组投递率、开销和端到端时延等性能方面进行对比。实验结果表明,S-BRAVE的分组投递率提升50%,考虑到开销和时延等方面,S-BARVE适用于大范围节点密集环境。     

Performance enhancement of traffic information gathering (PEnTInG) algorithm for vehicular ad‐hoc networks

Vehicular ad‐hoc networks (VANETs) play a vital role in today's context of vehicular traffic. In this paper, clusters of vehicles are created on the basis of average speed of the vehicles. One cluster communicates with the next cluster through a cluster head and also share the same information with next cluster heads and installed road side units (RSUs). By using this technique, we can solve the problem of rough driving behavior and road terrorism which is due to speed variation of vehicles and fake information dissemination by the drivers. Many a times, drivers may spread fake accident‐related information into the network which is a serious cause of concern in VANETs. It is ensured that such drivers are not allowed to spread wrong information in the network to avoid accidents. To solve this problem, we developed performance enhancement of traffic information gathering (PEnTInG) algorithm that selects only those drivers/vehicles as cluster heads in a cluster who has maximum value of the cluster head factor (CHF). The CHF is derived by considering different weights in range of 0 to 1 of relative average speed, time to leave, trust factor, and neighborhood degree. Further, the elected cluster head shares and stores the same information with the RSUs. In case, a driver wants to disseminate fake or wrong information in a network, then that vehicle driver can be easily tracked by the local authority by accessing RSU data. Simulation results show that the stability of PEnTInG is increased by 25% against the existing schemes viz. lowest‐ID, MCMF, and cluster‐based technique.     

社会感知多副本车载自组织网络机会路由协议

为提高车载自组织网络(vehicular Ad hoc networks, VANETs)中消息投递的效率, 提出了一种社会感知多副本车载自组织网络机会路由协议(SAMOR)。协议结合了车载自组织网络中节点的社会性特点和多副本路由方案的优势, 采用携带—存储—转发的机会路由方式进行消息投递。利用节点间的相遇历史区分社区节点和全局节点, 并使用所提出的节点社区中心性和网络中心性的度量方法, 得到了节点的效用。在路由过程的扩散阶段, 节点间按效用分配副本, 在转发阶段, 副本继续向效用高的节点转发。仿真结果表明, SAMOR实现了较高的消息投递成功率和较低的延迟。     

A statistical approach for enhancing security in VANETs with efficient rogue node detection using fog computing

Rogue nodes broadcasting false information in beacon messages may lead to catastrophic consequences in Vehicular Ad Hoc Networks (VANETs). Previous researchers used cryptography, trust scores, or past vehicle data to detect rogue nodes; however, these methods suffer from high processing delay, overhead, and False–Positive Rate (FPR). We propose herein Greenshield's traffic model–based fog computing scheme called Fog–based Rogue Node Detection (F–RouND), which dynamically utilizes the On–Board Units (OBUs) of all vehicles in the region for rogue node detection. We aim to reduce the data processing delays and FPR in detecting rogue nodes at high vehicle densities. The performance of the F–RouND framework was evaluated via simulations. Results show that the F–RouND framework ensures 45% lower processing delays, 12% lower overhead, and 36% lower FPR at the urban scenario than the existing rogue node detection schemes even when the number of rogue nodes increases by up to 40% in the region.     

基于单播和无比率编码的地域性多播路由协议

车联网 VANETs(Vehicular ad hoc networks)是传统自组织网络派生的一个子类,具有鲜明的特性。传统的地域性多播协议不能有效地适用于车联网。为此,提出了基于单播和无比率编码的地域性多播路由URC-GR( unicast and rateless coding based geocast routing)协议。URC-GR协议引用两个策略解决传统地域性多播路由协议在开销和数据包传递率方面的不足。首先,利用单播机制向目标区域传输数据,然后,在目标区域内再泛洪。其次,利用无比率编码提高数据传输率。最后,将提出的URC-GR协议与IVG(Inter Vehicle Geocast)、DRG(Distributed Robust Geocast)协议进行比较,仿真结果表明URC-GR协议能够有效地降低开销和提高数据包传输率。     

面向可扩展的VANETs混合路由的研究与仿真

车载网VANETs(Vehicular ad hoc networks)属于高速移动的无线网络,可供车辆安全、交通监测以及其他的商业服务的应用。然而,为此,提出混合式的位VANETs中车辆的快速移动导致通信链路频繁地断裂,增加路由开销,降低了可扩展性。议地理位置路由的特点。HLAR(Hybrid location-based ad hoc routing)。HLAR结合了反应式路由、HLAR克服了反应式路由的扩展性问题,并改善了地理位置路由对位置误差的敏感性。同时,通过理论分析,量可扩展性,并推导了路由开销的表达式。通过分析、仿真表明,提出的路由协议具有很好的扩展性,并降低了路由开销。在仿真中引入位置误差因子,结果表明。同时,与同类的其他协议相比,输时延方面HLAR到对位置误差具有很强的鲁棒性HLAR在数据传输率、端到端传提升。     

Review on Identity-Based Batch Verification Schemes for Security and Privacy in VANETs

The study of vehicular ad-hoc networks (VANETs) has received significant attention among academia; even so, its security and privacy still become a central issue that is wide-open to discuss. The authentication schemes deployed in VANETs have a substantial impact on its security and privacy. Many researchers have proposed a variety of schemes related to the information verification and efficiency improvement in VANETs. In recent years, many papers have proposed identity-based batch verification (IBV) schemes in regard to diminishing overhead in the message verification process in VANETs. This survey begins with providing background information about VANETs and clarifying its security and privacy, as well as performance requirements that must be satisfied. After presenting an outlook of some relevant surveys of VANETs, a brief review of some IBV schemes published in recent years is conferred. The detailed approach of each scheme, with a comprehensive comparison between them, has been provided afterward. Finally, we summarize those recent studies and possible future improvements.     

基于层次分析法的车联网多因素信誉评价模型

针对车联网（VANETs）场景下存在的恶意车辆节点和虚假信息的问题,提出基于层次分析法（AHP）的车联网多因素信誉评价模型. 该模型综合考虑车辆行为、消息、环境等因素对车辆节点信誉的影响,建立车辆信誉评价模型;面向多应用场景信息（安全行驶、交通管理、商业娱乐）,使用层次分析法量化各因素及不同类型信息对车辆信誉的影响程度;基于反馈机制根据信息的不同类型进行车辆节点的信誉更新,实现车联网车辆的信誉评估. 实验表明,该模型在恶意车辆节点达到25%的情况下,车辆决策正确率能够达到92%以上. 该方案能够有效防止车辆接收虚假信息,准确检测出网络中的恶意车辆节点,提高车辆接收信息的可信度.     

An Efficient Multi-hop Broadcast Protocol for Emergency Messages Dissemination in VANETs

Black-burst based multi-hop broadcast protocols are effective means to disseminate Emergency messages (EMs) in Vehicular ad hoc networks (VANETs). However, Clear to broadcast (CTB) collision will happen and reduce propagation speed. Aiming at this problem, we propose a Black-burst and multi-channel based multi-hop broadcast (BMMB) protocol. Vehicles with multiple antennas can transmit and sense black-burst at different channels simultaneously based on multi-channel technol-ogy. Compared with existing black-burst based methods, BMMB shortens the iterative procedure to find out the optimal segment. Only one relay vehicle can be rapidly se-lected within the optimal segment without CTB collision. BMMB enables alternative broadcast methods, i.e., uni-directional broadcast and multi-directional broadcast for straight roads and intersections respectively. Theoretical analysis is done for performance evaluation of BMMB, and simulation results demonstrate that BMMB performs better in terms of average one-hop delay and propagation speed.