博碩士論文 955202040 詳細資訊




以作者查詢圖書館館藏 以作者查詢臺灣博碩士 以作者查詢全國書目 勘誤回報 、線上人數:13 、訪客IP:3.134.78.106
姓名 陳炯宏(Chiung-Hung Chen)  查詢紙本館藏   畢業系所 資訊工程學系
論文名稱 在車用網路環境下分散式計程車呼叫協定
(Distributed Taxi Hailing Protocol in Vehicular Ad-Hoc Networks)
相關論文
★ 基於OP-TEE的可信應用程式軟體生態系統★ 在低軌道衛星無線通訊中的CSI預測方法
★ 為多流量低軌道衛星系統提出的動態換手策略★ 基於Trustzone的智慧型設備語音隱私保護系統
★ 一種減輕LEO衛星網路干擾的方案★ TruzGPS:基於TrustZone的位置隱私權保護系統
★ 衛星地面整合網路之隨機接入前導訊號設計與偵測★ SatPolicy: 基於Trustzone的衛星政策執行系統
★ TruzMalloc: 基於TrustZone 的隱私資料保 護系統★ 衛星地面網路中基於物理層安全的CSI保護方法
★ 低軌道衛星地面整合網路之安全非正交多重存取傳輸★ 低軌道衛星地面網路中的DRX機制設計
★ 衛星地面整合網路之基於集合系統的前導訊號設計★ 基於省電的低軌衛星網路路由演算法
★ 衛星上可重組化計算之安全FPGA動態部分可重組架構★ 衛星網路之基於空間多樣性的前導訊號設計
檔案 [Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   [檢視]  [下載]
  1. 本電子論文使用權限為同意立即開放。
  2. 已達開放權限電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
  3. 請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。

摘要(中) 在現代都市中,計程車帶給乘客便利且快速的交通服務,為了降低乘客等待的時間與計程車空繞的時間,有效率的計程車呼叫協定成為重要的問題。在車用網路的環境下,我們提出分散式計程車呼叫協定。我們考慮計程車的行車方向與交通規則的限制,計算計程車到達乘客位置的行駛距離,作為計程車競爭載客的條件。我們設計利用計程車實際行駛到乘客的路徑作為回覆訊息的路徑,讓行駛路徑短的計程車訊息可以較快到達乘客位置,乘客即可回覆確認訊息給最快到達的計程車,以完成計程車呼叫協定。並且我們將計程車的競爭資訊留在經過的路口,讓其他競爭者可以提前知道競爭的結果,以減少計程車在競爭模式的等待時間,讓競爭失敗的計程車可以繼續尋找其他乘客。在模擬的結果中顯示,我們所提出的分散式計程車呼叫協定比過去的方法有效降低計程車行駛到乘客的距離,如此減少計程車司機油料的浪費與乘客等待時間。同時我們也降低計程車在競爭模式的等待時間,提高計程車載客的機會。
摘要(英) In the modern city, taxis offer the convenient and fast transport services to passengers. In order to reduce the waiting time of passengers and vacant time of taxi, the taxi hailing schemes become an important research issue. In this thesis, we proposed a distributed taxi hailing protocol in vehicular ad-hoc networks. Passengers could use their handheld devices with wireless communications to hail a taxi through the vehicular ad-hoc networks. The taxis that have the shortest moving distance to the passengers will get the chance of the services. Furthermore, we compare the moving distances of different taxis on the way of transmission and a reject message will be sent to the taxi that has the longer moving distance. Therefore, the taxi drivers who have longer moving distance could reduce the waiting time when they get the result of competition early, and then they can search other passengers. The proposed protocol cannot only reduce the vacant time of taxis also reduce the waiting time of passengers. The simulation results show that our scheme could find a vacant taxi which has less moving distance than previous work. Therefore, our scheme can save the fuel cost of taxis and the waiting time of passengers, and we also reduce the waiting time of taxis in contention mode to increase the chance of vacant taxis finding passengers.
關鍵字(中) ★ 分散式計程車呼叫方法
★ 無線通訊
★ 車用網路
關鍵字(英) ★ vehicular ad-hoc networks
★ Distributed taxi hailing schemes
★ wireless communications
論文目次 Chapter 1 Introduction ............ 1
Chapter 2 Related work ............ 5
Chapter 3 Distributed Taxi Hailing Protocol ............9
3.1 The proposed protocol ............11
Chapter 4 Simulation Results ............27
Chapter 5 Conclusions ............34
References ............35
參考文獻 [1] The Premier London Taxi Website, http://www.london-taxi.co.uk/
[2] The Network Simulator ns-2, http://www.isi.edu/nsnam/ns/
[3] Smart Automobile Pte Ltd, http://smartcab.com.sg/index.html
[4] The Vehicular Mobility Simulator, http://vanet.eurecom.fr/
[5] O.Brickley, C.Shen, M. Klepal, A. Tabatabaei, D. Pesch, “A Data Dissemination Strategy for Cooperative Vehicular Systems,” in Proceedings of IEEE Vehicular Technology Conference (VTC), pp. 2501-2505, Apr. 2007.
[6] G.H. Forman and J. Zahorjan, “The Challenges of Mobile Computing,” Computer Magazine, vol. 27, pp. 38-47, Apr. 1994.
[7] B. N. Karp and H. T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networking,” in Proceedings of Mobile Computing and Networking (MOBICOM), pp. 243-254, Aug. 2000.
[8] Z. Liao, “Taxi Dispatching via Global Positioning Systems,” IEEE Engineering Management, vol. 48, pp. 342-347, Aug. 2001.
[9] Z. Liao, “Real-Time Taxi Dispatching Using Global Positioning Systems,” Communications of the ACM, vol. 46, pp. 81-83, May. 2003.
[10] T. Nadeem, P. Shankar, and L. Iftode, “A Comparative Study of Data Dissemination Models for VANETs,” in Proceedings of ACM Mobile and Ubiquitous Systems: Networking & Services (MOBIQUITOUS), pp. 1-10, Jul. 2006.
[11] V. Naumov and T. R. Gross, “Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks,” in Proceedings of IEEE Computer Communications, pp. 1919-1927, May 2007.
[12] P. I. Philippopoulos, G. Soulos, A. Krukowski, N. Argyreas, V. Gorgas, D. Kyriazanos, D. I. Axiotis and S. C. A. Thomopoulos, “ToD: An Intelligent Location-Based Transport Management System,” in Proceedings of Intelligent Vehicles Symposium, pp. 793-798, Jun. 2007.
[13] K. T. Seow, N. H. Dang and D. H. Lee, “Towards An Automated Multiagent Taxi-Dispatch System,” in Proceedings of Automation Science and Engineering (CASE), pp. 1045-1050, Sep. 2007.
[14] S. C. A. Thomopoulos, N. Argyreas, V. Gorgas, D. Kyriazanos, G. Soulos and E. Makri, “ToD Pilot: A Location-based Taxi on Demand System Demonstrator,” in Proceedings of IEEE Personal, Indoor and Mobile Radio Communications (PIMRC), pp. 1-7, Sep. 2007.
[15] O. Tonguz, N. Wisitpongphan, F. Bai, P. Mudalige and V. Sadekar, “Broadcasting in VANET,” in Proceedings of IEEE Mobile Networking for Vehicular Environments, pp. 7-12, May 2007.
[16] M. D. Weiser, “Some Computer Science Issues in Ubiquitous Computing,” Communications of the ACM, vol. 36, pp. 75-84, Jul. 1993.
[17] H. Wu and R. Fujimoto, R. Guensler, and M. Hunter, “MDDV: A Mobility-Centric Data Dissemination Algorithm for Vehicular Networks” in Proceedings of ACM Vehicular ad hoc networks (VANET), pp. 47-56, Oct. 2004
[18] Q. Xu, T. Mak, J. Ko, and R. Sengupta, “Vehicle-to-Vehicle Messaging in DSRC,” in Proceedings of ACM Vehicular ad hoc networks (VANET), pp. 19-28, Oct. 2004
[19] J. Zhao and G.Cao, “VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks,” in Proceedings of IEEE Computer Communications, pp. 1-12, Apr. 2006.
[20] P. Zhou, T. Nadeem, P. Kang, C. Borcea and L. Iftode, “EZCab: A Cab Booking Application Using Short-Range Wireless Communication,” in Proceedings of IEEE Pervasive Computing and Communications (PerCom), pp. 27-38, Mar. 2005.
指導教授 張貴雲、許健平
(Guey-Yun Chang、Jang-Ping Sheu)
審核日期 2008-7-22
推文 facebook   plurk   twitter   funp   google   live   udn   HD   myshare   reddit   netvibes   friend   youpush   delicious   baidu   
網路書籤 Google bookmarks   del.icio.us   hemidemi   myshare   

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明