本文以k-hop叢集架構為基礎，在行動隨意網路中提出一個混合式的路由協定。若來源節點可在neighbor table中查到目的節點，就直接將封包透過neighbor table的資訊傳送給目的節點，否則就發送route request packet (RREQ) 來啟動路徑搜尋程序。RREQ到達目的節點後，我們將route reply packet (RREP) 經由曾經轉送RREQ的叢集重新找尋由目的節點到來源節點的路徑，而非採用RREQ送達目的節點的路徑。如此，可以避免叢集管理節點(cluster head)必定包含在路徑當中的缺點，像是因為叢集管理節點超載導致傳輸路徑的失效。本篇提出的方法與Cluster Based Routing Protocol (CBRP) 比較起來，本篇提出的方法可以將叢集管理節點的負擔分配到成員節點上。透過實驗的模擬與分析，我們得到的結果說明了本篇提出的方法的封包抵達率與平均延遲時間皆優於CBRP。

This paper proposes a hybrid routing protocol based on the k-hop clustering structure for MANETs. The source sends packets to the destination directly if it is in the source’s neighbor table; otherwise the source reactively sends the route request packet (RREQ) to trigger the routing process. Instead of adopting the nodes that forwards the RREQ as the route between the source and destination, the route reply packet (RREP) is broadcasted via the nodes in the clusters that the RREQ has ever passed to find the route. The route constructed in this way can avoid the clusterheads always being in the transmission route and collapsing due to overloading. In comparison with the Cluster Based Routing Protocol (CBRP), the proposed protocol can distribute the communication workload from the clusterheads to member nodes. Simulation results demonstrate that the proposed protocol has better packet delivery ratio and end-to-end delay time than that of CBRP.

目 錄
中文摘要 I
Abstract II
目 錄 III
圖目錄 V
表目錄 VII
字母縮寫對照表 VIII
第一章 導論 1
1.1　簡介 1
1.1.1　無線網路的兩種通訊型式 3
1.1.2　IEEE 802.11定義的兩種無線網路架構 6
1.1.3　行動隨意無線網路 8
1.1.4　隨意無線網路中的路由協定 10
1.1.5　隨意無線網路架構 13
1.2　研究方向的相關背景 13
1.3 研究動機 14
1.4 論文架構 14
第二章 背景及相關研究 15
2.1 k-hop的叢集形成架構 15
2.2 叢集形成演算法 16
2.2.1　最小ID叢集形成演算法 17
2.2.2　最高連結度叢集形成演算法 17
2.2.3　最少叢集變動叢集形成演算法 19
2.2.4　權重叢集法 19
2.3　Cluster-head Gateway Switch Routing Protocol (CGSR) 20
2.4　Cluster-based Routing Protocol (CBRP) 21
第三章 系統架構與運作 23
3.1 設計方向 23
3.2 功能及名詞釋義 23
3.3 叢集化架構的混合式路由協定 24
3.4路徑規劃 27
3.4.1　路徑搜尋階段 27
3.4.2 路徑維護階段 32
第四章 模擬結果與討論 35
4.1 模擬環境假設 35
4.2 模擬環境參數設定 36
4.3 模擬工具介紹 37
4.4 模擬結果分析與討論 40
4.4.1 資料流量對架構效能的影響 40
4.4.2 網路變動對架構效能的影響 43
第五章 結論 46
參考文獻 48

[1] P. Bellavista and E. Magistretti, “k-hop Backbone Formation in Ad Hoc Networks,” in Proc. International Conference on Computer Communication and Networks (ICCCN2007), Aug. 2007, Hawaii, USA, pp. 479-484
[2] M. Chatterjee, S. K. Sas, and D. Turgut, “A Weighted Clustering Algorithm (WCA) for Mobile Ad Hoc Networks,” Journal of Cluster Computing, Springer Netherlands publishers, vol. 5, no. 2, Apr. 2002, Netherlands, pp. 193-204.
[3] 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), 1997, pp. 197-211.
[4] M. Gerla and T. C. Tsai, “Multicluster, mobile, multimedia radio network,” ACM-Baltzer Journal of Wireless Networks, vol. 1, no.3, Oct. 1995, pp. 255-265.
[5] Z. J. Haas, J. Y. Halpern, and L. Li, “Gossip-Based Ad Hoc Routing,” IEEE/ACM Trans. Networking, vol. 14, no. 3, Jun. 2006, pp. 479-491.
[6] M. Jiang, J. Li, and Y. C. Tay, “Cluster Based Routing Protocol,” IETF MANET Working Group, Internet-Draft, 1999.
[7] M. Joa and I. T. Lu, “A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks,” IEEE Journal on Selected Areas in Communications, vol. 17, no. 8, Aug. 1999, pp. 1415-1425.
[8] D. Johnson and D. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, Kluwer Academic Publishers, 1996, pp. 153-181.
[9] D. Johnson, D. Maltz, and Y.-C. Hu, “The Dynamic Source Routing for mobile ad hoc networks,” IETF Internet Draft. http://www.ietf.org/internet-drafts/draft-ietf-manet-dsr-10.txt, Jul. 2004.
[10] S. Leng, L. Zhang, H. Fu, and J. Yang,“A Novel Location-Service Protocol Based on k-Hop Clustering for Mobile Ad Hoc Networks,” IEEE Trans. Vehicular Technology, vol. 56, no. 2, pp. 810-817, Mar. 2007.
[11] S. Murphy and J.J. Garcia-Luna-Aceves, “An efficient routing protocol for wireless networks,” ACM/Baltzer Journal on Mobile Networks and Applications, Special Issue on Routing in Mobile Communication Networks, Oct. 1996, pp. 183-197.
[12] C. S. R. Murthy and B. S. Manoj, Ad Hoc Wireless Networks: Architectures and Protocols, Prentice Hall, New Jersey, 2004.
[13] X. Niu, Z. Tao, G. Wu, C. Huang, and L. Cui, “Hybrid Cluster Routing: An Efficient Routing Protocol for Mobile Ad Hoc Networks,” in Proc. IEEE International Conference on Communications (ICC’06), vol. 8, 2006, Turkey, pp. 3554-3559.
[14] F. G. Nocetti, J. Solano-Gonazales, and I. Stojmenovic, “Connectivity-based k-hop clustering in wireless networks,” Kluwer Telecommunications Systems, Apr. 2003, pp. 205-220.
[15] V. Park, M. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” in Proc. IEEE International Conference on Computer Communication (INFOCOM), vol.3, Apr. 1997, Kobe, Japan, pp.1405-1413.
[16] M. R. Pearlman and Z. J. Haas, "Determining the Optimal Configuration for the Zone Routing Protocol", IEEE Journal on Selected Areas in Communications, vol. 17, no. 8, Aug.1999, pp. 1395-1414.
[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] C.E. Perkins and P. Bhagwat, “Highly dynamic destination -sequenced distance-vector routing (DSDV) for mobile computers,” Computer Communication Review, ACM SIGCOMM, vol.24, no.4, Aug. 1994, London, England, pp. 232-244.
[20] T. K. Pham and J. S. Heo, “Multi-Level Cluster-Based Hierarchical Protocol for Ad Hoc Mobile Networks,” in Proc. International Conference on Computer and Electrical Engineering (ICCEE 2008), Dec. 2008, Phuket, Thailand, pp.901-905.
[21] K, RahimiZadeh. “Design of a Cluster-Based Routing for Integrated Cellular and Ad Hoc Networks,” in Proc. Communication Networks and Services Research Conference 2009 (CNSR '09), May. 2009, Moncton, Canada, pp. 422–424.
[22] N. S. Yadav and R.P.Yadav “Performance Comparison and Analysis of Table-Driven and On-Demand Routing Protocols for Mobile Ad-hoc Networks,” International Journal of Information Technology, vol.4, no.2, pp.101-109.
[23] S. Yang, J. Wu, and J. Cao, “Connected k-Hop Clustering in Ad Hoc Networks,” in Proc. International Conference on Parallel Processing (ICPP’05), Jun. 2005, Norway, pp. 373-380.
[24] VINT Group, UCB/LBNL/VINT Network Simulator ns-2. [Online].
Available: http://www.isi.edu/nsnam/
[25] NS manual: http://www.isi.edu/nsam/ns/ns-documentation.html,
Page accessed on January 06, 2009.
[26] Trace Graph: http://www.tracegraph.com
Page accessed on January 06, 2009.