簡易檢索 / 詳目顯示

研究生: 陳琮貿
論文名稱: 無線隨意網路中分段式行動預測
Segmental Mobility Prediction Algorithm
指導教授: 郭禎祥
Kuo, Chen-Hsiang
王國川
Wang, Kuo-Chang
學位類別: 碩士
Master
系所名稱: 工業教育學系
Department of Industrial Education
論文出版年: 2008
畢業學年度: 96
語文別: 中文
論文頁數: 58
中文關鍵詞: 最短路徑路由協定
英文關鍵詞: Ad hoc, DSR, AODV, Shortest path, Routing Protocol
論文種類: 學術論文
相關次數: 點閱:123下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 傳統的DSR 與AODV 路由協定皆以最短路徑作為找尋目的地的路徑選擇策略,然而最短路徑並不一定是最有效率或最快的路徑。而DOA 則整合了DSR 與AODV 於分段網路拓樸之中。本論文係在隨意式無線網路(Ad Hoc Wireless Network)的環境下,採用DOA 路由協定分段管理的優點,利用GPS 訊號的輔助,計算出任意兩節點之間的可連線時間預測來做為繞送的參數,並利用GPS 的資訊來計算各節點的移動速率進而選出網路中速率低的節點作為中繼點。相對於一般路徑繞送機制而言,本文所提出的分段式行動預測演算法,有效的降低路由的Control overhead,並增加Packet Delivery Ratio,提升了整體路由繞送的穩定度。

    Traditional DSR and AODV routing protocol use the shortest path routing as the police to find the destination of the path chosen strategy. However shortest path routing isn’t the fastest or most efficient path to the destination. DOA is the integration of DSR and AODV in subparagraph network topology. This paper reports that using GPS signals support, calculated between the two nodes can be connected around the time forecast to do so on the Ad Hoc Wireless Network environment. And we compute node’s mobile rate thereby limiting the authority by using GPS information. Compared to ordinary route mechanisms, this paper proposed the mobility prediction algorithm in Ad Hoc Wireless Networks reduce control overhead effectively, increase Packet Delivery Ratio and improve the stability of overall network routing.

    摘要 I Abstract II 誌謝 III 目錄 IV 圖目錄 VI 表目錄 VIII 第一章 緒論 1 1.1 研究背景 1 1.2 研究動機與目的 2 1.3 研究流程 3 1.4 論文架構 4 第二章 文獻探討 5 2.1 無線隨意行動網路簡介 5 2.2 路由演算法的架構 6 2.3 無線隨意網路的路由協定 9 2.4 Table-Driven Routing Protocols 13 2.4.1 Destination Sequence Distance Vector(DSDV) 13 2.4.2 Clustered Gateway Switch Routing(CGSR) 15 2.5 Source-Initiated On-Demand Routing Protocols 16 2.5.1 Dynamic Source Routing(DSR) 16 2.5.1.1Route Discovery of DSR 17 2.5.1.2 Route Maintenance of DSR 18 2.5.2 Ad hoc On Demand Distance Vector Routing(AODV) 19 2.5.3 DSR & AODV 之比較 23 2.5.4 Flow Oriented Routing Protocol 26 第三章 研究方法與系統架構 28 3.1 系統架構 29 3.2 行動及連線時間預測 30 3.3. 路由協定架構 33 3.4. 路由建立過程 35 3.5. 路由維護過程 39 第四章 研究結果 43 4.1.模擬工具介紹 43 4.2.模擬環境 44 4.3.模擬結果 46 4.3.1 Packet Delivery Ratio 46 4.3.2 Control overhead 49 4.3.3 End-to-end Delay 52 第五章 結論與未來展望 55 參考文獻 56

    [1]D. Johnson, D.A. Maltz, and J. Broch, 2002, The Dynamic Source Routing Protocolfor Mobile Ad Hoc Networks , in MANETWorking Group. IETF, Internet Draft.
    [2]C. C. Chiang, “Routing on Clustered Multihop Mobile Wireless Networks with Fading Channel,” Proc. IEEE SICON ’97, pp.197-211, Apr. 1997.
    [3]S. Murthy and J. J. Garcia-Luna-Aceves, “An Efficient Routing Protocol for Wireless Networks,” ACM Mobile Networks and APP. J. Special Issue on Routing in Mobile Communication Networks, pp.183-197, Oct. 1996.
    [4]C. E. Perkins and E. M. Royer, “Ad hoc On-demand Distance Vector Routing,” Mobile Computing Systems and Applications, 1999. Proceedings. WMCSA '99. Second IEEE Workshop on , pp.90-100, Feb.
    1999.
    [5]D. B. Johnson and D. A. Maltz, and J. Broch “Dynamic Source Routing in Ad Hoc Wireless Networks(DSR),” Mobile Ad-hoc Network Working Group, IETF Internet-Draft ,Feb. 2002.
    [6]R. Dube et al., “Signal Stability-Based Adaptive Routing (SSA) for Ad-Hoc Mobile Networks,” IEEE Pers. Commun., pp.36-45, Feb. 1997.
    [7]S. J. Lee and M. Gerla., “AODV-BR: Backup Routing in Ad hoc Networks,” In proceedings of the IEEE Wireless Communications and Networking Conference (WNMC), pp.1311-1316, 2000.
    [8]M. H. Jiang and R. H. Jan, “An efficient multiple paths routing protocol for ad hoc networks,” Information Networking, proceedings 15th International Conference on IEEE, pp.544-549, 2001.
    [9]C. M. Chung, Y. H. Wang and C. C. Chuang, “Ad Hoc On-demand Backup Node Setup Routing Protocol,” Information Networking, 2001. Proceedings. 15th International Conference pp.933 –937, 2001.
    [10]S. J. Lee and M. Gerla, “Split Multipath Routing with Maximally Disjoint Paths in Ad Hoc Networks,” Communications, ICC 2001. IEEE International Conference , Volume: 10 , pp. 3201 –3205, 2001.
    [11]K. Marina and S. R. Das, “On-demand Multipath Distance Vector(AOMDV) Routing in Ad Hoc Networks,” Proceedings of the International Conference for Network Procotols(ICNP), Riverside, Nov. 2001.
    [12] C.E. Perkins and P. Bhagwat, "Highly Dynamic Destination-Sequenced
    Distance-Vector Routing (DSDV) for Mobile Computers", Comp. Comm. Rev., Oct. 1994.
    [13]C.-C. Chiang, "Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel" Proc. IEEE SICON'97, Apr.1997.
    [14]J Gao, LJ Guibas, J Hershberger, L Zhang, A Zhu,” Geometric spanners for routing in mobile networks”, IEEE Journal on, 2005
    [15]D. Estrin, D. Zappala, T. Li, Y. Rekhter and K. Varadhan, “Source Demand Routing:Packet format and forwarding specification (version 1)”, Internet Draft, January 1995.
    [16]William Su; Gerla, M., ”IPv6 flow handoff in ad hoc wireless networks using mobility prediction” ,Global Telecommunications Conference , 1999.GLOBECOM '99 , Volume: 1a , 1999.
    [17]馮筱寧, “Adaptive Cache Timeout Using GPS for Dynamic Source Routing Protocol in Wireless Ad Hoc Network”國立清華大學通訊工程研究所碩士論文, 2001
    [18]蕭義達, “Mobility Prediction Algorithm in Ad Hoc Wireless Networks”元智大學資訊工程學系碩士論文, 2002
    [19]Rendong Bai and Mukesh Singhal, IEEE,” DOA: DSR over AODV Routing for Mobile Ad Hoc Networks”, IEEE Transactions on Mobile Computing, 2006.
    [20]Sung-Ju Lee and Su, W. and Gerla, M.” Ad hoc wireless multicast with mobility prediction” Computer Communications and Networks, 1999
    [21]K. Fall and K. Varadhan, “The ns Manual (formerly ns Note and Documentation)” April, 2002.
    [22] http://www.isi.edu/nsnam/ns/index.html
    [23] ns-2: network simulator. http://www.isi.eduinsnam/ns/

    無法下載圖示 本全文未授權公開
    QR CODE