Responsive image
博碩士論文 etd-0908111-124158 詳細資訊
Title page for etd-0908111-124158
論文名稱
Title
區域路由協定中有效率的關節點偵測方法
An Effective Scheme for Detecting Articulation Points in Zone Routing Protocol
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
69
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2011-09-05
繳交日期
Date of Submission
2011-09-08
關鍵字
Keywords
混合式繞徑協定、閒話式繞徑協定、行動隨意網路、關節點、區域繞徑協定
zone routing protocol, gossiping, Mobile Ad Hoc Network (MANET), hybrid routing protocol, articulation point
統計
Statistics
本論文已被瀏覽 5772 次,被下載 981
The thesis/dissertation has been browsed 5772 times, has been downloaded 981 times.
中文摘要
Zone Routing Protocol (ZRP) 是一種應用在行動隨意網路(Mobile Ad Hoc Network; MANET)中的混合式 (hybrid) 繞徑協定。由於混合式的繞徑協定結合proactive繞徑協定以及reactive繞徑協定的優點,使其較適合使用於動態的環境。Haas等學者在“Gossip-based Ad Hoc Routing”中提及將Gossiping加入ZRP的方法。Gossip-based Zone Routing Protocol (GZRP) 結合Gossip scheme以及ZRP,使節點傳送IERP Route Request封包時,只送至部分邊際節點而不是所有邊際節點。若網路環境中存在關節點 (Articulation Point Node),當封包在關節點上停止轉送,或封包無法傳送至關節點時,GZRP 將無法有良好的效能表現。為了解決這些問題,關節點上的傳送機率必須設為“1”,並且節點也必須將封包送到關節點。如此,方能提升GZRP 的效能。根據上述的概念,如何檢查節點是否為關節點將會是一個重要的議題。本篇論文提出一種有效率的關節點偵測方法,Articulation Point Detection; APD,用來確認節點是否為關節點。這種做法的優點是直接利用ZRP所紀錄的資訊,並且不用建立任何樹狀結構,可以較快速確認是否為關節點。將APD導入GZRP之中,在模擬之下,可以發現,APD-GZRP不僅可以有效的改善Packet Delivery Ratio,並且可以減少Control Overhead以及Power Consumption。
Abstract
Zone Routing Protocol (ZRP) is a typical hybrid routing protocol used in Mobile Ad Hoc Networks (MANETs). Hybrid routing protocols are especially suitable for dynamic environments because they combine the best features of proactive and reactive routing protocols. The Gossip-based Zone Routing Protocol (GZRP) uses a gossip scheme, in which the node forwards a packet to some nodes instead of all nodes to further reduce the control overhead. However, GZRP does not perform well when the network includes articulation points since packets will be lost if an articulation node happens not to forward the packet or nodes happen not to forward packets to the articulation point. To raise the packet delivery ratio, the gossip probability of articulation points must be set to 1 and the packets to be forwarded must be sent to the articulation points in peripheral nodes. Accordingly, how to identify articulation nodes in the network becomes a critical issue. This paper proposes an effective scheme, called articulation point detection (APD), to find the articulation points. Simulation results show that the proposed APD-GZRP (GZRP with articulation point detection) can improve the packet delivery ratio and reduce both the control overhead and power consumption.
目次 Table of Contents
論文審定書 i
誌 謝 ii
摘 要 iii
Abstract iv
目 錄 v
圖 次 viii
表 次 x
字母縮寫對照表 xi
第一章 導論 1
1.1 簡介 1
1.1.1 無線網路的通訊模式 2
1.1.2 IEEE802.11定義的無線網路架構 6
1.2 隨意式無線網路背景與介紹 8
1.2.1 隨意式網路中的路由機制 9
1.3 研究動機 12
1.4 論文架構 13
第二章 背景及相關研究 14
2.1 區域路由協定簡介 14
2.1.1. IARP子協定簡介 15
2.1.2. IERP子協定簡介 16
2.1.3. BRP子協定 17
2.2 閒話式(Gossiping)機制 18
2.2.1 靜態Gossip (Static Gossip) 21
2.2.2 可調式Gossip (Adaptive Gossip) 22
2.3 關節點(Articulation Point) 23
第三章 系統之架構與運作 26
3.1 設計動機及方向 26
3.1.1. IARP所受到關節點之影響 26
3.1.2. IERP所受到關節點之影響 27
3.2 功能及名詞釋義 29
3.3 關節點探測之基礎 31
3.3.1 如何判斷為關節點 31
3.3.2 判斷關節點的條件 32
3.3.3 在ZRP中尋找關節點 34
3.3.4 APD演算法 35
第四章 模擬結果與討論 40
4.1 模擬環境假設 40
4.2 模擬環境參數設定 41
4.3 模擬工具介紹 42
4.4 數據分析與討論 45
4.4.1 Packet Delivery Ratio 45
4.4.2 Normalized Routing Overhead 46
4.4.3 Power Consumption 48
第五章 結論 51
參考文獻 52
參考文獻 References
[1] L. Chen and W. B. Heinzelman, “QoS-aware routing based on bandwidth estimation for mobile ad hoc networks,” IEEE Journal on 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] F. Harary, Graph Theory, 3rd ed. MA: Addison Wesley Longman Publishing Co., 1972.
[4] T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson, Introduction to Algorithms, 2nd ed. McGraw-Hill Higher Education, 2001.
[5] S. A. M. Makki and G. Havas, “Distributed algorithms for depth-first search,” Information Processing Letters, vol. 60, no. 1, pp. 7 – 12, 1996.
[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 Journal Selected Areas in Communications, vol. 17, no. 8, pp. 1415-1425, Aug. 1999.
[9] X. Liu, L. Xiao, A. Kreling, and Y. Liu, “Optimizing overlay topology by reducing cut vertices,” in Proc. International workshop on Network and operating systems support for digital audio and video NOSSDAV ’06. New York, NY: ACM, 2006, pp. 17:1–17:6.
[10] S. Xiong and J. Li, “An efficient algorithm for cut vertex detection in wireless sensor networks,” in Proc. IEEE 30th International Conference on Distributed Computing Systems ICDCS ’10. Washington, DC, USA: IEEE Computer Society, 2010, pp. 368–377.
[11] S. Skiena, Implementing discrete mathematics: combinatorics and graph theory with Mathematica, Boston, MA: Addison-Wesley Longman Publishing Co., Inc., 1991.
[12] The UCB/LBNL/VINT Network Simulator-ns (Version 2). VINT Project.
[13] J. Broch, D. A. Maltz, D. B. Johnson, Y.-C. Hu, and J. G. Jetcheva, “A performance comparison of multi-hop wireless ad hoc network routing protocols,” in Proc. ACM/IEEE international conference on Mobile computing and networking MOBICOM 98’, New York, NY: ACM, 1998, pp. 85–97.
[14] S. Murphy and J. J. Garcia-Luna-Aceves, “An efficient routing protocol for wireless networks,” ACM Mobile Networks Applications Journal, Special Issue on Routing in Mobile Communication Networks, vol. 1, no. 2, pp. 183-197, Oct. 1996.
[15] C. E. Perkins and P. Bhagwat, “Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers,” in Proc. ACM conference on Communications architectures, protocols and applications SIGCOMM 94’, New York, NY: ACM, 1994, pp. 234-244.
[16] V. D. Park and M. S. Corson, “A highly adaptive distributed routing algorithm for mobile wireless networks,” in Proc. Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM 97’, 1997, pp. 1405-1413.
[17] C. E. Perkins and E. M. Royer, “Ad hoc on-demand distance vector (AODV) routing,” IETF Internet draft, Jul. 2003.
[18] C. E. Perkins and E. M. Royer, “RFC3561: Ad hoc on-demand distance vector (AODV) routing,” Internet RFCs, Jul. 2003.
[19] Y.-C. Tseng, S.-Y. Ni, Y.-S. Chen, and J.-P. Sheu, “The broadcast storm problem in a mobile ad hoc network,” Wireless Networks, vol. 8, pp. 153–167, 2002, 10.1023/A:1013763825347.
[20] Z. J. Haas, J. Y. Halpern, and L. Li, “Gossip-based ad hoc routing,” IEEE/ACM Trans. Networking, vol. 14, pp. 479–491, June 2006.
[21] Z. Haas, J. Halpern, and L. Li, “Gossip-based ad hoc routing,” in Proc. Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM 02’, vol. 3, 2002, pp. 1707 – 1716 vol.3.
[22] Z. J. Haas, M. R. Pearlman, and P. Samar, “The zone routing protocol (zrp) for ad hoc networks,” Published Online, IETF MANET Working Group, INTERNET-DRAFT, July 2002, expiration: January, 2003.
[23] Z. J. Haas, M. R. Pearlman, and P. Samar, “The intrazone routing protocol (iarp) for ad hoc networks,” Published Online, IETF MANET Working Group, INTERNET-DRAFT, July 2002, expiration: January 2003.
[24] Z. J. Haas, M. R. Pearlman, and P. Samar, “The interzone routing protocol (ierp) for ad hoc networks,” Published Online, IETF MANET Working Group, INTERNET-DRAFT, July 2002, expiration: January 2003.
[25] Z. J. Haas, M. R. Pearlman, and P. Samar, “The bordercast routing protocol (brp) for ad hoc networks,” Published Online, IETF MANET Working Group, INTERNET-DRAFT, July 2002, expiration: January 2003.
[26] G. Grimmett, Percolation, New York: Springer-Verlag, 1989.
[27] R. Meester and R.Roy, Continuum Percolation, Cambridge, U.K.:Cambridge Univ., 1996.
[28] D. Stauffer and A. Aharony, Introduction to Percolation Theory, London: Taylor & Francis, 1992.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:自定論文開放時間 user define
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available


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

QR Code