計程車是城市中非常重要的運輸工具之一，根據統計結果，台北市有接近3萬台計程車，其中有近8千家個人車行，而每日的總載客數高達140萬人次，約為捷運系統一日載客數的0.8倍。但在現行的計程車叫車機制底下，會由大車隊壟斷幾乎所有的服務機會，造成載客率嚴重失衡。
在本論文中，我們基於完全由計程車節點構成的車載網路，提出一個改善計程車叫車服務的方案，減少使用者等候時間並讓計程車的載客率較為平衡。透過建構機率路由表來解決在節點快速移動的大規模網路中，路由資訊快速失效的問題，以快速準確地發送使用者的叫車封包。並提出貪婪派遣的機制來媒合載客率較低的車輛，以達到均富的效果。模擬的結果顯示，本系統可以快速的調度車輛抵達使用者叫車的地點，而加入貪婪派遣機制可以大幅改善載客率不平衡的情況。

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.

[1] Acer, U., Kalyanaraman, S., and Abouzeid, A. “Weak State Routing for Large-Scale Dynamic Networks”. In: Networking, IEEE/ACM Transactions on 18.5 (2010), pp. 1450–1463.

[2] Acer, U. G., Kalyanaraman, S., and Abouzeid, A. A. “DTN Routing Using Explicit and Probabilistic Routing Table States”. In: Wirel. Netw. 17.5 (July 2011), pp. 1305–1321.

[3] Basagni, S. et al. “A Distance Routing Effect Algorithm for Mobility (DREAM)”. In: Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking. MobiCom ’98. Dallas, Texas, USA: ACM, 1998, pp. 76–84.

[4] Chandra, R., Ramasubramanian, V., and Birman, K. “Anonymous Gossip: improving multicast reliability in mobile ad-hoc networks”. In: Distributed Computing Systems, 2001. 21st International Conference on. 2001, pp. 275–283.

[5] Han, Q. et al. “Link availability prediction-based reliable routing for mobile ad hoc networks”. English. In: IET Communications 5 (16 2011), 2291–2300(9).

[6] Karp, B. and Kung, H. T. “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks”. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking. MobiCom ’00. Boston, Massachusetts, USA: ACM, 2000, pp. 243–254.

[7] Ko, Y.-B. and Vaidya, N. “Geocasting in mobile ad hoc networks: location-based multicast algorithms”. In: Mobile Computing Systems and Applications, 1999. Proceedings. WMCSA ’99. Second IEEE Workshop on. 1999, pp. 101–110.

[8] Ko, Y.-B. and Vaidya, N. “GeoTORA: a protocol for geocasting in mobile ad hoc networks”. In: Network Protocols, 2000. Proceedings. 2000 International Conference on. 2000, pp. 240–250.

[9] Lee, K. et al. “Enhanced Perimeter Routing for Geographic Forwarding Protocols in Urban Vehicular Scenarios”. In: Globecom Workshops, 2007 IEEE. 2007, pp. 1–10.

[10] Li, J. et al. “A Scalable Location Service for Geographic Ad Hoc Routing”. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking. MobiCom ’00. Boston, Massachusetts, USA: ACM, 2000, pp. 120–130.

[11] Ma, H.-D. “Internet of Things: Objectives and Scientific Challenges”. English. In: Journal of Computer Science and Technology 26.6 (2011), pp. 919–924.

[12] Mauve, M., Widmer, J., and Hartenstein, H. “A survey on position-based routing in mobile ad hoc networks”. In: Network, IEEE 15.6 (2001), pp. 30–39.

[13] Mauve, M. et al. “Position-based Multicast Routing for Mobile Ad-hoc Networks”. In: SIGMOBILE Mob. Comput. Commun. Rev. 7.3 (July 2003), pp. 53–55.

[14] Mohapatra, P., Gui, C., and Li, J. “Group communications in mobile ad hoc networks”. In: Computer 37.2 (2004), pp. 52–59.

[15] Perkins, C. and Royer, E. “Ad-hoc on-demand distance vector routing”. In: Mobile Computing Systems and Applications, 1999. Proceedings. WMCSA ’99. Second IEEE Workshop on. 1999, pp. 90–100.

[16] “Taxi introduction”. In: Taipei City Public Transportation Office (2014).

[17] “The survey of taxi operating in Taipei area”. In: Taipei County Government Technical report (2009).

[18] “Transportation of Taipei MRT stations”. In: Department of transportation, Taipei City Government Yearly report (2012).

[19] Wang, H.-P. and Cui, L. “An enhanced AODV for mobile ad hoc network”. In: Machine Learning and Cybernetics, 2008 International Conference on. Vol. 2. 2008, pp. 1135–1140.

[20] Xue, G. et al. “A novel vehicular location prediction based on mobility patterns for routing in urban VANET”. English. In: EURASIP Journal on Wireless Communications and Networking 2012.1, 222 (2012).

[21] Youn, J.-S. et al. “Quick Local Repair Scheme using Adaptive Promiscuous Mode in Mobile Ad Hoc Networks”. In: Journal of Networks 1.1 (2006).