%0 Journal Article
%T Congestion adaptive travel planning for vehicular Ad hoc network<br>一种车载自组织网络中交通拥塞自适应的出行计划方案
%A YU Ling-fei
%A SHE Kun
%A SONG Chao
%A LIU Bin
%A <br>余玲飞
%A 佘　堃
%A 宋　超
%A 刘　斌
%J 计算机应用研究
%D 2013
%I 
%X 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.
%K 拥塞自适应
%K 出行计划
%K 车载自组织网络
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=51EFA6F8AD1002431027B0433E63A9E6&yid=FF7AA908D58E97FA&vid=340AC2BF8E7AB4FD&iid=0B39A22176CE99FB&sid=12AD09BCF4A6E651&eid=90075EB19043D533&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=8