簡易檢索 / 詳目顯示

研究生: 楊文嘉
Yang, Wen-Chia
論文名稱: 隨意行動網路上之強健性階層式通訊協定設計
A Robust Hierarchical Routing Protocol in Mobile Ad Hoc Networks
指導教授: 許靜芳
Hsu, Ching-Fang
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 資訊工程學系
Department of Computer Science and Information Engineering
論文出版年: 2007
畢業學年度: 95
語文別: 英文
論文頁數: 55
中文關鍵詞: 叢集無線行動隨意網路
外文關鍵詞: wireless mobile ad hoc network, cluster
相關次數: 點閱:49下載:1
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 近年來無限網路已經被廣泛的使用,無線行動隨意網路(MANET)從許多年已經就開始發展了。無線行動隨意網路是由一群獨立行動隨意節點聚集而成。它被廣泛的運用在各式的場合,例如:感應器,醫療方面及戰場上等等。每一個ad hoc node在無線行動隨意網路中不只是一個主機,同時也是一個路由器,然而每一個ad hoc node要幫其他的ad hoc nodes專送封包以達到跟目的端建立連線的目的。
    在無線行動隨意網路中,每一個ad hoc node可以自由的移動,這會導致一些路由因為每個ad hoc node移動的關係,而使得路由斷裂而導致網路效能變差,所以在無線行動隨意網路中提供一個有效的路由協定是非常重要的,在此篇文章中,我們提出了一個多路徑的路由協定,稱作適當的以叢集為基礎的路由協定,在此協定中,我們將一些ad hoc node集結起來以形成一個基本的單位,稱為叢集,它可以藉由從其它的鄰近節點接收到的控制訊息並有效的整合這一些路由資訊,進而可以提供更好的延展性以及網路效能。模擬的結果顯示出我們提出的路由協定只需多付出一些控制訊號就可以得到比之前提出的一些演算法更好的效能。

    In recent years, wireless network has been in widespread use. Wireless mobile ad hoc network (MANET) was developed many years ago. MANET is composed of a collection of mobile independent ad hoc nodes. It is widely used in many environments such as sensor, medical fields, and battlefield etc. Each ad hoc node in MANET is not only a host but also a router and each ad hoc node can forward those received packets sent from other ad hoc nodes to help establishing connection to destinations.
    In the MANET, each ad hoc node can move arbitrarily, the route may be invalid due to mobility. It is important to provide an efficient routing protocol in the MANET. In this thesis, we proposed a cluster-based routing protocol called Adaptive Clustering based Routing Protocol (ACRP). In ARCP, we collect some ad hoc nodes into a cluster and we use a cluster as a work group. It can collect routing information efficiently by receiving Hello message sent from other neighbor nodes and provide better scalability and performance than other flat routing protocols. The simulation results shows that ACRP provides better performance than other algorithms with the cost of a little normalized control overhead than other algorithms.

    摘要 III ABSTRACT IV LIST OF TABLES VIII LIST OF FIGURES IX CHAPTER 1 INTRODUCTION 1 CHAPTER 2 RELATED WORK 5 2.1 AD HOC ON-DEMAND DISTANCE VECTOR ROUTING PROTOCOL (AODV) 5 2.1.1 Local connection maintenance 5 2.1.2 Routing path discovery 6 2.1.3 Establishing reverse path 7 2.1.4 Establishing forwarding path 8 2.1.5 Routing path maintenance 9 2.2 ADAPTIVE ROUTING USING CLUSTERED HIERARCHIES PROTOCOL (ARCH) 11 2.2.1 Initialization 11 2.2.2 Discovering the topology 12 2.2.3 Merge scheme 15 2.3 HYBRID CLUSTER ROUTING (HCR) 16 2.3.1 Cluster formation and maintenance 17 2.3.2 Cluster maintenance 18 2.3.3 Hybrid cluster routing protocol 19 CHAPTER 3 THE PROPOSED SCHEME 23 3.1 MOTIVATION 23 3.2 CLUSTER FORMATION 24 3.3 ROUTING DISCOVERY 27 3.4 CLUSTER MERGE SCHEME 32 3.5 ROUTING PATH REPAIR 37 CHAPTER 4 PERFORMANCE EVALUATION 40 4.1 THE METRICS FOR PERFORMANCE EVALUATION 40 4.2 SIMULATION RESULTS AND ANALYSIS 41 4.2.1 The effect of pause time 44 4.2.2 The effect of the number of connection pairs 48 CHAPTER 5 CONCLUSION 53 BIBLIOGRAPHY 54

    [1] IETF. Mobile ad hoc networks charter, http://www.ietf.org/html.charters/manet-charter.html
    [2] S. Basagni, “Distributed clustering for ad hoc networks” in: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms, and Networks, Australia (June 1999) Page(s): 310–315.
    [3] E.M.BELDING-ROYER, “Multi-Level Hierarchies for Scalable Ad hoc Routing” Page(s):461-478 September 2003 http://portal.acm.org/citation.cfm?id=942550&jmp=cit&coll=Portal&dl=GUIDE&CFID=18989824&CFTOKEN=83147159#CIT
    [4] C.-C. Chiang, H.-K. Wu, W. Liu and M. Gerla, “Routing in clustered multihop, mobile wireless networks with fading channel”, in: Proceedings of IEEE Singapore International Conference on Networks (SICON) (April 1997) Page(s): 197–211.
    [5] T. Clausen and P. Jacquet, “Optimized Link State Routing Protocol (OLSR)”, RFC 3626, IETF Network Working Group, October 2003.
    [6] Z. Haas, M. Pearlman, and P. Samar, “Zone Routing Protocol (ZRP)”, IETF Internet Draft, draft-ietf-manet-zrp-04.txt, July 2002.
    [7] M.-L. Jiang, J.-Y. Li, and Y.-C. Tay, “Cluster Based Routing Protocol (CBRP) Functional Specification”, IETF Internet Draft, draft-ietf-manet-cbrp-spec-01.txt, July 1999.
    [8] D. Johnson, D. Maltz, and Y.-C. Hu, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks”, Internet Draft, draft-ietfmanet-dsr-10.txt, July 2004.
    [9] P. Misra, ”Routing Protocols for Ad Hoc Mobile Wireless Networks”, http://www.cse.wustl.edu/~jain/cis788-99/adhoc_routing/index.html
    [10] S. McCanne and S. Floyd, NS-2 Simulator, http://www.isi.edu/nsnam/ns
    [11] X.-G. Niu, Z.-H. Tao, G.-G. Wu, C.-C. Huang, Li Cui, “Hybrid Cluster Routing: An Efficient Routing Protocol for Mobile Ad Hoc Networks” Communications, 2006 IEEE International Conference on Volume 8, June 2006 Page(s):3554 - 3559 Digital Object Identifier 10.1109/ICC.2006.255623
    [12] T. Ohta, N. Murakami, R. Oda, Y. Kakuda, “An improved autonomous clustering scheme for highly mobile large ad hoc networks” 4-8 April 2005 Page(s):655 - 660 Digital Object Identifier 10.1109/ISADS.2005.1452162
    [13] C.E. Perkins and T.J. Watson, “Highly Dynamic Destination Sequenced Distance Vector Routing (DSDV) for Mobile Computers”, Proceeding of ACM SIGCOMM Conference on Communications Architectures, London, Page(s): 234-244, October 1994.
    [14] V. D. Park and M. S. Corson, “Temporally-Ordered Routing Algorithm (TORA) version 1: functional speciations”, Internet draft, draft-ietfmanet-tora-spec-01.txt, April 2002.
    [15] C.E. Perkins, E. Belding-Royer, and S. Das, “Ad hoc On-Demand Distance Vector (AODV) Routing”, RFC 3561, IETF Network Working Group, July 2003.
    [16] E.-M. Royer, C.-K. Toh, “A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks” IEEE Personal Communications Volume 6, Issue 2, April 1999 Page(s):46 – 55
    [17] J.Y.-Yu, P.H.J-Chong, ”A survey of clustering schemes for mobile ad hoc networks” IEEE Communications Surveys & Tutorials, Volume 7, Issue 1, First Qtr. 2005 Page(s):32 – 48

    下載圖示 校內:2009-08-27公開
    校外:2009-08-27公開
    QR CODE