用於車用行動通訊網路上之節油導航系統

Fuel-Saving Navigation System in VANETs

郭逸旻(Yi-Min Kuo)

指導教授 ： 陳文村

國立清華大學/電機資訊學院/資訊工程學系/碩士(2010年)

摘要

近年來因為能源的短缺，所以省能的議題也越來越受到重視，由於車輛可以搭載許多無線的設備，可以讓車輛具備溝通和交換訊息的能力，也讓車用網路越來越重要且越來越多應用。導航系統也是在車用網路下一個非常重要的應用，但是傳統的導航系統只會根據電子地圖做一個最短路徑的規劃，所以當這條路徑有塞車的情況發生，可能會讓使用者花更多的時間跟油耗來到達目的地，所以考量實際路況是非常重要的。在這篇論文中，我們提出了一個以節油為基礎的車用導航系統，主要是透過實際路況下去做路徑的規劃，為了評估未來的路況，我們也會記錄這些資料來當作歷史訊息，以便日後參考；在規劃路徑方面，我們也會根據實際路況做動態的規劃路徑，讓使用者能避開壅塞的道路；在模擬結果可以看出，我們的導航系統可以比最短路徑規劃省下20%的耗油量，且也可以在每一百公里中省下40分鐘的時間，並且不會比最短路徑多走了25%的距離。

關鍵字

節油 ； 導航 ； 車用行動通訊網路

並列摘要

Because of shortage of energy, the energy-saving issues become popular in Vehicular Ad-hoc Networks (VANETs). A VANET is formed by traveling vehicles with communicating capability and thus it brings various applications. Navigation system is one of important applications in VANETs. The traditional navigation system usually plans a shortest path for users according to geographic maps but the planned path may become a slower one due to the traffic congestion. A congested path not only delays vehicle traveling time but also wastes fuel. So the real-time traffic information should be considered while constructing a navigation path. In this paper, we propose a navigation system to find a fuel-saving navigation path by considering real-time traffic information. In order to estimate the traffic load on the navigation path, we maintain a table of historical traffic information obtained by Intelligent Transport Systems (ITS). Furthermore, our system can dynamically change the navigation path when traffic information is updated. Our simulation results show that our approach can save more than 20% fuel consumption comparing to shortest-path algorithm when vehicles travel in a traffic congestion environment.

並列關鍵字

fuel-saving ； navigation ； vehicular ad-hoc networks

參考文獻

[5] S. L. Dhingral and I. Gull, “Traffic flow theory historical research

2008, pp. 341 – 350.

computation of delay-sensitive routes from one source to all destinations,”

in Proceedings of the 20th IEEE International Conference on

Computer Communications (INFOCOM ’01), vol. 2, April 2001, pp.