一种车载自组织网络中交通拥塞自适应的出行计划方案

交通堵塞现象越来越威胁正常的城市交通,针对选择最短路径的出行方案往往不能取得最短的出行时间的现象,提出了一种交通拥塞自适应的出行计划方案.该方案克服了现有方案在规划出行路线时未能考虑行车过程中实际交通状况的缺点,根据车辆在各路段行驶的平均通过时间来判断路段当前的拥塞状况,并动态优化行车路线,从而提高交通效率.仿真实验表明该方案能够自适应路段的交通拥塞,根据当前拥塞状况重新优化行车路线,从而缩短平均行车时间.

Congestion adaptive travel planning for vehicular Ad hoc network

How to plan a trip route is one of the most important issues in vehicular Ad hoc network. This paper presented a congestion adaptive travel planning scheme. The previous schemes often employed the shortest path algorithms to plan their travel, computed a route to the destination by GPS navigation. However, these schemes were not adaptive to the current traffic conditions so that the route couldn't be modified while driving. In fact, the traffic jams occurred frequently in the city, increasingly threatened the city traffic. Consequently, the shortest path calculated by GPS navigation took more time to the destination because of congestion. The proposed scheme could adjust the travel route based on the current traffic conditions, which improved the traffic efficiency. Simulation results show that the scheme performs better and achieves shorter driving time by adjusting the trip route when traffic jams occur.