Responsive image
博碩士論文 etd-0321115-092500 詳細資訊
Title page for etd-0321115-092500
論文名稱
Title
行動隨意網路中以2-hop叢集架構為基礎的路由協定及其備用路徑機制
A Routing Protocol with Repair Mechanism Based on 2-hop Clustering Structure in Mobile Ad Hoc Networks
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
68
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2015-03-25
繳交日期
Date of Submission
2015-04-30
關鍵字
Keywords
行動隨意網路、路由協定、叢集管理節點、匝道節點、連結終止時間
Mobile Ad Hoc Network (MANET), routing protocol, cluster head, gateway, link expiration time (LET)
統計
Statistics
本論文已被瀏覽 5688 次,被下載 503
The thesis/dissertation has been browsed 5688 times, has been downloaded 503 times.
中文摘要
在行動隨意網路中,有良好效率的路由協定一直是一個主要的研究議題,近年來,許多研究提出階層式架構來支援路由協定以節省封包的數量如cluster-based routing algorithm,這種架構是採用叢集管理節點(cluster head)來負責管理叢集內成員,雖然其應用在網路較大的環境中效果較平面式架構佳,但是叢集管理節點相對負擔也會比一般節點還大,因此容易導致叢集瓦解。本文以2-hop 非重疊叢集架構為基礎,提出一個新的路由協定RP2CS來改善叢集管理節點的負擔。若來源節點可在neighbor table中找到目的節點,就直接將封包傳給目的節點,否則就發出route request packet (RREQ)找尋目的節點。目的節點收到後沿著RREQ通過的叢集範圍內回傳route reply packet (RREP)重新找尋路徑,而非採用RREQ傳送的路徑,這種方式避免叢集管理節點必定包含在傳送路徑中,可以減輕其負擔。傳送資料封包(data packet)時只記錄閘道節點(gateway),再由閘道節點決定到下一個閘道節點的路徑,依節點與節點之間的連結終止時間(Link expiration time)來選擇最穩定的路徑。在路徑的維護上不同於先前提出的方法,以叢集的觀點修復斷裂的連結並且在叢集內重新找尋路徑。本篇提出的方法可以將叢集管理節點的負擔分配到其他成員節點上並且可以修復更多路徑斷裂的情況。透過實驗的模擬及分析,可以證明本篇提出的方法在節點密度高及拓樸變化大的環境下,平均封包抵達率及overhead皆優於先前提出的研究。
Abstract
In mobile ad hoc networks (MANETs), effective routing is a critical issue. Many routing protocols have been proposed to build a hierarchical structure for supporting the scalability of large MANET in the past years, for example, cluster-based routing protocols. Cluster heads in cluster-based routing protocols manage member nodes in their range and transmit the packets, so they will die out from overloading. In terms of scalability, the hierarchical structure is better than the flat structure in a larger network. In this paper, we propose a routing protocol based on 2-hop non-overlapping clusters called RP2CS to alleviate the loading of cluster heads. Here the source sends packets to the destination directly if the destination is the neighbor of the source; otherwise the source 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 the destination, the destination broadcasts the route reply packet (RREP) via the nodes within the clusters which the RREQ has passed to find the source. The route constructed by our method can avoid the cluster heads being always in the transmission route and collapsing due to overloading. The work adopts source routing to transmit data packets, but the source only fills the gateway list in data packet’s header. The route is selected with the higher link expiration time (LET), which represents the stability of link. In the route maintenance, the broken link is repaired by the view of clusters, so it can restore the path widely. The method we proposed here distributed the overhead to member nodes and it has greater effect on route repair. Simulation results demonstrate that our proposed protocol has better performance in average packet delivery ratio and less overhead than other cluster-based routing protocols.
目次 Table of Contents
論文審定書 i
摘 要 ii
Abstract iii
目 錄 v
圖 次 ii
表 次 iv
字母縮寫對照表 v
第一章 導論 1
1.1 簡介 1
1.1.1 IEEE802.11定義的兩種無線網路架構 4
1.1.2 隨意式無線網路的研究重點 5
1.1.3 隨意式無線網路中的路由協定 6
1.1.4 隨意式無線網路的架構 9
1.2 研究動機 10
1.3 論文架構 11
第二章 背景及相關研究 12
2.1 叢集架構的優缺點 12
2.1.1 K-hop Compound Metric Based Cluster (KCMBC) 13
2.2 名詞釋義 16
2.3 叢集架構上的路由協定 16
2.4 RP2CS的基本概念 21
第三章 系統之架構與運作 23
3.1 研究方向與設計動機 23
3.2 新增功能 24
3.3 協定機制 24
3.3.1 路徑搜尋階段 24
3.3.2 路徑維護階段 31
第四章 模擬實驗與數據分析 39
4.1 模擬環境參數設定 39
4.2 數據分析與討論 40
4.3.1 Packet Delivery Ratio 41
4.3.2 End-to-end Delay 45
4.3.3 Normalized Routing Overhead 46
第五章 結論及未來發展 50
參考文獻 52
參考文獻 References
[1] A. D. Amis, R. Prakash, T. H. P. Vuong, and D. T. Huynh,“Max-Min D-Cluster Formation in Wireless Ad Hoc Networks,”in Proc. IEEE INFOCOM, Mar. 2000, pp. 32-41.
[2] R. Agarwal and M. Motwani, "Survey of clustering algorithms for MANET," International Journal on Computer Science and Engineering, Vol. 1, No. 2, Sep. 2009, pp. 98-104.
[3] J. Broch, D. A. Maltz, D. B. Johnson, Y. C. Hu, and J. G. Jetcheva, “A performance comparison of multi-hop wireless ad hoc network routing protocols,” in Proc. MobiCom, Oct. 1998, pp. 85-97.
[4] N. Borovina and B. Perunicic, “Mobile ad hoc networks: Local distributed algorithms for virtual backbone,” Telecommunications Forum Telfor (TELFOR), Nov. 2014, pp. 75-82.
[5] P. Bellavista and E. Magistretti, “How node mobility affects k-hop cluster quality in Mobile Ad Hoc NETworks: A quantitative evaluation,” IEEE Symposium on Computers and Communications, Jul. 2008, pp. 750-756.
[6] S. Basagni, M. Mastrogiovanni, A. Panconesi, and C. Petrioli, “Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison,” IEEE Transactions on Parallel and Distributed Computing, Vol. 17, No. 4, Apr. 2006, pp. 292-306.
[7] C. C. Chiang, H. K. Wu, W. Liu, and M. Gerla, “Routing in clustered multihop mobile wireless networks with fading channel,” in Proc. Singapore International Conference on Networks, Oct. 1997, pp. 197-211.
[8] 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, Apr. 2002, pp. 193-204.
[9] S. Choi and K. G. Shin, “A unified wireless LAN architecture for real-time and non-real-time communication services,” IEEE/ACM Transactions on Networking, Vol. 8, No. 1, Feb. 2000, pp. 44-59.
[10] D. Gavalas, G. Pantziou, C. Konstantopoulos, and B. Mamalis, "Lowest-ID with Adaptive ID Reassignment: A Novel Mobile Ad-Hoc Network Clustering Algorithm", 1st IEEE International Symposium on Wireless Pervasive Computing, Jan. 2006, pp. 1-5.
[11] M. Gerla and T. C. Tsai, “Multicluster, Mobile, Multimedia radio network,” Journal of Wireless Networks, Vol. 1, No. 3, Oct. 1995, pp. 255-265.
[12] Z. J. Haas, M. R. Pearlman, and P. Samar, “The Zone Routing Protocol (ZRP) for ad hoc networks,” draft-ietf-manet-zone-zrp-04.txt, Jan. 2003.
[13] D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in ad hoc wireless networks,” Mobile Computing, 1996, pp. 153-181.
[14] D. Johnson, D. Maltz, and Y. C. Hu, “The dynamic source routing for mobile ad hoc networks,” IETF Internet Draft, Jul. 2004.
[15] M. Joa and I. T. Lu, “A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks,” IEEE Journal Selected Areas in Communications, Vol. 17, No. 8, Aug. 1999, pp. 1415-1425.
[16] M. Jiang, J. Li, and Y. C. Tay, “Cluster Based Routing Protocol (CBRP),” draft-ietf-manet-cbrp-spec-01.txt, Aug. 1999.
[17] P. Jacquet, A. Laouiti, P. Minet, and L. Viennot, “Performance analysis of OLSR multipoint relay flooding in two ad hoc wireless network models,” INRIA research report RR-4260, Sep. 2001.
[18] S. J. Lee and M. Gerla, “AODV-BR: Backup Routing in Ad Hoc Networks”, IEEE Wireless Communications and Networking Confernce, Sep. 2000, pp. 1311-1316.
[19] S. Leng , Y. Zhang , H. H. Chen , L. Zhang, and K. Liu, “A novel k-hop Compound Metric Based Clustering scheme for ad hoc wireless networks ,” IEEE Transactions on Wireless Communications, Jan. 2009, pp. 367-375.
[20] W. K. Lai, S. Y. Hsiao, and Y. C. Lin, “Adaptive backup routing for ad hoc networks”, Computer Communications, Vol. 30, No. 2, Jan. 2007, pp. 453-464.
[21] S. Murphy and J. J. Garcia-Luna-Aceves, “An efficient routing protocol for wireless networks,” Special Issue on Routing in Mobile Communication Networks, Vol. 1, No. 2, Oct. 1996, pp. 183-197.
[22] X. Niu, Z. Tao, G. Wu, L. Cui, and C. Huang, “Hybrid Cluster Routing: An Efficient Routing Protocol for Mobile Ad Hoc Networks,” IEEE International Conference on Communications, Vol. 8, Jun. 2006, pp. 3554-3559.
[23] C. E. Perkins and E. M. Royer, "Ad Hoc On Demand Distance Vector Routing," Workshop on Mobile Computing Systems and Applications, Feb. 1999, pp. 90-100.
[24] C. E. Perkins and P. Bhagwat, “Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers,” in Proc. ACM SIGCOMM, Sep. 1994, pp. 234-244.
[25] V. Park and M. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” in Proc. IEEE International Conference on Computer Communication, Vol. 3, Apr. 1997, pp. 1405-1413.
[26] C. Sengul and R. Kravets, “Bypass routing: An on-demand local recovery protocol for ad hoc networks,” in The Third Annual Mediterranean Ad Hoc Networking Workshop, Vol. 4, No. 3, May 2006, pp.380-397.
[27] B. L. Xiao, W. Guo, J. Liu, and S. L. Zhu, “An Improvement for Local Route Repair in Mobile Ad Hoc Networks”, in 6th International Conference on ITS Telecommunications Proceedings, Jun. 2006, pp. 691-694.
[28] J. Y. Yu, P. H. J. Chong, and M. Zhang, "Performance of Efficient CBRP in Mobile Ad Hoc Networks (MANETS)," IEEE 68th Vehicular Technology Conference, Sep. 2008, pp. 1-7.
[29] The UCB/LBNL/VINT Network Simulator-ns (Version 2). VINT Project. Available: http://www.isi.edu/nsnam/
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:自定論文開放時間 user define
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available


紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code