隨著近幾年來無線網路科技之蓬勃發展與快速進步，使得許多攜帶型裝置可以藉由無線網路技術享受隨時隨地無線上網的便利。IEEE 802.11定義兩種無線網路架構：Infrastructure和Ad hoc網路，Ad hoc行動網路是屬於一種不需要基地台支援的網路類型，因此在網路上有效率的繞送就佔極重要的因素，而這其中又以使用叢集演算法來劃分網路較為有效率。
因此，本篇論文就以Ad hoc行動網路上混合式繞送的叢集演算法為目標，我們提出一個以連結評估為基礎並結合雙管理者方法的K-hop叢集演算法，不僅可以快速的形成叢集，並選出較合適的節點成為叢集管理者，而且還可以有效的減輕叢集管理者的繞送負載。另外，我們提出維護和備份機制搭配演算法，藉由這些方法，我們可以使整個網路架構維持在很穩定不易變動的狀態。實驗結果證明出我們的方法在叢集形成個數、管理者的繞送負載和叢集穩定度上都優於其他的叢集演算法。

With rapidly development of wireless network technology in the past few years, hand-held devices can connect to Internet everywhere conveniently by equipped with wireless card. IEEE 802.11 defined two types of wireless networks: infrastructure networks and ad hoc networks. Since ad hoc networks are a kind of networks without access points, efficient routing is an important issue for these networks. A more efficient routing approach involves dividing the network into several clusters by using a clustering algorithm.
The purpose of this paper is to investigate a hybrid cluster routing algorithm in mobile ad hoc networks. This investigation proposed a double-manager K-hop clustering algorithm based on the link evaluation. This algorithm not only can elect a more suitable node as the cluster head but also can reduce the overhead of the managers. Furthermore, this study devised maintenance and backup mechanisms to stabilize network performance in the face of network topology changes. The simulation results demonstrate that our proposed algorithm outperforms other clustering algorithm in terms of number of clusters, routing overhead of managers and cluster stability.

中文摘要……………………………………………………………I
英文摘要……………………………………………………………II
目錄…………………………………………………………………IV
圖目錄………………………………………………………………V
表格目錄……………………………………………………………VI
第一章 簡介………………………………………………………1
第1.1節 概論………………………………………………………1
第1.2節 研究動機…………………………………………………9
第1.3節 論文架構…………………………………………………10
第二章 相關研究…………………………………………………12
第三章 結合雙管理者的K-hop叢集演算法……………………18
第3.1節 連結評估…………………………………………………18
第3.2節 叢集形成演算法…………………………………………20
第3.3節 叢集繞送演算法…………………………………………24
第四章 維護和備份機制…………………………………………29
第4.1節 維護機制…………………………………………………29
第4.2節 備份機制…………………………………………………31
第五章 實驗結果…………………………………………………34
第5.1節 模擬環境假設……………………………………………34
第5.2節 模擬環境參數設定………………………………………35
第5.3節 模擬數據分析……………………………………………37
第六章 結論………………………………………………………44
參考文獻……………………………………………………………45

[1] M. Chatterjee, S.K. Sas, D. Turgut, “An on-demand weighted clustering algorithm (WCA) for ad hoc networks”, in Proceedings of IEEE Globeeom 2000, Nov. 2000, pp. 1697-1701.
[2] C.C. Chiang and M. Gerla, “Routing and multicast in multihop, mobile wireless network”, in Proceedings of IEEE ICUPC’97, Oct. 1997, pp. 546-551.
[3] S. Corson and J. Macker, “MANET: routing protocol performance issues and evaluation considerations”, IETF Informational RFC 2501, January 1999.
[4] M. Gerla and J.T.-C. Tasi, “Multicluster, mobile, multimedia radio network”, ACM Baltzer Journal of Wireless Networks, Vol. 1, No. 3, Oct. 1995, pp. 255-265.
[5] Z.J. Haas, “A new routing protocol for the reconfigurable wireless networks”, in Proceedings of IEEE ICUPC’97, Oct. 1997, pp. 562-566.
[6] Z.J. Haas and S. Tabrizi, “On some challenges and design choices in ad-hoc communications”, in Proceedings of IEEE MILCOM’98, Oct. 1998, pp.187-192.
[7] T.C. Hou and T.J. Tsai, “Adaptive clustering in a hierarchical ad hoc network”, in Proceedings of ICS Workshop on Computer Networks, Internet, and Multimedia, Dec. 1998, pp.171-176.
[8] A. Iwata, C.C. Chiang, G. Pei, M. Gerla and T.W. Chen, “Scalable routing strategies for ad hoc wireless networks”, IEEE JSAC, Vol. 17, No.8, Aug. 1999, pp. 1369-1379.
[9] J. Broch, D.B. Johnson and D.A. Maltz, “The dynamic source routing protocol for mobile ad hoc networks”, Internet Draft of the IETF MANET Working Group, Dec. 1998.
[10] J. Jubin and J.D. Tornow, “The DARPA packet radio network protocols”, in Proceedings of IEEE, Vol. 75, No. 1, Jan. 1987, pp. 21-32.
[11] D. Kim, S. Ha and Y. Choi, “K-hop cluster-based dynamic source routing in wireless ad-hoc packet radio networks”, in Proceedings of IEEE VTC'98, May 1998, pp. 224-228.
[12] L. Kleinrock and F. Kamoun, “Hierarchical routing for large networks: performance evalution and optimization”, Computer Networks, Vol. 1, No. 3, Jan. 1977, pp. 155-174.
[13] C.R. Lin and M. Gerla, “Adaptive clustering for mobile wireless networks”, IEEE Journal on Selected Areas in Communications, Vol. 15, No.7, Sep. 1997, pp. 1265-1275.
[14] C.B. Lin and S.F. Hwang, “An efficient routing algorithm in ad hoc networks”, in Proceedings of NCS99, Jun. 1999, pp. C494-C503.
[15] S. Murth and J.J. Garcia-Luna, “An efficient routing protocol for wireless networks”, ACM Mobile Networks and Application Journal - Special Issue on Routing in Mobile Communication Networks, Oct. 1996, pp. 183-197.
[16] V.D. Park and M.S. Corson, “A highly adaptive distributed routing algorithm for mobile wireless networks”, in Proceedings of IEEE INFOCOM’97, Apr. 1997, pp. 1405-1413.
[17] C.E. Perkins, “Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers”, Computer Communications Review, Oct. 1994, pp. 234-244.
[18] C.E. Perkins, “Ad-hoc on-demand distance vector routing”, in Proceedings of 2nd IEEE Workshop Mobile Computer Systems and Applications, Feb. 1999, pp. 90-100.
[19] C.V. Rammamoorthy and W.-T. Tsai, “An adaptive hierarchical routing algorithm”, in Proceedings of IEEE CSAC, Fall 1983, pp. 93-104.
[20] D.C. Su, S.F. Hwang, C.R. Dow and Y. W. Wang, “An efficient k-hop clustering routing scheme for ad-hoc wireless networks”, Journal of the Internet Technology, Vol.3, No.2, Apr. 2002, pp. 139-146.
[21] C.K. Toh, Ad hoc mobile wireless networks: protocols and systems, New Jersey: Prentice Hall PTR, ch.5, pp.57-77.
[22] C.K. Toh, “Associativity-based routing for ad-hoc mobile networks”, Wireless Personal Communications, Vol. 4, No. 2, Mar. 1997, pp. 1-36.
[23] NS-Network Simulator：http://www.isi.edu/nsnam/ns/
[24] NS manual：http://www.isi.edu/nsnam/ns/ns-documentation.html