oai:etd.lib.nsysu.edu.tw:etd-0111105-182354 資訊

本論文已被瀏覽 19 次， [ 造訪詳細資料與全文 ] 0 次，[ 回到前頁查詢結果 ] [ 重新搜尋 ]

使用二階繞送之骨幹隨意網路

Backbone Ad Hoc Networks using Two-Tier Routing

作者：廖俊凱
畢業學校：國立中山大學
出版單位：國立中山大學
核准日期：2005-01-13
類型：Electronic Thesis or Dissertation
權限：Copyright information available at source archive--National Sun Yat-sen University....

中文摘要

在本論文中我們將一般網路結合骨幹架構，來形成一個階層式的隨意網路。通常在移動性隨意式網路(Ad Hoc Network)中每一個節點均被假設擁有相同的傳送與接收的能力，然而如果每一個節點都只使用一種相同的傳輸功率將會面臨到網路難以擴展的情況。因此我們建立一個實體(非虛擬)的階層式隨意網路可解決這個問題。骨幹節點(Backbone Nodes)在高階層網路使用可傳送更大範圍的功率作傳輸，並且利用叢集(Cluster)架構的優點來提升大型多變網路中資源使用的效率。本論文中我們提出連結度變化數比例(Rate of Degree Variation)，根據鄰居節點的變動去判斷穩定性，變動較少視為較穩定，並將較穩定的節點選為叢集管理者(Cluster Head)。叢集管理者形成骨幹節點，其他節點則成為叢集成員。管理者底下的叢集成員資訊和周圍叢集的節點資訊被記錄在管理者表格之內，透過這些資訊可以知道來源端和目的端兩節點是否鄰近，並據此來選擇傳送路徑。我們將繞送分成兩種型式:高階層繞送和低階層繞送，可以減輕骨幹網路的負載。在模擬分析後，發現我們所提的二階繞送演算法(Hierarchical Routing in Two Tiers，HRTT)能夠改善平面式網路所產生的問題。

英文摘要

In this paper, a mobile network is combined with backbone structure to form a hierarchical ad hoc network. Usually, a mobile ad hoc network is assumed to be homogeneous such that each mobile node uses the same radio capability. However, a homogenous ad hoc network suffers from poor scalability. In this thesis we establish a physical (not logical) hierarchical network to solve this problem in which backbone nodes are employed to transmit for long distance using larger radio power at high tier and cluster structure is used to efficiently utilize resources in a wide and dynamic network. We propose a cluster head determination scheme based on the degree variations of nodes. The nodes with minimum degree variation in the neighborhood are considered more stable and will be selected as the cluster heads. The cluster heads form the backbone nodes and other nodes are the cluster members. The information of cluster members and the nodes in neighboring clusters are recorded in a table of cluster head. According to the information, we have the knowledge of whether the destination node is close to the source node and can determine how to route the transmission. Routing is divided into low tier and high tier routing to relieve the workload of backbone network. The simulation results demonstrate that the proposed hierarchical routing in two tiers (HRTT) improves some problems occurred in the flat network.

[1] D. Bertsekas, Data Networks, chapter 5, Engledwood NJ: Prentice-Hall, 1992.
[2] 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.
[3] 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.
[4] C. C. Chiang and M. Gerla, “Routing and multicast in multihop, mobile wireless network”, in Proceedings of IEEE International Conference on Universal Personal Communications (ICUPC), Oct. 1997, San Diego, USA, pp. 546-551.
[5] M. Chatterjee, S. K. Sas and D. Turgut, "An on-demand weighted clustering algorithm (WCA) for ad hoc networks", in Proceedings of IEEE Globeeom 2000, Nov. 2000, San Francisco, USA, pp. 1697-1701.
[6] 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.
[7] P. Gupta, R. Gray and P. R. Kumar, "An Experimental Scaling Law for Ad Hoc Networks", Available: http://black.csl.uiuc.edu/˜prkumar/postscriptfiles.html
[8] P. Gupta, and P. R. Kumar, "The Capacity of Wireless Networks', IEEE Transactions on Information Theory, vol. 46, no. 2, pp. 388 -404, March 2000.
[9] 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), Oct. 2000, Los Angeles, USA, pp. 310-314.
[10] 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, Melbourne, Australia, pp.171-176.
[11] C. Jaikaeo and C. C. Shen, "Adaptive Backbone-based Multicast for Ad hoc Networks", in Proceedings of IEEE International Conference on Communications (ICC), May 2002, Cambridge, USA, pp. 3149-3155.
[12] 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, pp. 1415-1425, Aug. 1999.
[13] U. C. Kozat, G. Kondylis, B. Ryu and M. K. Marina, "Virtual Dynamic Backbone for Mobile Ad Hoc Networks", in Proceedings of Implicit Computational Complexity (ICC’01), June 2001, Aarhus, Denmark, pp. 250-255.
[14] S. Murth and J. J. Garcia, “An efficient routing protocol for wireless networks”, ACM Mobile Networks and Application Journal - Special Issue on Routing in Mobile Communication Networks, Vol. 1, No. 2, pp. 183-197, Oct. 1996.
[15] C. E. Perkins and P. Bhagwat, "Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers", in Proceedings of Special Interest Group on Data Communication (SIGCOMM), Aug. 1994, London, England, pp. 234-244.
[16] 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 IEEE Military Communications Conference (MILCOM), Oct. 1998, Boston, USA, pp. 426-430.
[17] G. Pei, M. Gerla and T. W. Chen, "Fisheye State Routing in Mobile Ad Hoc Networks", in Proceedings of Workshop on Wireless Networks and Mobile Computing (WNMC), April 2000, Taipei, Taiwan, pp. 71-78.
[18] G. Pei and M. Gerla, "Mobility Management in Hierarchical Multi-hop Mobile Wireless Networks", in Proceedings of International Conference on Computer Communication and Networks (ICCCN), Oct 1999, Boston, USA, pp. 324-329.
[19] 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, pp. 1395-1414, Aug. 1999.
[20] C. E. Perkins and E. M. Royer, "Ad Hoc On-Demand Distance Vector Routing", in Proceedings of Workshop on Mobile Computing Systems & Applications (WMCSA), Feb. 1999, New Orleans, USA, pp. 90-100.
[21] C. E. Perkins, Ad Hoc Networking, chapter 4, Addison-Wesley, 2001.
[22] K. Xu, X. Hong and M, Gerla, "An ad hoc network with mobile backbones", in Proceedings of IEEE International Conference on Communications (ICC), May 2002, Cambridge, USA, pp. 3138 -3143.
[23] NS-Network Simulator：http://www.isi.edu/nsnam/ns/
[24] NS manual：http://www.isi.edu/nsnam/ns/ns-documentation.html

中文摘要..................................................I
英文摘要.................................................II
目錄.....................................................IV
圖目錄..................................................VII
表格目錄.................................................IX
第一章導論...............................................1
1.1 簡介................................................1
1.1.1 隨意式無線網路的研究重點........................2
1.1.2 主要繞送協定的分類..............................2
1.1.3 隨意式無線網路結構..............................5
1.2 研究動機............................................6
1.3 論文架構............................................7
第二章背景與相關研究.....................................8
2.1 IEEE 802.11 隨意式無線網路..........................8
2.1.1 無線網路組成....................................9
2.1.2 隱藏節點與暴露節點問題...........................10
2.2 叢集形成演算法.....................................14
2.2.1 最小ID叢集形成演算法..........................14
2.2.2 最高連結度叢集形成演算法.......................14
2.2.3 最少叢集變動叢集形成演算法.....................15
2.2.4 權重叢集法.....................................16
2.3 相關研究...........................................16
2.3.1 Zone Routing Protocol..........................16
2.3.2 有關骨幹結構之研究.............................17
第三章二階區域繞送演算法................................20
3.1 叢集的形成和維持...................................20
3.1.1 定義符號.......................................20
3.1.2 叢集形成與維持.................................21
3.2 骨幹網路 (Backbone Network)........................27
3.3 繞送機制 (Routing Scheme)..........................29
3.3.1 低階層繞送.....................................30
3.3.2 高階層繞送.....................................32
3.3.3 gateway節點問題...............................34
第四章模擬結果及分析....................................36
4.1 模擬環境假設.......................................36
4.2 模擬環境參數設定...................................37
4.3 數據分析與討論.....................................40
4.3.1 叢集穩定度分析.................................40
4.3.2 控制封包量分析.................................41
4.3.3 封包到達率分析.................................42
4.3.4 跳躍數分析.....................................44
4.3.5 分流繞送分析...................................45
第五章結論與未來展望....................................47
參考文獻.................................................48

委員 - 李宗南

指導教授 - 黃宗傳

委員 - 許蒼嶺

召集委員 - 楊竹星

委員 - 李錫智

計畫贊助者：