VANETs路由协议的研究进展

车辆自组织网络是传统自组织网络派生出的一个分支,其与应用场景高度相关.传统路由协议不能有效的适用于车辆自组织网络,因此,针对车辆自组织网络提出了许多新的路由协议.首先在总结车辆自组织网络的特性后,分别介绍了单播路由、广播路由和地域性多播路由的概念,然后着重分析和总结了近年来具有代表性的路由协议的核心路由机制及其优缺点,...     

移动自组网中基于预测的路由协议研究

由于移动自组网中的节点可以任意的运动，导致网络中传输路径的频繁断裂，大量的重路由操作降低了网络性能，并占用了有限的网络资源。而基于预测的路由协议能够有效地减少网络拓扑结构的变化对于路由操作的影响。文章主要讨论了目前已经提出的几种节点运动预测方案．以及基于预测的路由协议，并提出了进一步的研究方向。     

移动网络中的几种路由协议

一、前言 Ａｄ Ｈｏｃ网络是一种移动主机之间进行数据传输的网络。在这种网络中，不存在中心的基站或者说移动交换中心，移动主机之间通过对等的多跳技术来进行互联，而且Ａｄ Ｈｏｃ网络的拓扑结构也因为主机的移动发生动态的改变。移动主机与本机无线覆盖范围内的邻机直接通过无线链路通信．而与远处的移动主机的通信则需要依赖邻机来进行路由转发。因此，Ａｄ Ｈｏｃ网络中的移动主机本身都需具备路由功能．能完成相关的路由转发。近年来，出现过多种Ａｄ Ｈｏｃ网络路由协议，这些路由协议都必须处理移动网络中的典型的问题，如高能耗…     

移动Ad hoc网络路由协议标准

通过重点说明互联网工程任务组(IETF)已通过的两个移动Ad hoc网络路由协议标准,使得相关工程人员在对应用于此种网络的路由协议有一个整体认识基础之上,进一步加深对移动Ad hoc网络原理的理解.     

移动Ad hoc网络中基于链路稳定性预测的按需路由协议

移动Ad hoc网络拓扑的高度动态变化是造成传统按需路由协议的路由频繁通断的主要原因,因此在传统按需路由协议的基础上进行链路稳定性预测扩展,增强路由稳定性具有十分重要的意义。该文利用分组的接收功率把节点间的相对运动划分为靠近和远离两种类型,然后在不同相对运动类型下根据节点间距离得到了的链路平均维持时间。在路由过程中,中间节点利用得到的链路平均维持时间设置请求报文的转发延迟,通过一定转发规则选择稳定性较强的链路构成路径。仿真结果表明进行链路稳定性预测扩展后的按需路由协议能够有效增强路由的稳定性,并提高网络性能。     

移动自组织网络预测分簇算法的路由协议

针对移动自组织网络中传统分簇算法存在稳定性低、网络开销大的问题,在WCA分簇算法的基础上,提出一种带有预测机制的EWCA-MP(Efficient on-demand Weighted Clustering Algorithm using Mobility Prediction)分簇算法,该算法在簇头选择时充分考虑节点间的链路保持时间,在簇维护阶段引入模糊逻辑的概念,对Hello消息包的广播周期进行优化。并将其应用于CBRP中,提出了一种ECBRP-MP(Efficient Cluster Based Routing Protocol using Mobility Prediction)移动预测的分簇路由协议。仿真结果表明,EWCA-MP算法在簇头数目、单位时间内节点转移次数和统治集更新次数明显减少,ECBRP-MP路由协议在路由开销、分组投递率的性能得到优化。     

移动Ad hoc网络的路由协议及其性能比较

本文首先说明了Ad hoc网络中提供高效路由算法的难点，然后讨论了Ad hoc网络中路由协议设计的几种策略，介绍了模拟工具及其所支持的Ad hoc路由协议，最后通过实验分析比较了四种路由协议的性能，并给出了结论。     

基于定向天线的移动自组网路由协议研究

同等功耗下,定向天线能够产生更高的增益,提供更大的传输范围,提高网络的空间复用度和吞吐量,天线选择的方向性又降低了邻近结点之间的相互干扰,采用定向天线能够给移动自组网带来潜在性能的提高。对基于定向天线的移动自组网路由协议进行研究,简单介绍了定向天线,总结了引入定向天线产生的路由问题,对现有的一些典型定向路由协议进行了分类、介绍和比较,最后对引入定向天线带来的好处进行了分析。     

移动Ad hoc网络中路由协议的研究

移动Ad hoc网络由无线移动节点在没有任何现存的网络基础设施的情况下组成的自治系统,成为一个具有任意通信拓扑图模型的通信网络.由于网络节点的多跳性、有限的传输带宽、高速移动性、能量受限等特点,使路由协议成为Ad hoc网络设计的关键.主要介绍了Ad hoc网络的路由协议设计策略及分类原则,并对现有的具有代表性的路由协议性能进行了比较分析,为进一步研究提出新的课题.     

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.     

物联网环境中基于车联网与3G网络的跨层安全相关广播业务结构(英文)

As Vehicle Ad Hoc Networks (VANETs) is part of the applications of the Internet of Things (IoT), and Vehicles in VANETs periodically broadcast the beacon message for status advertisement to provide public safety, the impacts of the network parameters on the reliability of broadcast messages are investigated and discussed; meanwhile, a cross-layer safety-critical broadcast service architecture is proposed to obtain an optimized set of packet loss rate and delay based on the Neural Networks (NN) and Back Prop...     

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

车联网 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协议能够有效地降低开销和提高数据包传输率。     

基于移动性的AODV路由协议改进

介绍了Ad Hoc网络路由协议（Ad Hoc On-Demand Distance Vector Routing,AODV）的路由机制和特点,提出了一种基于AODV的改进协议V-AODV。V-AODV改进了AODV的路由测度,用量化的节点移动性代替跳数作为路由代价的度量,在动态网络中能够选取到更加稳定的路由。仿真表明,V-AODV比AODV在时延和重传次数等性能上都有一定程度的提升。     

A geographic routing protocol based on trunk line in VANETs

A Trunk Line Based Geographic Routing(TLBGR) protocol in Vehicular Ad-hoc Networks (VANETs) is proposed in this paper to solve the problem of data acquisition in the traditional trunk coordinated control system. Because of the characteristics of short communication time and high packet loss among vehicles, the vehicles entering the trunk lines can not transmit their information to the trunk coordinated control system stably. To resolve this problem, the proposed protocol uses the trunk lines’ traffic flow and the surrounding road network to provide a real-time data transmission routing scheme. It takes into account the data congestion problem caused by the large traffic flow of the main roads, which leads to the corresponding increase of the information flow of the section and the package loss, and the link partition problem caused by the insufficient traffic flow, which makes the vehicles have to carry and relay information thus increasing the transmission delay. The proposed TLBGR protocol can be divided into two stages: the next-intersection selection, and the next-hop selection in the chosen path between the current and next intersections. Simulation results show that, compared with other IoT routing protocols including Greedy Perimeter Stateless Routing (GPSR), Ad-hoc On Demand Vector (AODV), and Q-AODV, the TLBGR protocol has better performance in aspects of end-to-end delay, delivery rate, and routing cost under the scenario of urban traffic trunk lines. The TLBGR protocol can effectively avoid data congestion and local optimum problems, increase the delivery rate of data packets, and is therefore suitable for the routing requirements in this application scenario.     

VANETs城市场景下基于自适应时延的Geocast路由协议

基于广播式的Geocast路由协议能够在特定的地理区域内高效地发布数据.然而,广播模式引起冗余重播,易导致广播风暴问题.另外,由于城市场景下建筑物的影响,现有的多数广播抑制方案难以应用于城市环境.为此,提出面向城市的基于自适应时延的Geocast路由协议UGAD.UGAD采用了基于自适应时延的广播抑制方案,降低发生广播风暴的概率.同时,考虑到交叉路口的地理优势,给位于交叉路口的车辆“优惠”时延,使其具有优先转发数据包权力,从而提高数据包到达率.此外,考虑到城市道路的复杂性,UAGD采用基于交叉路口转发IF和贪婪转发GF两个模式,依据不同的道路情况选择不同的转发模式,从而降低冗余重播,并保持高的数据包到达率.最后,针对城市场景进行仿真,结果表明提出的UGAD具有高的数据包到达率,低的数据包重播率.     

Road traffic and geography topology based opportunistic routing for VANETs

The message delivery .ratio and transmission delay is affected deeply by road traffic flow in vehicular ad hoc networks （VANETs）. An opportunistic routing based on geography and road traffic flow for VANETs （ORRIS） was proposed. ORRIS leverages the knowledge of geography positions, motion vectors and road traffic flows. In order to estimate the traffic flow density, the history of encounter number of the vehicles in the opposite direction is considered in ORRIS. The forwarding decisions are made by distributed vehicles based on the geography topology and the road traffic flow. The real map based simulation results show that ORRIS has a better performance than other algorithms, especially when the road traffic is busy or the traffic flow rates have great differences between roads.     

车载网络中基于区域覆盖的机会传递算法研究

The highly mobility of vehicles, intermit-tent communication between the vehicles and the requirements of real time applications are some of the main challenges of multi-hop message delivery in Vehicular Ad Hoc Networks(VANETs).There are also additional challenges, especially when the des-tination for the message delivery is a moving vehi-cle. In this paper, we propose a novel multi-hop message delivery method, called the Coverage Area-based oPportunistic message forwarding algorithm (CAP). The main idea of CAP is to cover the poten-tial area of a moving target vehicle as much as pos-sible with the reachable area of the required deliver-y messages, so that the message can be delivered successfully. Because the success ratio and overhead of the multi-hop message delivery are two important but incompatible parameters in CAP, two tunings are discussed in the algorithm in order to maintain the balance of the two parameters. The simulation results show that compared with other reference ap-proaches, CAP provides an efficient message deliv-ery with a higher success ratio and a shorter mes-sage delay.