Implement N-Distance-Greedy w/ M-Direction-Greedy Forwarding in Vehicular Ad Hoc Network

近年來，車載網路變得越來越被重視，很多相關的想法也都相繼的被提出來。但是車載網路有著很大的缺陷，就是車子的移動性很大，導致傳輸訊息上的不穩定。而現在越來越多車輛會裝設導航系統，如果我們可以得到導航系統的資料並將得到的資訊做分析，而分析結果運用在，例如：如何選擇傳遞封包的理想路徑，或是當某條道路的交通量超過負荷時，通知鄰近車輛改道等…。因此本文提出了一個利用分析導航系統的資料，選擇理想的傳遞封包候選人，以減少車載網路傳送訊息的成本和增加傳輸的成功率。

Recently, Vehicular Ad Hoc Network (in short VANET) has gotten more and more attentions, and many related works have been proposed one after another. But there is a significant defect of VANET, which is the mobility of the car, and it causes the instability of signal transmission between vehicles. Nowadays, more and more cars are equipped with GPS. If we could get information from GPS and analyze the information, utilizing analyzed information on such as how to choose an ideal path to transmit the data or to inform neighboring cars to change their path when the road is overloaded. Accordingly, my essay proposes a method, based on GPS information, to select an ideal candidate car to transmit the data in an effort to reduce the cost of VANET and to improve the transmission rate.