摘要
为提高车载自组网端到端路径存活期,提出一种基于高可靠束路径的路由规划算法LGGR。该算法通过分发网络连通性信息,使每个十字路口的节点可以感知与相邻十字路口节点的连通情况,通过计算十字路口的度、路径段存活期和自逾期确定最佳束路径,从而保证网络高连通性,延长路径存活期。仿真结果表明,LGGR的性能优于AODV、GPSR等算法。
In order to improve the end-to-end lifetime of paths in Vehicular Ad Hoc Networks（VANET）,this paper proposes a route planning algorithm named LGGR based on high-reliable beam path.Every node in an intersection learns if it is connected with those nodes in a neighbored intersection by disseminating connectivity information.The degree of intersections and lifetime and self-heal time of route segments are considered as key measurements to select forward nodes.The forward node with high network connectivity and long path lifetime is selected,and a high-reliable beam path is formed after a lot of route decisions.Simulation results reveal that LGGR outperforms traditional algorithms,such as AODV,GPSR.
出处
《计算机工程》
CAS
CSCD
北大核心
2011年第10期70-72,共3页
Computer Engineering
基金
河南省教育厅基金资助项目(2010A510001)
河南大学基金资助项目(2008YBZR028)
关键词
车载自组网
束路径
路由规划
网络连通性
Vehicular Ad Hoc Networks（VANET）
beam path
route planning
network connectivity
