Responsive image
博碩士論文 etd-0201110-175949 詳細資訊
Title page for etd-0201110-175949
論文名稱
Title
隨意無線網路中提供備用路徑機制的AODV路由協定
AODV-Based Backup Routing Scheme in Mobile Ad Hoc Networks
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
65
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2010-01-26
繳交日期
Date of Submission
2010-02-01
關鍵字
Keywords
隨意網路、路由協定、備用路徑
ad hoc, routing protocol, backup paths
統計
Statistics
本論文已被瀏覽 5711 次,被下載 9
The thesis/dissertation has been browsed 5711 times, has been downloaded 9 times.
中文摘要
在隨意式無線網路中,具有良好效率的路由協定一直是重要的研究議題。Ad-hoc On-demand Distance Vector routing (AODV)路由協定近年來已經被廣泛的研究,由於AODV 是單一路徑的路由協定,當路徑上有連結斷裂時就必須要重新建立新的傳輸路徑,而頻繁的重新建立路徑將會增加網路負載與傳遞時間的延遲。在本文中,我們針對AODV 路由協定加以修改,使其具有備用路徑路由機制,藉由建立在2-hop 鄰近資訊的備用路徑,不需經過重新建立路徑的步驟,便可以修復被損壞的路徑,這些備用路徑因為鄰近主要路徑可以提供有效率的路徑恢復機制並維護適當的路徑長度。模擬分析的結果顯示,修改後的AODV 比起Ad hoc On-demand Multipath Distance Vector(AOMDV)以及原始的AODV有更低的average end-to-end delay 以及較少的網路負載。
Abstract
As effective routing is critical in mobile ad hoc networks (MANETs), the Ad Hoc On-demand Distance Vector (AODV) has been extensively studied in recent years. AODV is a single path routing protocol that requires a new route discovery procedure whenever a link breaks, such frequent route discoveries incur a high routing overhead and increase end-to-end delay. Therefore, by modifying the AODV protocol, this work presents a novel backup routing scheme capable of repairing disrupted links locally without activating a route re-discovery procedure. Additionally, backup paths are established based on 2-hop neighbor knowledge. These backup paths are geographically close to the primary path in order to provide efficient recovery from route failure and maintain an adequate routing length. Simulation results indicate that the proposed backup routing scheme obtains a lower average end-to-end delay and less routing overhead than those of the Ad hoc On-demand Multipath Distance Vector (AOMDV) and the conventional AODV.
目次 Table of Contents
中文摘要..................................................................................I
英文摘要................................................................................. II
目錄........................................................................................ III
圖目錄.....................................................................................V
表格目錄.................................................................................VII
字母縮寫對照表......................................................................VIII
第一章 導論 ........................................................................... 01
1.1 簡介 ..................................................................................01
1.1.1 無線網路的兩種通訊模式............................................. 03
1.1.2 EEE802.11 定義的兩種無線網路架構..........................06
1.2 研究方向的相關背景....................................................... 08
1.2.1 隨意式無線網路中的三種路由協定機制...................... 10
1.2.2 AODV 的路由特........................................................... 13
1.3 研究動機.......................................................................... 14
1.4 論文架構......................................................................... 14
第二章 背景與相關研究......................................................... 15
2.1 AODV 簡介..................................................................... 15
2.2.1 Route Request 程序.................................................... 15
2.2.2 Route Reply 程序........................................................ 18
2.2.3 Route Maintenance 程序............................................. 19
2.2 備用路徑的相關研究....................................................... 21
第三章 系統之架構與運作.................................................... 23
3.1 設計方向.......................................................................... 23
3.2 功能及名詞釋義............................................................... 23
3.3 備用路徑機制................................................................... 25
3.3.1 鄰居節點的管理............................................................ 25
3.3.2 備用路徑的建置............................................................ 26
3.3.3 路徑維護....................................................................... 32
3.3.4 備用路徑機制的舉例.................................................... 34
第四章 模擬結果與討論........................................................ 38
4.1 模擬環境假設.................................................................. 38
4.2 模擬環境參數設定.......................................................... 39
4.3 模擬工具介紹................................................................. 40
4.4 模擬結果分析與討論...................................................... 43
第五章 結論 ......................................................................... 49
參考文獻............................................................................... 50
參考文獻 References
[1]L. Chen and W. B. Heinzelman, “QoS-aware routing based on bandwidth estimation for mobile ad hoc networks,” IEEE J. Selected Areas in Communication, vol. 23, no. 3, pp. 561-572, Mar. 2005.
[2]S. Choi and K. G. Shin, “A unified wireless LAN architecture for real-time and non-real-time communication services,” IEEE/ACM Trans. Networking, vol. 8, no. 1, pp. 44-59, Feb. 2000.
[3]D. Ganesan, R. Govindan, S. Shenker, and D. Estrin, “Highly-resilient, energy-efficient multipath routing in wireless sensor networks,” ACM SIGMOBILE Mobile Computing and Communications Review, vol. 5, no. 4, pp. 11-25, Oct. 2001.
[4]M. Hamdaoui and P. Ramanathan, “Deferring real-time traffic for improved non-real-time communication in FDDI networks,” IEEE Trans. Computers, vol. 44, pp. 1420-1428, Dec. 1995.
[5]V. Huang and W. Zhuang, “Optimal resource management in packet-switching TDD CDMA systems,” IEEE Personal Communications, pp. 26-31, Dec. 2000.
[6]D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Boston, MA: Kluwer Academic, 1996.
[7]D. Johnson, D. Maltz, and Y. C. Hu, “The dynamic source routing for mobile ad hoc networks,” IETF Internet Draft, Jul. 2004.
[8]M. Joa and I. T. Lu, “A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks,” IEEE J. Selected Areas in Communications, vol. 17, no. 8, pp. 1415-1425, Aug. 1999.
[9]S. J. Lee and M. Gerla, “Aodv-br: backup routing in ad hoc networks,” in Proc. IEEE Wireless Communication and Networking Conference (WCNC), Sep. 2000, pp. 1311-1316.
[10]J. Li, J. Jannotti, D. De Couto, D. R. Karger, and R. Morris, “A scalable location service for geographic ad hoc routing,” in Proc. ACM Mobile Computing and Networking, Aug. 2000, pp. 120-130.
[11]H. Liu and D. Raychaudhuri, “Label switched multi-path forwarding in wireless ad-hoc networks,” in Proc. IEEE International Conference on Pervasive Computing and Communications Workshops, Mar. 2005, pp. 248-252.
[12]M. K. Marina and S. R. Das, “On-demand multipath distance vector routing in ad hoc networks,” in Proc. International Conference for Network Protocols (ICNP), Nov. 2001, pp. 14-23.
[13]S. Motegi and H. Horiuchi, “AODV-based multipath routing protocol for mobile ad hoc networks,” IEICE Trans. Communications, vol. E87, no. 9, pp. 2477-2483, Sep. 2004.
[14]S. Murphy and J. J. Garcia-Luna-Aceves, “An efficient routing protocol for wireless networks,” ACM Mobile Networks Applications J., Special Issue on Routing in Mobile Communication Networks, vol. 1, no. 2, pp. 183-197, Oct. 1996.
[15]A. Nasipuri, R. Castaneda, and S. Das, “Performance of Multipath Routing for On-Demand Protocols in Mobile Ad Hoc Networks,” ACM/Kluwer Mobile Networks and Applications (MONET) J., vol. 6, no. 4, pp. 339-349, Aug. 2001.
[16]V. D. Park and M. S. Corson, “A highly adaptive distributed routing algorithm for mobile wireless networks,” in Proc. IEEE INFOCOM, Apr. 1997, pp. 1405-1413.
[17]M. R. Pearlman and Z. J. Haas, "Determining the optimal configuration for the zone routing protocol,” IEEE J. Selected Areas in Communications, vol. 17, no. 8, pp. 1395-1414, Aug. 1999.
[18]C. E. Perkins and E. M. Royer, “Ad hoc on-demand distance vector (AODV) routing,” IETF Internet draft, Jul. 2003.
[19]C. E. Perkins and E. M. Royer, “RFC3561: Ad hoc on-demand distance vector (AODV) routing,” Internet RFCs, Jul. 2003.
[20]C. E. Perkins, S. R. Das, and E. M. Royer, “Performance comparison of two on-demand routing protocols for ad hoc networks,” in Proc. IEEE INFOCOM, Mar. 2000, pp. 3-12.
[21]C. E. Perkins and P. Bhagwat, “Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers,” in Proc. ACM SIGCOMM, Sep. 1994, pp. 234-244.
[22]A. A. Pirzada, C. McDonald, and A. Datta, “Performance comparison of trusted-based reactive routing protocols,” IEEE Trans. Mobile Computing, vol. 5, pp. 695-710, Jun. 2006.
[23]E. M. Royer and C. K. Toh, “A review of current routing protocols for ad hoc mobile wireless networks,” IEEE Personal Communication Magazine, vol. 6, pp. 46-55, Apr. 1999.
[24]Z. Ye, S. V. Krishnamurthy, and S. K. Tripathi, “A framework for reliable routing in mobile ad hoc networks,” in Proc. IEEE INFOCOM, Mar. 2003, pp. 270-280.
[25]The UCB/LBNL/VINT Network Simulator-ns (Version 2). VINT Project. [Online]. Available:http://www.isi.edu/nsnam/ns
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內一年後公開,校外永不公開 campus withheld
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus:永不公開 not available

您的 IP(校外) 位址是 18.216.32.116
論文開放下載的時間是 校外不公開

Your IP address is 18.216.32.116
This thesis will be available to you on Indicate off-campus access is not available.

紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code