基于速度向量的VANET位置预测路由协议  

Position Prediction Routing Protocol for VANET Based on Velocity Vectors

作　　者：谢波[1] 肖晓强[1] 徐明[1] 宋宏斌[1] 

机构地区：[1]国防科技大学计算机学院,长沙410073

出　　处：《计算机工程》2009年第23期112-114,共3页Computer Engineering

基　　金：国家自然科学基金资助项目(60773017)

摘　　要：针对车辆自组网(VANET)中车辆快速移动引起的网络拓扑快速变化及路由路径频繁切换引起的网络性能下降问题,提出一种适用于城市环境的基于速度向量的位置预测路由协议(VPRP)。该协议根据行驶方向将车辆分组,根据速度和当前位置预测下一步位置,选择路径中所有节点总的方向差异最小且总的距离变化最小的路径作为路由路径。仿真实验结果表明,VPRP比AODV和VHRP在吞吐量、分组投递率、平均传输延迟、控制开销等方面均有改进。Routing of data in a Vehicular Ad hoc Network（VANET） is a challenging task due to the high dynamics of such a network, and the performance is declined due to the partition of the network. This paper puts forward a Velocity based Position predictive Routing Protocol（VPRP） for VANET in city. It groups the vehicles into four different groups based on their velocity vectors, predicts the next positions by the velocity and the positions of this moment, and selects the path whose total difference among the relay nodes in direction and distance is the least. Simulation experimental results indicate that VPRP performs better than AODV and VHRP in throughput, packet delivery ratio, average delay and control consumption.

关 键 词：车辆自组网 路由协议 速度向量 位置预测 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]