Zone Routing Protocol(ZRP)是一種應用在行動隨意網路(Mobile Ad Hoc Network; MANET)中的混合式(hybrid)路由協定。由於混合式路由協定結合了主動式(proactive)路由協定以及反應式(reactive)路由協定的優點，使其被廣泛的使用在動態的網路環境中。為了減少廣播所產生的控制封包，Haas等學者將閒話式(Gossip)機制導入ZRP中，稱為Gossip-based Zone Routing Protocol(GZRP) ，但GZRP的效能會受到關節點(Articulation Point)存在與否的影響。在[18]一文中，提出一種偵測ZRP中的節點是否為關節點的啟發式(Heuristic)方法，APD。本篇論文將分析此APD方法，就其特性與無法正確判斷出關節點的情況，在不同網路節點密度下加以探討，並以模擬實驗之結果來佐證。

Zone Routing Protocol (ZRP) is a typical hybrid routing protocol used in Mobile Ad Hoc Networks (MANETs). Due to combing the advantages of proactive and reactive routing protocol, ZRP has been extensively applied on the dynamic network environments. To reduce the broadcasting control overhead, Haas et al. incorporated gossiping into ZRP called GZRP. However, when there exist articulation points in the local zone, the performance of GZRP will be degraded. Therefore, a heuristic articulation point detection algorithm(APD) has been proposed by Cheng[18] to prevent the degradation. In this paper, we will analyze the APD algorithm, discuss the situations that the articulation points can not be detected, with respect to different network nodes density, and verify the results by simulation.

論文審定書 i
摘 要 ii
Abstract iii
目 錄 iv
圖 次 vii
字母縮寫對照表 xi
第一章 導論 1
1.1 IEEE 802.11網路架構 1
1.2 無線網路通訊模式 3
1.3 無線隨意網路路由協定 5
1.3.1 主動式路由協定 5
1.3.2 反應式路由協定 7
1.3.3 混合式路由協定 8
1.4 研究動機 8
1.5 論文架構 9
第二章 背景及相關研究 10
2.1 區域路由協定簡介 10
2.1.1 IARP子協定簡介 11
2.1.2 IERP子協定簡介 12
2.1.3 BRP子協定 13
2.2 閒話式(Gossip)機制 15
2.3 關節點(Articulation Point) 19
第三章 系統之架構與運作 21
3.1 研究方向 21
3.1.1 關節點對IARP之影響 21
3.1.2 關節點對IERP之影響 22
3.2 關節點探測 24
3.2.1 如何判斷為關節點 24
3.2.2 在ZRP中尋找關節點 25
3.3 APD演算法 27
3.3.1 無法偵測出關節點之情形 29
3.3.2 時間複雜度分析 31
第四章 模擬結果與討論 35
4.1 模擬環境之假設 35
4.2 模擬工具介紹 35
4.3 模擬環境之參數設定 38
4.4 數據分析與討論 39
4.4.1 ZRP 控制負擔 39
4.4.2 關節點存在的比例 41
4.4.3 APD與DFS找到關節點的比較 42
4.4.4 封包到達率 44
4.4.5 路由負擔 45
4.4.6 電量消耗 46
第五章 結論 48
參考文獻 49

[1] 曾煜棋、林政寬、林致宇、潘孟鉉，「無線網路：通訊協定、感測網路、射頻技術與應用服務」，碁峰出版社，2011。
[2] 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 Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking, pp. 85–97, Dallas, Texas, USA, October 1998.
[3] 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, March 2005.
[4] R. Chandra, V. Ramasubramanian, and K. P. Birman, “Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks,” in Proceedings of 21st IEEE International Conference on Distributed Computing Systems, pp. 275–283, Phoenix, Arizona, USA, April 2001.
[5] S. Choi and K. G. Shin, “A unified wireless LAN architecture for real-time and non-real-time communication services,” IEEE/ACM Transactions on Networking, vol. 8, no. 1, pp. 44–59, February 2000.
[6] E. T. Clausen and E. P. Jacquet, “Optimized Link State Routing Protocol (OLSR),” IETF Internet Draft, October 2003.
[7] T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson, Introduction to Algorithms, 2nd ed. New York, NY: McGraw-Hill Higher Education, 2001.
[8] G. Grimmett, Percolation, New York, NY: Springer-Verlag, 1989.
[9] J. Gross, J. Yellen, Handbook of Graph Theory, Boca Raton, FL: CRC Press, 2003.
[10] F. Harary, Graph Theory, 3rd ed. Boston, MA: Addison Wesley Longman Publishing Co., 1972.
[11] Z. J. Haas, J. Y. Halpern, and L. Li, “Gossip-based ad hoc routing,” IEEE/ACM Transactions on Networking, vol. 14, no. 3, pp. 479–491, June 2006.
[12] Z. J. Haas, J. Halpern, and L. Li, “Gossip-based ad hoc routing,” in Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM ’02), vol. 3, pp. 1707–1716, New York, NY, USA, June 2002.
[13] Z. J. Haas, M. R. Pearlman, and P. Samar, “The Zone Routing Protocol (ZRP) for Ad Hoc Networks,” IETF Internet Draft, July 2002.
[14] Z. J. Haas, M. R. Pearlman, and P. Samar, “The intrazone routing protocol (IARP) for ad hoc networks,” IETF Internet Draft, July 2002.
[15] Z. J. Haas, M. R. Pearlman, and P. Samar, “The interzone routing protocol (IERP) for ad hoc networks,” IETF Internet Draft, July 2002.
[16] Z. J. Haas, M. R. Pearlman, and P. Samar, “The bordercast routing protocol (BRP) for ad hoc networks,” IETF Internet Draft, July 2002.
[17] Z. J. Haas, M. R. Pearlman, “The Performance of Query Control Schemes for the Zone Routing Protocol,” IEEE/ACM Transactions on Networking, vol. 9, no. 4, pp.427-438, August 2001.
[18] T. C. Huang, W.C. Cheng and L. Tang, “An Effective Scheme for Detecting Articulation Points in Zone Routing Protocol” in Proceedings of the 6th International ICST Conference on Wireless Internet (WICON ’11), pp. 521–533, Xian, Shaanxi, China, October 2012.
[19] 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, August 1999.
[20] D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, pp. 153-181, Boston, MA: Kluwer Academic Publishers, 1996.
[21] D. Johnson, D. Maltz, and Y. C. Hu, “The dynamic source routing for mobile ad hoc networks,” IETF Internet Draft, July 2004.
[22] P. Kyasanur, R. R. Choudhury, and I. Gupta, “Smart gossip: An adaptive gossip-based broadcasting service for sensor networks, ” in Proceedings of International Conference on Mobile Ad hoc and Sensor System, pp.91–100, Vancouver, BC, Canada, October 2006.
[23] X. Liu, L. Xiao, A. Kreling, and Y. Liu, “Optimizing overlay topology by reducing cut vertices,” in Proceedings of International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV ’06), pp. 17:1–17:6, Newport, Rhode Island, USA, May 2006.
[24] S. A. M. Makki and G. Havas, “Distributed algorithms for depth-first search,” Information Processing Letters, vol. 60, no. 1, pp. 7–12, 1996.
[25] R. Meester and R.Roy, Continuum Percolation, Cambridge, U.K.:Cambridge University Press, 1996.
[26] M. Miller, C. Sengul, and I. Gupta, “Exploring the energy-latency tradeoff for broadcasts in energy-saving sensor networks,” in Proceedings of International Conference on Distributed Computing Systems (ICDCS ’05), pp. 17–26, Columbus, Ohio, USA, July 2005.
[27] 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, October 1996.
[28] V. D. Park and M. S. Corson, “A highly adaptive distributed routing algorithm for mobile wireless networks,” in Proceedings of the 16st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM ’97), pp. 1405–1413, Washington, DC, USA, April 1997.
[29] C. E. Perkins and P. Bhagwat, “Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers,” in Proceedings of ACM conference on Communications Architectures, Protocols and Applications (SIGCOMM ’94), pp. 234–244, New York, NY, USA, 1994.
[30] C. E. Perkins, E. M. Royer and S. Das, “RFC3561: Ad hoc on-demand distance vector (AODV) routing,” Internet RFCs, July 2003.
[31] D. Stauffer and A. Aharony, Introduction to Percolation Theory, London: Taylor & Francis, 1992.
[32] 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, no. 2-3, pp. 153–167, 2002.
[33] S. Xiong and J. Li, “An efficient algorithm for cut vertex detection in wireless sensor networks,” in Proceedings of the IEEE 30th International Conference on Distributed Computing Systems (ICDCS ’10), pp. 368–377, Genoa, Italy, June 2010.
[34] VINT Project. The UCB/LBNL/VINT network simulator-ns (Version 2). http://www.isi.edu/nsnam/ns/.