English  |  正體中文  |  简体中文  |  Items with full text/Total items : 73032/73032 (100%)
Visitors : 23247455      Online Users : 402
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/9595

    Title: 在車用網路環境下分散式計程車呼叫協定;Distributed Taxi Hailing Protocol in Vehicular Ad-Hoc Networks
    Authors: 陳炯宏;Chiung-Hung Chen
    Contributors: 資訊工程研究所
    Keywords: 分散式計程車呼叫方法;無線通訊;車用網路;vehicular ad-hoc networks;Distributed taxi hailing schemes;wireless communications
    Date: 2008-07-23
    Issue Date: 2009-09-22 11:51:20 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 在現代都市中,計程車帶給乘客便利且快速的交通服務,為了降低乘客等待的時間與計程車空繞的時間,有效率的計程車呼叫協定成為重要的問題。在車用網路的環境下,我們提出分散式計程車呼叫協定。我們考慮計程車的行車方向與交通規則的限制,計算計程車到達乘客位置的行駛距離,作為計程車競爭載客的條件。我們設計利用計程車實際行駛到乘客的路徑作為回覆訊息的路徑,讓行駛路徑短的計程車訊息可以較快到達乘客位置,乘客即可回覆確認訊息給最快到達的計程車,以完成計程車呼叫協定。並且我們將計程車的競爭資訊留在經過的路口,讓其他競爭者可以提前知道競爭的結果,以減少計程車在競爭模式的等待時間,讓競爭失敗的計程車可以繼續尋找其他乘客。在模擬的結果中顯示,我們所提出的分散式計程車呼叫協定比過去的方法有效降低計程車行駛到乘客的距離,如此減少計程車司機油料的浪費與乘客等待時間。同時我們也降低計程車在競爭模式的等待時間,提高計程車載客的機會。 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.
    Appears in Collections:[資訊工程研究所] 博碩士論文

    Files in This Item:

    File SizeFormat

    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明