跳到主要內容

臺灣博碩士論文加值系統

(34.236.36.94) 您好!臺灣時間:2021/07/24 21:34
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:蕭勝瑜
研究生(外文):Sheng-Yu Hsiao
論文名稱:無基礎架構無線網路上適應動態拓樸變化之備份繞徑演算法
論文名稱(外文):AODV-ABR:Adaptive Backup Route in Ad-hoc Networks
指導教授:賴威光賴威光引用關係
指導教授(外文):Wei-Kuang Lai
學位類別:碩士
校院名稱:國立中山大學
系所名稱:資訊工程學系研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2004
畢業學年度:92
語文別:中文
論文頁數:52
中文關鍵詞:備份路徑繞徑協定無基礎架構無線網路
外文關鍵詞:Backup RouteRouting AlgorithmAODVAd hoc Wireless Networks
相關次數:
  • 被引用被引用:2
  • 點閱點閱:161
  • 評分評分:
  • 下載下載:20
  • 收藏至我的研究室書目清單書目收藏:0
無基礎架構無線網路 (Ad-hoc Networks)是指由一群可隨意移動之行動站臺所組成,且不需要經由中控臺或是預先設置好的基礎架構(Infrastructure) 即可運作的行動特殊網。在這樣的一個行動特殊網路中,傳輸資料的路徑往往是由多節點(Multi-hop) 共同組成,而繞徑演算法則必須面對站臺能隨意移動的能力以及無線傳輸
上頻寬的限制。目前已有多種針對無基礎架構無線網路所提出來的繞徑演算法。而近年來這方面的研究有朝互動(Reactive) 、隨選式 (On-demand) 繞徑演算法發展的趨勢。AODV (Ad-hoc On-demand Distance Vector routing)即是屬於這種在需要傳送資料到目的端時才會進行路徑搜尋的一種演算法。由於無基礎架構無線網路的拓樸(Topology) 隨時都在改變,目前有一些多路徑 (Multi-path) 或是備份路徑(Backup)的方案被提出來。 Sung-Ju Lee 和 Mario Gerla 提出了一種改善 AODV 的方案: AODV-BR (Backup Route),藉由建置網狀 (Mesh) 的備用路徑來改善繞徑協定的效能。此一演算法在無增加其它控制訊號負載 (Overhead) 的前提下,使用原本 AODV 當中的 RREP 控制訊號來建置網狀的備份多路徑。在 AODV-BR中,仍有一些改善的空間。我們將藉著修改 AODV-BR 方法,提出兩種更能適應網路拓樸變化的繞徑協定: AODV-ABR (Adaptive Backup Route) 和 AODV-ABL (Adaptive Backup Route and Local repair)。 在 AODV-ABR 中,網狀備用路徑除了可以藉由竊聽 RREP 封包來建置外,也可以透過竊聽 Data 封包達成。 而 AODV-ABL 則結合了AODV-ABR 和 Local Repair 的優點。 最後我們用 Simulation 來評估效能上的改善。
An ad-hoc network operates without a central entity or infrastructure, and is composed of highly mobile hosts. In ad-hoc network, routing protocols are with host mobility and bandwidth constraints. There have been many recent proposals of routing protocols for ad-hoc networks. A recent trend in ad hoc network routing is the reactive on-demand philosophy where routes are established only when required. AODV(Ad-hoc On-demand Distance Vector routing) evaluates routes only on an as-needed basis and routes are maintained only as long as they are necessary. Because the network topology changes frequently in ad-hoc networks, some on-demand protocols with multi-paths or backup routes have been proposed. Sung-Ju Lee and Mario Gerla proposed an AODV-BR scheme to improve existing on-demand routing protocols by creating a mesh and providing multiple alternate routes . The algorithm establishes the mesh and multi-path using the RREP (Route Reply) of AODV, which does not transmit any extra control message. In this paper, we propose two schemes : AODV-ABR(Adaptive Backup Route) and AODV-ABL (Adaptive Backup Route and Local repair) to increase the adaptation of routing protocol to topology changes by modifying AODV-BR. In AODV-ABR, the alternative route can be creating by overhearing not only RREP packets but also data packets. AODV-ABL combines the benefits of AODV-ABR and Local Repair. Finally, we evaluate the performance improvement by simulation.
第一章 導論…………………………………………………1
1.1 簡介……………………………………………………1
1.2 研究動機………………………………………………4
第二章 相關研究工作…………………………………………6
2.1 相關研究…………………………………………………6
2.2 AODV繞徑演算法的介紹……………………………………8
2.2.1 演算法概要………………………………………………8
2.2.2 Route Request 程序…………………………………8
2.2.3 Route Reply 程序……………………………………10
2.2.4 路徑維護……………………………………11
2.3 AODV-BR機制介紹…………………………………………12
2.3.1演算法概要……………………………………………12
2.3.2路徑建置…………………………………………………13
2.3.3備份路徑使用及維護……………………………………14
第三章 設計方案 : AODV-ABR……………………………14
3.1 AODV-ABR機制…………………………………………19
3.1.1 提出的基本構想………………………………………19
3.1.2 備份多路徑更新、維護及使用………………………20
3.2 AODV-ABL: Combination of ABR and LR……………24
第四章 模擬與分析…………………………………………25
4.1 模擬參數………………………………………………25
4.2 模擬結果與分析………………………………………27
4.2.1 Packet Delivery Ratio…………………………………27
4.2.2 End-To-End Delay………………………………………30
4.2.3 Hop Counts……………………………………………31
4.2.4 Control Overhead………………………………………31
4.2.5 Traffic Load……………………………………………32
4.2.6 MAX_REPAIR_TTL………………………………………………35
第五章 結論……………………………………………………40
參考文獻…………………………………………………………42
[1] R. Bagrodia, R. Meyer, M. Takai, Y. Chen, X. Zeng, J. Martin and H. Y. Song, “PARSEC: A Parallel Simulation Environment for Complex Systems,” IEEE Computer, vol. 31, no. 10, October 1998, pp.77-85.
[2] S. Corson and J. Macker, “Mobile Ad Hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations,” RFC 2501, Jan. 1999.
[3] Internet Engineering Task Force (IETF) Mobile Ad Hoc Networks (MANET) Working Group Charter, Chaired by Joseph Macker and M. Scott Corson, http://www.ietf.org/html.charters/manet-charter.html.
[4] D. B. Jhonson and D. A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” In Mobile Computing, Kluwere Academic Publishers, 1996, pp.153-181.
[5] J. Jubin and J. D. Tornow “The DARPA Packet Radio Network Protocols, ”Proceedings of the IEEE, vol. 75, no. 1, Jan. 1987, pp. 21-32.
[6] S. Kim, W. Noh, and S. An, “Multi-Path Ad Hoc Routing Considering Path Redundancy,” Computers and Communication(ISCC’ 03), 2003, pp.45-50.
[7] S. J. Lee and M. Gerla, “Split Multi-Path Routing with Maximally Disjoint Paths in Ad Hoc Networks,” Proceedings of IEEE ICC’01, June 2001.
[8] S. J. Lee and M. Gerla, “AODV-BR: Backup Routing in Ad Hoc Networks,” Proceedings of IEEE WCNC 2000, Chicago, IL, Sep. 2000.
[9] M. Marina and S. Das, “On-Demand Multi-Path Distance Vector Routing in Ad Hoc Networks,” Proceedings of IEEE International Conference on Network Protocols (ICNP’01), Nov. 2001.
[10] G. S. Malkin and M. E. Steenstrup, “Distance-Vector Routing,” Routing in Communications Networks, edited by M.E. Steenstrup, Prentice Hall, 1995, pp. 83-98.
[11] J. Moy, “Link-State Routing,” Routing in Communications Networks, edited by M. E. Steenstrup, Prentice Hall, 1995, pp. 135-157.
[12] A. Nasipuri, R. Castaneda, and S. R. Das, “Performance of Multipath Routing for On-Demand Protocols in Mobile Ad Hoc Networks,” ACM/Baltzer Journal of Mobile Networks and Applications (MONET), to appear, 2000.
[13] A. Nasipuri and S. R. Das, “On-Demand Multi-Path Routing for Mobile Ad Hoc Networks,” Proceedings of the 8th Annual IEEE International Conference on Computer Communications and Networks (ICCCN), Boston, MA, October 1999, pp. 64-70.
[14] C. E. Perkins, Royer, and S. Das, “Ad Hoc On-Demand Distance Vector (AODV) Routing,” Internet Draft, draft-ietf-manet-aodv-13.txt, February 2003. (work in progress) .
[15] C. E. Perkins, Ad Hoc Networking, Addison Wesley, 2001.
[16] C. E. Perkins and E. Royer, “Ad Hoc On-Demand Distance Vector Routing,” Proceedings of IEEE WMCSA, Feb. 1999.
[17] C. E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” Proceedings of the ACM SIGCOMM, 1994, pp. 234–244.
[18] Qualnet Simulator : http://www.qualnet.com.
[19] E. M. Royer and C. -K. Toh, “A Review of Current Routing Protocols for Ad-Hoc Mobile Networks,” IEEE Personal Communications, vol. 6, no. 2, April 1999, pp. 46-55.
[20] X. Zeng, R. Bagrodia, and M. Gerla, “GloMoSim: a Library for Parallel Simulation of Large-Scale Wireless Networks,” Proceedings of PADS’98, May 1998.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top