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

Abstract

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.