基于真实城市地图的车联网路由算法性能比较

Performance Simulation and Comparison of the Routing Algorithms in VANETs Based on Real Urban Map

车联网(VANETs,Vehicle Ad Hoc Networks)相比于传统的自组织网络,存在节点速度快、网络拓扑结构变化频繁等特点。为了研究现有的自组织网络中的路由算法是否适用于城市车联网场景,基于真实城市地图,在节点的不同移动速度、不同数据包大小两种情况下,利用NS2软件比较了采用AODV(Ad Hoc On-Demand Distance Vector Routing)、DSR(Dynamic Source Routing)、DSDV(Destination-Sequenced Distance-Vector Routing)三种典型的Ad Hoc网络路由算法以及基于网络编码的CAODV(COPE+AODV)路由算法下的车联网的时延、延时抖动、丢包率、吞吐量等网络的性能。仿真结果表明,在城市场景下,DSR的性能略优于其他三种路由算法。

VANETs differ from the traditional Ad Hoc networks due to their high speed,uneven distribution,and topology＇s variations.Then,it is necessary to study that whether the traditional routing algorithms in Ad Hoc network are suitable for VANETs or not.Based on the real urban map,the end-to-end delay,jitter,packet loss rate are compared,throughput performance respectively of VANETs when AODV,DSDV,DSR and CAODV are used with different speed and data packet size.Simulation results show that DSR outperforms the other three routing algorithms.