English  |  正體中文  |  简体中文  |  Items with full text/Total items : 52047/87178 (60%)
Visitors : 8683507      Online Users : 72
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/52512

    Title: 可應用於車載行動通訊網路之嶄新地理路由策略
    Other Titles: A novel geographic routing strategy over VANET
    Authors: 王彥博;Wang, Yan-bo
    Contributors: 淡江大學電機工程學系碩士班
    Keywords: 車載行動通訊網路;基於地理資訊的路由協定;VANET;Geographic Position-Based Routing Protocol;Greedy Perimeter Stateless Routing;GSPI
    Date: 2010
    Issue Date: 2010-09-23 17:52:16 (UTC+8)
    Abstract: 最近幾年,隨著無線網路技術的進步與普及進而使得車載行動通訊網路(Vehicular Ad Hoc Network, VANET)的相關議題備受關注,許多車載行動通訊網路的相關研究也如雨後春筍般的出現。車載行動通訊網路與一般無線隨意網路之研究最大的差異性在於載體的移動速度,因為載體為車輛等交通工具擁有較高之移動速度。因此在車載行動通訊網路中,有效率的轉送資料將是一個相當大的挑戰,為此有許多研究著重於路由協定之發展。由於諸多路由協定提出的當下,都是假設在一個散佈且理想的環境,因此針對特殊之地理環境,例如城市這類複雜的環境,必定需要做額外的修改,以提升路由協定之效能。
    在傳統的行動隨意網路(Mobile Ad Hoc Network, MANET)中,要傳遞資訊至某目的節點,即有相對應之路由協定(Routing Protocols),如DSDV、AODV、DSR,來輔助移動節點找尋傳遞資訊之路徑。但隨著移動節點之移動速度的提升,如車載行動通訊網路中之車輛,傳統的路由協定則不敷使用。因此,需要後來因應節點移動性(Mobility)之特點,所提出之基於地理資訊的路由協定(Geographic Position-based Routing Protocols)。基於地理資訊的路由協定提出之當下,只是針對節點移動性之特點,利用全球定位系統(Global Positioning System, GPS)獲得地理資訊以輔助協定,僅利用局部網路拓撲資訊,即可做出路由之決策。但對於特殊場景之使用,如城市場景(Urban Scenario),仍有些不足之處。
    因此本篇論文主要的研究目的,在於針對城市之場景設計出相對應之路由協定,使之能有較高的效能與適應性。為此目的,我們提出了Greedy on Straight Roads and Predictive at Intersections (GSPI)路由協定,在筆直的道路使用貪婪模式(Greedy Mode)演算法,在十字路口之區域使用預測模式(Predictive Mode)。在貪婪模式中,我們結合了距離與多重傳輸速度(Multi-rate)等參數所構成之權重數值(Weight, Wi),作為選擇下一台轉傳車輛之依據。在預測模式中,我們預測車輛的動向作為選擇下一台轉傳車輛之考量。根據我們使用網路模擬器(Network Simulator, NS-2)之模擬結果,此方法確實有其可行之處。
    In recent years, thanks to the development and popularization of wireless network technologies, the issue of Vehicular Ad-Hoc Network (VANET) has received great attention, and more and more VANET-related researches have been brought up. Generally speaking, the biggest difference between VANET and traditional Ad Hoc Network is the velocity of carriers because in VANET, the velocity of vehicles the carriers is much higher than those in traditional Ad Hoc. Therefore, it would be a great challenge to forward data efficiently in VANETs and many researches proposed have focused on the development of routing protocols. The current proposed routing protocols are all assumed to simulate in a distributed and ideal environment. As for the complex geographic environments, like urban scenarios, extra amendments must be needed to improve the efficiency of the routing protocols.
    In traditional Mobile Ad Hoc Network (MANET), there are corresponding routing protocols, such as DSDV, AODV, DSR, to assist the mobile node to find the path from source to destination, when the mobile node want to send data to destination. Accompany with the velocity of mobile nodes become higher, such like the vehicles in VANET, the traditional Ad Hoc routing protocols are inadequate. Therefore, the geographic position-based routing protocols are proposed to support the feature of the mobility of nodes. When the geographic position-based routing protocols are proposed, it focuses on solving the problem only that is the feature of the mobility of nodes. It use the Global Positioning System (GPS) to obtain the geographic information, and the information support the routing protocol to make routing decision when the routing protocol only has the local topology information. But it is also inadequately in some scenario, such as urban scenario.
    Thus, the main purpose of this paper is to design a suitable routing protocol for urban scenarios with better performance and adaptability. For this reason, Greedy on Straight Roads and Predictive at the Intersections (GSPI) routing protocol is proposed: to use greedy mode on straight roads, and to use predictive mode at the intersections. In greedy mode, we choose the next hop according to the weight value (Weight, Wi) that combines the distances and multi-rate. In predictive mode, we predict the direction of the vehicles to determine the next hop. The simulation results of Network Simulator (NS-2) reveal that our proposed algorithm indeed proves its feasibility.
    Appears in Collections:[電機工程學系暨研究所] 學位論文

    Files in This Item:

    File SizeFormat

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback