在隨意式無線網路中，有良好效率的繞送協定ㄧ直是主要的研究議題。近年來，有許多研究提出階層式繞送法，利用建立骨幹架構來支援隨意式無線網路的封包繞送，尤其是大型無線網路。利用形成叢集的方式，可以在平面式的網路中建立階層式的架構，叢集內的叢集管理者具有較大的傳輸功率以傳送封包，利用叢集管理者當做骨幹節點可形成骨幹網路。骨幹網路繞送的好處是可以減少資料封包在整個網路中的轉送跳躍數，然而，過去的協定均著重在叢集架構上，在骨幹架構裡的容錯卻很少被考慮。本論文中，我們提出一個備援繞送的機制，藉由在資料封包的標頭資訊中包裹備援路徑，不需經過路徑重新搜尋的程序，便可以修復被損壞的路徑，達到路徑的可靠性。模擬分析的結果顯示，我們所提出的路徑備援機制繞送法，相對於其它一般的階層式繞送演算法，可以增加封包抵達率以及減少控制封包數。

Effective routing is critical in mobile ad hoc networks (MANETs). In recent years, many hierarchical routing protocols have been proposed to build a backbone structure for supporting MANET routing, especially for large scalability. The clustering approach is seen as the first step in providing a flat network with a hierarchical architecture. The clusterheads become the backbone nodes (BNs), which use greater power to transmit packets, forming the backbone network. Backbone network routing can
reduce the number of data-packet forwarding hops throughout the entire network. However, previous protocols have focused on clustering schemes. Fault tolerance in a backbone structure has not been considered. In this paper, we propose a backup routing scheme that can repair broken
links locally without activating a route re-discovery procedure. The backup route is piggybacked in the data packet header to achieve the most durable route. The proposed method can improve the packet delivery ratio and reduce control overhead, compared to general hierarchical
routing protocols.

目錄
中文摘要..............................................I
英文摘要.............................................II
目錄................................................III
圖目錄...............................................VI
表格目錄...........................................VIII
字母縮寫與全名對照表.................................IX
第一章 導論...........................................1
1.1 簡介..............................................1
1.1.1 隨意式無線網路的研究重點........................9
1.1.2 主要繞送協定的分類..............................9
1.1.3 隨意式無線網路結構.............................12
1.2 研究動機.........................................13
1.3 論文架構.........................................14
第二章 背景與相關研究................................15
2.1 Dynamic Source Routing （DSR）簡介...............15
2.1.1 路徑搜尋階段...................................15
2.1.2 路徑維護階段...................................17
2.2 叢集形成演算法...................................17
2.2.1 最小ID 叢集形成演算法..........................18
2.2.2 最高連結度叢集形成演算法.......................18
2.2.3 最少叢集變動叢集形成演算法.....................19
2.2.4 權重叢集法.....................................20
2.3 有關骨幹結構之研究...............................20
第三章系統之架構與運作...............................25
3.1 叢集架構.........................................25
3.1.1 定義符號.......................................25
3.1.2 叢集形成與維護.................................27
3.2 繞送機制 （Routing Scheme）......................28
3.2.1 路徑搜尋（Route discovery）....................29
3.2.2 骨幹繞送（Backbone routing）...................29
3.2.3 備援路徑機制（Backup route mechanism）.........33
第四章 模擬結果及分析................................37
4.1 模擬環境假設.....................................37
4.2 模擬環境參數設定.................................38
4.3 數據分析與討論...................................41
4.3.1 數據分析軟體...................................41
4.3.2 封包抵達率分析.................................44
4.3.3 跳躍數分析.....................................49
4.3.4 延遲時間分析...................................51
4.3.5 控制封包數分析.................................55
第五章 結論與未來展望................................60
參考文獻.............................................61

[1] A. Iwata, C. C. Chiang, G Peiand, M Gerla, and T. W. Chen, “Scalable Routing Strategies for Ad Hoc Wireless Networks”, IEEE Journal on Selected Areas in Communications, Special Issue on Wireless Ad Hoc Networks, Vol. 17, No. 8, August 1999, pp. 1369 - 1379.
[2] C. C. Chiang, H. K. Wu, W. Liu, and M. Gerla,“Ruoting in Clustered Multihop, Mobile Wireless Network with Fading Channel”, in Proceedings of the IEEE Singapore International Conference on Networks, April 1997, Singapore, pp. 197 - 211.
[3] C. E. Perkins and E. M. Royer, “Ad Hoc On-Demand Distance Vector Routing”, in Proceedings of Workshop on Mobile Computing Systems & Applications (WMCSA), February 1999, New Orleans, USA, pp. 90 - 100.
[4] C. E. Perkins, “Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers,” Computer Communications Review, ACM SIGCOMM, Vol. 24, No. 4, October 1994, pp. 234 - 244.
[5] D. L. Gu, G. Pei, H. Ly, M. Gerla and X. Hong, “Hierarchical routing for multi-layer ad-hoc wireless networks with UAVs”, in Proceeding of Military Communications Conference (MILCOM), October 2000, Los Angeles, USA, pp. 310 - 314.
[6] J. Broch, D. B. Johnson, and D. A. Maltz, “The dynamic source routing protocol for mobile ad hoc networks”, IETF Internet Draft, draft-ietf-manet-dsr-10.txt, July 2004.
[7] K. Xu, X. Hong, and M Gerla, “An ad hoc network with mobile backbones”, in Proceedings of the IEEE International Conference on Communications (ICC), May 2002, New York, USA, pp. 3138 - 3143.
[8] M. Chatterjee, S. K. Sas and D. Turgut, “An on-demand weighted clustering algorithm (WCA) for ad hoc networks”, in Proceedings of the IEEE Globecom 2000, November 2000, San Francisco, USA, pp. 1697 - 1701.
[9] M. Gerla, and T. C. Tsai, “Multicluster, mobile, multimedia radio network”, ACM-Baltzer Journal of Wireless Networks, Vol. 1, No.3, October, 1995, pp. 255 - 65.
[10] 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, August 1999, pp. 1415 - 1425.
[11] P. Gupta, and P. R. Kumar, “The Capacity of Wireless Networks”, IEEE Transactions on Information Theory, Vol. 46, No. 2, March 2000, pp. 388 - 404.
[12] P. Gupta, R. Gray, and P. R. Kumar, “An Experimental Scaling Law for Ad Hoc Networks”, http://black1.csl.uiuc.edu/~prkumar/ May 16, 2001.
[13] S. Banerjee and S. Khuller, “A Clustering Scheme for Hierarchical Control in Multi-hop Wireless Networks”, in Proceedings of the IEEE International Conference on Computer Communication (INFOCOM), April 2001, Alaska, USA, pp. 1028 - 1037.
[14] S. Guo, and O.W Yang, “Performance of backup source routing in mobile ad hoc networks”, in Proceedings of the IEEE Wireless Communications and Network Conference (WCNC), Vol. 1, 17-21 March 2002, Orlando, Florida, USA, pp. 440 - 444.
[15] S. Guo, O.W Yang, and Y. Shu, “Improving source routing reliability in mobile ad hoc networks”, IEEE Transactions on Parallel and Distributed Systems Vol. 16, no. 4, April 2005 pp. 362 - 373.
[16] S. Murthy 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, October 1996, pp. 183 - 197.
[17] S. R. Das, C. E. Perkins and E. M. Royer, “Performance Comparison of Two On-demand Routing Protocols”, in Proceedings of the IEEE International Conference on Computer Communication (INFOCOM), March 2000, Tel Aviv, Israel, pp. 3 - 12.
[18] T. C Huang, C. K Liao, and C. R Dow, “Zone-based hierarchical routing in two-tier backbone ad hoc networks”, in Proceedings of the IEEE International Conference on Networks (ICON), Vol. 2, 16-19 November 2004, Singapore, pp. 650 - 654.
[19] U. C. Kozat, G. Kondylis, B. Ryu, and M. K. Marina, “Virtual Dynamic Backbone for Mobile Ad Hoc Networks”, in Proceedings of the IEEE International Conference on
Communications (ICC), June 2001, Helsinki, Finland, pp. 250 - 255.
[20] V. D. Park, J. P. Macker and M. S. Corson, "Applicability of the temporally-ordered routing algorithm for use in mobile tactical networks", in Proceedings of the IEEE Military Communications Conference (MILCOM), October 1998, Boston, USA, pp. 426 - 430.
[21] Z. J. Haas, “A new routing protocol for the reconfigurable wireless networks”, in Proceedings of the IEEE International Conference on Universal Personal Communications, October 1997, San Diego, pp. 562 - 566.
[22] C. E. Perkins, Ad Hoc Networking, chapter 4, Addison-Wesley, 2001.
[23] NS - Network Simulator：http://www.isi.edu/nsnam/ns/, Page accessed on September 6, 2006.
[24] NS manual：http://www.isi.edu/nsnam/ns/ns-documentation.html, Page accessed on September 6, 2006.
[25] Trace Graph：http://www.tracegraph.com/, Page accessed on September 6, 2006.