MANET是由多個動態節點以無線連結的方式所建構出的分散式網路。它的最大特點在於建構過程中不需要其他網路基礎建設而是由節點自身建構而成。因為環境中節點可以自由的移動，網路拓墣會經常的改變，所以提供一個良好的路由協定來因應這變動的網路而有效率的傳輸資料是很重要的一環。從過去所提出的路由協定中，依據路徑更新方式的不同可以分為proactive/table driven協定、reactive/on demand協定及hybrid協定三種類別，每個類別各有其優點及缺點，而hybrid類別的協定嘗試著要結合proactive及reactive的優點，因此提出一個可擷取其中的優點並降低缺點所造成的影響且又可以在網路中有良好的延展性之路由協定，一直是個很重要的研究議題。在此篇文章中，我們提出了一個混合式的路由協定CG2R (Core Gateway Relay Routing Protocol)，在此協定中，我們將網路分成多個區域稱為zone，在zone內使用proactive的方式，zone外則使用reactive的方式，每個zone都存在著一個管理者稱為core gateway，core gateway要負責管理zone內的成員，且可以用來轉傳資料而建立路徑。在常見的以叢集架構為基礎的協定中，其選舉管理者的方式通常會考慮一些因素，例如最小ID，權重值(節點連結度、傳輸半徑、電量、移動性)等等，但是CG2R的協定中，我們不需要這些考慮因素，而是根據我們所提出的演算法選舉出管理者。模擬的結果顯示出我們提出的路由協定可以得到比其他協定較好的效能。

A MANET (Mobile Ad hoc NETwork) is a network with the features of infrastructure-less, multi-hop, self-configuring, and distributed-routing, which are quite different from a traditional wired network. Since nodes in a MANET are free to move, causing the topology of the MANET to change frequently, a routing protocol able to accommodate the rapidly changed topology is required. The MANET routing protocols can be classified into three categories based on routing information update mechanism: (1) proactive/table-driven protocol (2) reactive/on-demand protocol (3) hybrid protocol. Every category has its own advantages and disadvantages. Among these, the hybrid protocol tries to combine the advantages of proactive and reactive ones. This work presents a novel hybrid routing protocol - CG2R (Core Gateway Relay Protocol). The CG2R partitions a network into several regions called zones. The proactive mechanism is used within the zone, while the reactive one is applied outside the zone. Each zone contains one core gateway; the core gateway constitutes the backbone of the routing path. Unlike conventional cluster-based routing protocols which require the algorithm of electing cluster head to get some value such as ID number or Weight to elect cluster heads, the node in CG2R can decide itself a core gateway or not by using the algorithm that we present. The core gateway covers more cells and manages more nodes than the others to reduce the cases of a node moving out the zone. Based on this feature, the backbone of the network can be formed by the gateway nodes. The simulation results reveal that CG2R is more scalable and efficient than CGSR and AODV protocols.

中文摘要 I
英文摘要 II
目錄 IV
圖目錄 VI
表格目錄 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 隨意無線網路架構 13
1.3 研究動機 14
1.4 論文架構 14
第二章背景與相關研究 15
2.1 Cluster-head Gateway Switch Routing Protocol 15
2.2 叢集形成演算法 16
2.2.1 最小ID 叢集形成演算法16
2.2.2 最高連結度叢集形成演算法17
2.2.3 最少叢集變動叢集形成演算法18
2.2.4 權重叢集形成演算法19
2.3 Hybrid Routing in Ad Hoc Network with a Dynamic Virtual Backbone19
2.4 Core Extraction Distributed Ad Hoc Routing Protocol 20
2.5 Ad Hoc On-demand Distance Vector Routing Protocol21
2.6 Zone Routing Protocol22
第三章系統架構與運作 24
3.1 設計方向 24
3.2 功能及名詞釋義 24
3.3 路徑規劃 26
3.3.1 初始階段 26
3.3.2 路徑搜尋階段 27
3.3.3 路徑維護階段 28
3.3.4 選舉core gateway 演算法 31
第四章模擬結果與討論 33
4.1 模擬環境假設 33
4.2 模擬環境參數設定 34
4.3 模擬工具介紹 35
4.4 模擬結果分析與討論 38
第五章結論 41
參考文獻42

[1] C. C. Chiang, H. K. Wu, W. Liu and M. Gerla, “Routing in clustered multihop mobile wireless networks with fading channel,” in Proc. IEEE Singapore International Conference on Networks (SICON) , pp. 197-211, 1997.
[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] M. Chatterjee, S. K. Sas and D. Turgut, “A Weighted Clustering Algorithm (WCA) for Mobile Ad Hoc Networks,” Journal of Cluster Computing, vol.5, no.2, pp.193-204, Apr. 2002.
[4] 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.
[5] 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.
[6] 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.
[7] V. Huang and W. Zhuang, “Optimal resource management in packet-switching TDD CDMA systems,” IEEE Personal Communications, pp. 26-31, Dec. 2000.
[8] M. Gerla and T. C. Tsai, “Multicluster, mobile, multimedia radio network,” ACM-Baltzer Journal of Wireless Networks, vol. 1, no.3, pp.255-265, Oct. 1995.
[9] D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Boston, MA: Kluwer Academic, 1996.
[10] 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.
[11] P. M. Jawandhiya, R. S. Mangrulkar, M. Atique, M.S. Ali, ”A Novel Hybrid Routing Protocol for Mobile Adhoc Network,” International Journal of Advancements in Technology, vol 1, no 2, 2010.
[12] 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, pp. 248-252, Mar. 2005.
[13] 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.
[14] V. D. Park and M. S. Corson, “A highly adaptive distributed routing algorithm for mobile wireless networks,” in Proc. IEEE INFOCOM, pp. 1405-1413, Apr. 1997.
[15] 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.
[16] C. E. Perkins and E. M. Royer, “Ad hoc on-demand distance vector (AODV) routing,” IETF Internet draft, Jul. 2003.
[17] C. E. Perkins and P. Bhagwat, “Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers,” in Proc. ACM SIGCOMM, pp. 234-244, Sep. 1994.
[18] K. RahimiZadeh, “Design of a Cluster-based Routing for Integrated Cellular and Ad Hoc Networks,” in Proc. Communication Networks and Services Research Conference, pp. 422-424, May. 2009.
[19] UCB/LBNL/VINT ns notes and documentation: http://www.isi.edu/nsnam/ns/, Page accessed on Nov. 1, 2007.