跳到主要內容

臺灣博碩士論文加值系統

(75.101.211.110) 您好!臺灣時間:2022/01/26 13:55
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:陳坤宏
研究生(外文):Kun-Hong Chen
論文名稱:在無線隨意網路中的預期式繞送協定
論文名稱(外文):A Predictive Routing Protocol in Ad-Hoc Wireless Network
指導教授:陳文賢陳文賢引用關係
指導教授(外文):Wen-Shyen E.Chen
學位類別:碩士
校院名稱:國立中興大學
系所名稱:資訊科學研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2002
畢業學年度:90
語文別:中文
論文頁數:53
中文關鍵詞:Ad-Hoc routing protocolon-demandpredictive and signal stability-based
外文關鍵詞:Ad-Hoc routing protocolon-demandpredictive and signal stability-based
相關次數:
  • 被引用被引用:0
  • 點閱點閱:3095
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:1
Ad-Hoc無線網路是指由一群無線行動主機(mobile host)動態形成的一個無線網路,在此網路中並不需要任何網路的基礎建設和集中式的管理,如基地台(base station)。所有的通訊均可藉由鄰近的行動主機相互傳遞和交換訊息來達成。Ad-Hoc無線網路中,繞路更是一項非常重要的課題。如何在Ad-Hoc無線網路的特性(如行主機可隨意移動、網路頻寬有限、記憶體容量和電池持續力等資源都很有限的情況下),如何有效的繞送來傳遞訊息,將較傳統的有線網路更為重要,也更具挑戰性。已經有許多的研究設計在Ad-Hoc的繞送演算法,一些廣為人知的繞送演算法已經被執行在實際情況下。然而,有一個主要缺點在最先前的繞送演算法是被忽略的就是在行動主機之間的無線頻道會依時間而自然改變;像AODV繞送演算法。這是一個非常嚴重的缺點,因為多變的頻道品質將會導致全部繞送品質變的非常差,再者導致較差的資料處理量。在本論文中,我們提出一個可依造頻道情況動態改變繞送路徑的繞送演算法;大量的模擬結果顯示我們推薦的繞送演算法是比AODV繞送演算法來的有效能。

An Ad-Hoc network is a collection of wireless mobile hosts that can dynamically organize into a wireless network without the support of any infrastructure or centralized administration such as the base stations. The data transmission in Ad-Hoc networks can be achieved via the nearby mobile hosts interchanging message information. Routing is a very important key research issue in Ad-Hoc wireless network. Under the identity and limited resources of Ad-Hoc wireless network such as move arbitrarily, limited network bandwidth, limited memory capacity and limited battery power, the efficiency of routing schemes in Ad-Hoc wireless networks become more important and challenging than in traditional networks. Much research has been done on designing Ad-Hoc routing protocols and some well known protocols are also being implemented in practical situations. However, one major drawback in existing state-of-the-art protocols, such as the AODV routing protocol, is the time-varying nature of the wireless channels among the mobile hosts is ignored. This is a serious design drawback because the varying channel quality can lead to very poor overall route quality, in turn result in low data throughput. We propose a new Ad-Hoc routing algorithm that dynamically change the routing paths according to the channel conditions. Extensive simulation results indicate that our proposed protocol are more efficient.

目錄
論文摘要 1
ABSTRACT 2
目錄 3
圖表目錄 5
第1章 簡介 6
1.1 概論 6
1.2 研究動機及重要性 7
1.3 論文架構 7
第2章 知識背景 9
2.1 無線網路 9
2.2 AD-HOC 無線網路 12
第3章 相關研究 16
3.1 TABLE-DRIVEN ROUTING PROTOCOL 17
3.2 ON-DEMAND ROUTING PROTOCOL 19
3.3 HYBIRD ROUTING PROTOCOL 24
第4章 預期式繞送協定 26
4.1 基本定義 26
4.2 繞送路徑的尋找(ROUTE DISCOVERY) 27
4.3 繞送路徑的維護(ROUTE MAINTENANCE) 30
4.4 CAPS繞送分析 32
第5章 模擬結果與效能評估 34
5.1 模擬架構 34
5.1.1 模擬環境 34
5.1.2 模擬環境參數設定 34
5.2 模擬結果與效能分析 35
5.2.1 平均點對點的延遲時間(Average End-to-End Delay) 35
5.2.2 封包成功傳送的比例(Successful Percentage of Packet Delivery) 38
5.2.3 繞送的花費(Routing Overhead) 43
5.2.4 平均連結的產量(Average Link Throughput) 46
5.3 總結 49
第6章 結論與未來展望 51
參考文獻 52

參考文獻
[1] J. Broch, D. A. Maltz, D. B. Johnson, Y. C. Hu and J. Jetcheva “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Network (MobiCom ’98), Oct. 1998.
[2] H. Jiang “Performance Comparison of Three Routing Protocols for Ad Hoc Networks,” IEEE-Tenth International Conference on Computer Communications and Networks , 2001.
[3] A. Boukerche, “Performance Comparison and Analysis of Ad Hoc Routing Algorithms,” IEEE International Conference on Performance, Computing, and Communications, 2001.
[4] J. Bellardo, J.y Fang and G. Hamerly, “Comparison of Ad Hoc Network Routing Protocols,” CSE 202- Algorithms, Nov. 1999.
[5] C.K Toh , “Ad Hoc Mobile Wireless Networks - Protocols and Systems”, 2002.
[6] S. Corson and J. Macker, “Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations,” RFC2501, Jan. 1999.
[7] Z. J. Haas and S. Tabrizi, “On Some Challenges and Design Choices in Ad-Hoc Communications,” IEEE Military Communications Conference (MILCOM’98), 1998.
[8] X. Chen and X. Jia, “Package Routing Algorithms in Mobile Ad-Hoc Wireless Networks,” IEEE International Conference on Parallel Processing Workshops, 2001.
[9] E. M. Royer and C. K. Toh, “A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks,” IEEE Personal Communications, Apr. 1999.
[10] L. Breslau, Deborah, H. Yu and etc., “Advances in Network Simulation,” IEEE VINT Project, May 2000.
[11] S. R. Thampuran, “Routing Protocols for Ad Hoc Networks of mobile nodes”, 2000.
[12] C. E. Perkins and P. Bhagwat, “Highly Dynamic Destination- Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” ACM SIGCOMM'94 Conference on Communications Architectures, Protocols and Applications, 1994.
[13] C. E. Perkins and E. M. Royer, “Ad-Hoc On-Demand Distance Vector Routing(AODV),” WMCSA '99 Second IEEE Workshop on Mobile Computing Systems and Applications, 1999.
[14] D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Network,” Mobile Computing-final project, 1996.
[15] V. D. Park and M. S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” INFOCOM '97 Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution , 1997.
[16] C. E. Perkins, E. M. Royer, S.r R. Das and M. K. Marina, “Performance Comparison of Two On-Demand Routing Protocols for Ad Hoc Networks,” IEEE Personal Communications, Feb. 2001.
[17] A. Nasipuri, R. Burleson, B. Hughes, and J. Roberts, “Performance of A Hybrid Routing Protocol for Mobile Ad-Hoc Networks,” IEEE-Tenth International Conference on Computer Communications and Networks, 2001.
[18] Z. J. Haas, “A New Routing Protocol for The Reconfigurable Wireless Networks,” IEEE 6th International Conference on Universal Personal Communications Record, 1997.
[19] Z. J. Haas and M. R. Pearlman, “The Performance of A New Routing Protocol for The Reconfigurable Wireless Networks,” IEEE International Conference on Communications, 1998.
[20] M. Gerla, T. J. Kwon and G.. Pei, “On-Demand Routing in Large Ad-Hoc Wireless Networks with Passive Clustering,” IEEE-WCNC Wireless Communications and Networking Confernce, 2000.
[21] T. Goff, N. B. Abu-Ghazaleh, D. S. Phatak and R. Kahvecioglu, “Preemptive Routing in Ad-Hoc Networks,” ACM-MOBICOM 2001, the seventh annual international conference on Mobile computing and networking, Jul. 2001.
[22] J. B. Andersen, T. S. Rappaport, and S. Yoshida, “Propagation Measurements and Models for Wireless Communications Channels,” IEEE Communications Magazine, Jan. 1995.
[23] A. B. McDonald and T. Znati “Predicting Node Proximity in Ad-Hoc Networks - A Least Overhead Adaptive Model for Selecting Stable Routes,” IEEE-First Annual Workshop on Mobile and Ad Hoc Networking and Computing, 2000.
[24] A. Boukerche, “A Simulation Based Study of On-Demand Routing Protocols for Ad Hoc Wireless Networks,” IEEE-34th Annual on Simulation Symposium, 2001
[25] “ns-2 simulator”, http://www.isi.edu/nsnam/

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top