首页 | 本学科首页   官方微博 | 高级检索  
     

基于高可靠束路径的车载自组网路由规划算法
引用本文:陈立家,高伟,代震,邓浩.基于高可靠束路径的车载自组网路由规划算法[J].计算机工程,2011,37(10):70-72.
作者姓名:陈立家  高伟  代震  邓浩
作者单位:河南大学物理与电子学院,河南,开封,475004
基金项目:河南省教育厅基金资助项目,河南大学基金资助项目
摘    要:为提高车载自组网端到端路径存活期,提出一种基于高可靠束路径的路由规划算法LGGR。该算法通过分发网络连通性信息,使每个十字路口的节点可以感知与相邻十字路口节点的连通情况,通过计算十字路口的度、路径段存活期和自逾期确定最佳束路径,从而保证网络高连通性,延长路径存活期。仿真结果表明,LGGR的性能优于AODV、GPSR等算法。

关 键 词:车载自组网  束路径  路由规划  网络连通性

Route Planning Algorithm Based on High-reliable Beam Path in Vehicular Ad Hoc Networks
CHEN Li-jia,GAO Wei,DAI Zhen,DENG Hao.Route Planning Algorithm Based on High-reliable Beam Path in Vehicular Ad Hoc Networks[J].Computer Engineering,2011,37(10):70-72.
Authors:CHEN Li-jia  GAO Wei  DAI Zhen  DENG Hao
Affiliation:(School of Physics and Electronics,Henan University,Kaifeng 475004,China)
Abstract: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.
Keywords:Vehicular Ad Hoc Networks(VANET)  beam path  route planning  network connectivity
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号