Improving Taxi Calling through Probabilistic Routing and Greedy Dispatching in VANET

  • 李 冠賢

Student thesis: Master's Thesis


Taxi is one of the most important transportation in the city As statistics shows there are almost 30000 taxis 8000 personal-operating taxis in Taipei City and their transportation per day could attain 1 4 million which is 0 8 times of the amount of transportation of Taipei MRT per day Nevertheless the utilization of city taxis is significantly imbalance under the present taxi-calling mechanism when company-operating taxis monopolize most of the demands In this thesis based on vehicular ad hoc network completely constructed by taxis we propose a scheme to improve taxi-calling service which could reduce the waiting time and balance the rate of transportation We construct probabilistic routing table entries to solve the problem that routing information frequently gets ineffective within large scale network where nodes move fast and to send taxi-calling packet fast and accurately Also we provide the greedy dispatching mechanism to improve the imbalance of usage The result of the thesis shows that the system could dispatch taxis faster to approach the taxi-calling location and applying greedy dispatching mechanism could significantly improve the imbalance of usage
Date of Award2014 Dec 2
Original languageEnglish
SupervisorMeng-Hsun Tsai (Supervisor)

Cite this