基于排序的高效交通信息分发算法  

Efficient traffic information dissemination algorithm based on ranking

作　　者：钟婷[1] 秦志光[1] 

机构地区：[1]电子科技大学计算机学院,四川成都610054

出　　处：《通信学报》2009年第8期1-8,共8页Journal on Communications

基　　金：国家自然科学基金资助项目(60573129;60473090)~~

摘　　要：提出了一种高效的基于车载自组网的实时交通信息分发算法——ETDAR算法。ETDAR算法中,所有的参与者根据本地信息确定交通信息报告的分发时机及每次广播的报告数,有效地利用了带宽并能很好地适应于各种密度的网络拓扑。算法通过对报告进行排序来解决带宽及节点存储量受限等问题。最后,提出了一种新的算法性能评估标准,并基于此评估标准,通过仿真实验将ETDAR算法与另一种泛洪方式的交通信息分发算法——Grassroots算法进行比较。实验结果显示,ETDAR算法的性能在不同的节点密度、网络带宽下均优于Grassroots算法。An efficient algorithm was proposed for disseminating real-time traffic information in vehicular ad-hoc networks （VANET＇s）. In this algorithm, each participating vehicle made local decision on when to disseminate and how many to disseminate by local traffic information. In order to deal with the bandwidth and memory constraints, reports were prioritized in terms of their importance ranks. Finally, the proposed algorithm was compared by simulations with Grassroots, an existing VANET flooding dissemination algorithm. The simulation results show that the algorithm is better than Grassroots.

关 键 词：无线通信 分发算法 车载自组网 实时交通信息 

分 类 号：TP393.04[自动化与计算机技术—计算机应用技术]