车载自组织网络中基于贪婪算法的地理位置路由

Greedy Algorithm-Based Geographic Position Routing in Vehicular Ad Hoc Networks

车载自组织网络(VANET)技术发展迅速,但由于其特殊的节点类型和信道特性,采用传统AdHoc网络路由协议无法取得满意的性能。实现高速可靠的数据传输速率,需要研究新兴的路由算法。基于贪婪算法的地理位置辅助路由是目前VANET路由的主流思路。文章认为基于这类思路的协议利用车载GPS装置、电子地图和下一代网络导航技术,能使路由发现和建立的时间大大缩短;结合已知的道路拓扑结构,选择多跳传输的最优路径,能避免路边建筑物的屏蔽效应,改善信道条件;动态评估道路上的车流密度,选择可靠性最高的传输路径,能很好地降低传输时延,提高网络吞吐能力。

Vehicular ad hoc networks （VANETs） are developing rapidly. However existing routing protocols in the ad hoc network cannot perform satisfactorily because of the particular node type and channel conditions in VANET. New routing protocols need to be developed for high-speed transmission and reliability. Making full use of geographic position information is the mainstream way of thinking about VANET routing protocols. Protocols based on this kind of thinking take advantage of GPS, electronic map and next generation network （NGN） to shorten the time of routing discovery and establishment. By using the known road topology and choosing the optimal path of the multihop transmission, the screening effect of roadside buildings can be avoided and channel conditions can be improved. Dynamic evaluation of road traffic density can also be used to choose the surest transmission route. This significantly reduces transmission delay and improves network throughput.