摘要： 在高速移动环境中，车载自组网的下一跳节点选择算法存在高丢包率的问题。为此，在贪婪算法的基础上，通过预测车辆节点的链路持续时间(LD)和数据发送时延，提出一种改进的下一跳节点选择算法。其中，转发节点根据邻居节点和自身的相对速度，预测该节点和当前节点间的链路持续时间，选择其值不小于待发数据的发送时延的邻居节点作为下一跳节点。仿真实验结果表明，改进算法可以明显降低贪婪算法的丢包率。
关键词:
车载自组网,
贪婪路由算法,
链路持续时间,
下一跳选择
Abstract: Aiming at the problem of high lose packet rate in Vehicular Ad Hoc Network(VANET) in which vehicle nodes move at high speed, this paper proposes an improved algorithm based on greedy routing algorithm, which is combined with Link Duration(LD) and data sending delay. Based on relative velocity between neighbor node and current node, next hop node is selected, whoes LD is longer than sending delay. Simulation results show that the rate of transmission error is decreased by the improved algorithm.]
Key words:
Vehicular Ad Hoc Network(VANET),
greedy routing algorithm,
Link Duration(LD),
next-hop selection
中图分类号:
计成超, 糜正琨. 基于LD预测的车载自组网下一跳选择算法[J]. 计算机工程, 2012, 38(7): 7-9.
JI Cheng-Chao, MEI Zheng-Kun. Next-hop Selection Algorithm of Vehicular Ad Hoc Network Based on Link Duration Prediction[J]. Computer Engineering, 2012, 38(7): 7-9.