在行動隨意網路(Mobile Ad Hoc Networks, MANETs)中，區域路由協定(Zone Routing Protocol, ZRP)是一個混合式的路由協定。每個節點都必須主動維護和探索自己特定區域(zone)內的網路拓樸資訊，若發現目的端在區域範圍外則利用反應式(reactive)路由協定來找尋路徑。當區域半徑大於2個跳躍(hop)單位，節點會利用區域路由協定的子協定區域內路由協定(Intrazone Routing Protocol, IARP)，監控自己區域內的網路拓樸資訊，造成節點可能會從不同的中繼節點收到來自相同上游節點的鏈結更新封包(link state update packet)。為了減輕上述問題並減少廣播相同更新封包的中繼節點個數，我們將本文的機率機制與區域內路由協定做結合。當節點需要廣播上游節點的更新封包時，節點利用鄰居節點的個數和預測鄰居的廣播機率來計算自己的廣播機率。根據模擬實驗的結果顯示，本文所提出的機率演算法可以減少我們預期的控制封包數量。

In a mobile ad hoc network (MANET), Zone Routing Protocol (ZRP) is a hybrid routing protocol in which every node needs to proactively maintain and discover routes in its limited zone and reactively search the routes to the destination out of the zone. While monitoring the network topology of routing zone, a node may receive duplicate link state update packets coming from different intermediate nodes when the zone radius is greater than 2 hops. In order to reduce packet rebroadcasting, we combine adaptive probabilistic scheme with intrazone routing protocol (IARP). The node rebroadcasts packet with a suitable probability based on the number of neighbors and the predicted rebroadcast probability of neighbors. Simulation results show that the proposed algorithm can reduce the expected control traffic.

摘 要 ii
Abstract iii
目 錄 iv
圖 次 ii
表 次 iv
字母縮寫對照表 v
第一章 導論 1
1.1 簡介 1
1.2 隨意式無線網路背景與介紹 8
1.2.1 主動式路由協定（Proactive Routing Protocol） 9
1.2.2 反應式路由協定（Reactive Routing Protocol） 11
1.2.3 混合式路由協定（Hybrid Routing Protocol） 12
1.3 研究動機 12
1.4 論文架構 15
第二章 背景及相關研究 16
2.1 區域路由協定(Zone Routing Protocol)簡介 16
2.1.1 區域內路由子協定(Intrazone Routing Protocol)簡介 17
2.1.2 區域外路由子協定(Interzone Routing Protocol)簡介 18
2.1.3解決邊際傳播子協定(Bordercast Resolution Protocol)簡介 19
2.2 廣播風暴的介紹和相關減輕方法 20
第三章 系統之架構與運作 25
3.1 研究方向 25
3.1.1 決定節點的傳輸機率的條件 25
3.1.2 節點發送封包的機率值與條件之間的關係 27
3.2 機率機制之運作 28
第四章 模擬實驗與數據分析 35
4.1 模擬環境參數設定 35
4.2 數據分析與討論 36
4. 2.1 減少的控制封包數量 37
4. 2.2 減少的封包碰撞數量 39
4. 2.3 路由表的平均正確率 40
4. 2.4 延長LSUP廣播週期所造成的影響 42
第五章 結論 45
參考文獻 47

[1] 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 MOBICOM, 1998, pp. 85–97.
[2] 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.
[3] 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.
[4] G. Grimmett, Percolation. New York: Springer-Verlag, 1989.
[5] F. Harary, Graph Theory, 3rd ed. Reading, MA: Addison-Wesley, 1972.
[6] 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.
[7] T. Issariyakul and E. Hossain, Introduction to Network Simulator NS2, Springer Publishing Company, Oct. 2008.
[8] Z. J. Haas, J. Y. Halpern, and L. Li, “Gossip-based ad hoc routing,” IEEE/ACM Trans. Netw., vol. 14, pp. 479–491, June 2006.
[9] Z. Haas, J. Halpern, and L. Li, “Gossip-based ad hoc routing,” in INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, vol. 3, 2002.
[10] 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.
[11] Z.J. Hass, M.R. Pearlman, “The performance of query control schemes for the zone routing protocol, “ IEEE/ACM Transactions on Networking vol.9, pp. 427–438, 2001.
[12] 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.
[13] 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.
[14] 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.
[15] D. B. Johnson and D. A. Maltz, “Dynamic source routing in ad hoc wireless networks,” Boston, MA: Kluwer Academic, 1996.
[16] D. Johnson, D. Maltz, and Y. C. Hu, “The dynamic source routing for mobile ad hoc networks,” IETF Internet Draft, Jul. 2004.
[17] The UCB/LBNL/VINT Network Simulator-ns (Version 2). VINT Project.
[18] R. Meester and R.Roy, Continuum Percolation. Cambridge, U.K.:Cambridge Univ., 1996.
[19] 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.
[20] 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.
[21] 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.
[22] C. E. Perkins and E. M. Royer, “Ad hoc on-demand distance vector (AODV) routing,” IETF Internet draft, Jul. 2003.
[23] C. E. Perkins and E. M. Royer, “RFC3561: Ad hoc on-demand distance vector (AODV) routing,” Internet RFCs, Jul. 2003.
[24] W. Peng and X. Lu, “On the reduction of broadcast redundancy in mobile ad hoc networks,” in Proceedings of the 1st ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC ’00), 2000.
[25] D. Stauffer and A. Aharony, Introduction to Percolation Theory, London: Taylor & Francis, 1992.
[26] 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.