English  |  正體中文  |  简体中文  |  Items with full text/Total items : 69937/69937 (100%)
Visitors : 23025550      Online Users : 465
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/9731


    Title: 在車載無線網路中以區域性為基礎的資源分享協定;Local Zone Based Resource Sharing Protocol for Metropolitan Vehicular Ad hoc Networks
    Authors: 吳俊樺;Jyun-Hua Wu
    Contributors: 資訊工程研究所
    Keywords: 車載網路;資源分享;resource sharing;vehicular ad hoc network
    Date: 2009-07-27
    Issue Date: 2009-09-22 11:54:43 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 在無線車載網路中,隨著車與車之間的通訊可行性,舒適的行車服務為我們的生活帶來了很大的便利性,舉凡:停車資訊,交通資訊,廣告資訊,影音檔案 ...等。這些資源被汽車所下載以及可以被分享。在這篇論文中,我們提出一個適用於車載無線網路中的資源分享協定。在我們提出的協定中,為在網路中的車輛建立一套機制來分享服務以及搜尋想要的資源。每一輛汽車根據不同的資源透過計算而得到一個位置,並且將資源資訊儲存在搜尋範圍中,這個搜尋範圍指的是讓車輛在這塊有限區域中分享資源並且確保資源的完整性。其他車輛也可以透過這樣的方式來搜尋資源的位置。模擬的結果顯示我們的方法比起之前的研究擁有較高的成功搜尋機率以及降低了搜尋的延遲時間。最後,我們的方法是具有延展性的,這是因為我們能夠根據地圖的不同大小來調整我們的機制已達到最佳表現效果。 In vehicular ad hoc network (VANET), as the increasing availability of inter-vehicle communication, comfortable driving services give great convenience to our daily life such as traffic information, available parking slots, advertisements, audio and video streaming, etc. Such resources are downloaded by vehicles and sharable. In this thesis, we propose a novel resource sharing protocol for VANET. In our proposed protocol, we establish a mechanism for each vehicle in the network to share and search the resource they need. Each vehicle computes the location and stores the resource into the lookup area, which is the area for each car to share the resources to pressure the completeness of resources, according to their owned resources. Other vehicles also can find the resource by the same way. Simulation results show that our protocols have higher successful search rate and lower search latency comparing to the previous work. Finally, our protocol is well scalability; since we adjust our mechanism according to the different size of map.
    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  - 隱私權政策聲明