车载网中面向高速场景的路由算法  

A routing algorithm toward highway scenario in vehicular ad hoc networks

作　　者：臧冠男 沈继伟[3] 林洋[1] 

机构地区：[1]长春大学电子信息工程学院,吉林长春130022 [2]吉林广播电视大学,吉林长春130022 [3]长春职业技术学院,吉林长春130000

出　　处：《现代电子技术》2018年第4期164-168,共5页Modern Electronics Technique

基　　金：国家自然科学基金(51406140);吉林广播电视大学;吉林省学习成果积累与转换信息服务平台(学分银行)建设研究与实践项目(2015ZCY336)~~

摘　　要：有效地传输数据是提高车联网应用性能的关键。而动态的拓扑结构,给车联网的数据传输提出了挑战。为此,提出基于路径连通概率的车联网路由算法CPB。首先,依据高速公路场景,建立一维车辆移动模型,然后再计算链路的连通概率,最后,计算路径的连通概率,并选择连通概率最高的路径传输数据。仿真结果表明,提出的CPB算法能够有效地提高数据包传递率、端到端传输时延以及吞吐量性能。Effective data transmission is the key to improving the application performance of vehicular ad hoc networks(VANETs). However,dynamic topology is a great challenge for VANETs′ data transmission. Therefore,a path connection probability based routing algorithm for VANETs is proposed. The one-dimensional vehicle mobility model is established according to the highway scenario. The link connection probability is computed. The path connection probability is computed,and the path with maximum connection probability is selected to transmit data. The simulation results show that the proposed CPB algorithm can effectively improve the performance in delivery ratio of data packet,end-to-end transmission delay and throughput.

关 键 词：连通概率 路由 移动模型 路径 时延 车联网 

分 类 号：TN711.34[电子电信—电路与系统] TP393[自动化与计算机技术—计算机应用技术]