(34.201.11.222) 您好!臺灣時間:2021/02/25 13:45
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:林紹熹
研究生(外文):Lin Shao His
論文名稱:具備分路徑動態來源路由之研究
論文名稱(外文):Study in Dynamic Source Route with Backup Route
指導教授:廖基宏
學位類別:碩士
校院名稱:聖約翰科技大學
系所名稱:電機工程系碩士班
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2008
畢業學年度:96
語文別:中文
論文頁數:63
中文關鍵詞:特殊無線網路動態來源路由
外文關鍵詞:Ad hocDSRTable drivenSource On-demend
相關次數:
  • 被引用被引用:0
  • 點閱點閱:86
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
網路的發展最主要的目的是為了傳輸的方便。以往大部分對於網路的觀念主要存在於骨幹式的網路[24]架構,自從1970年代後,無線行動網路(Wireless Network)的出現已經變成近代電腦界的風雲焦點。
無線網路比較於有線網路的差異性是擁有可移動性。而無線行動網路一般可以分固定基地台(Infrastructure)模式,與無線特殊行動網路(Mobile Ad hoc Wireless Network)[1-23]模式。兩者的分別是前者是利用固定基地台來完成兩個(或以上)行動點之間的點對點(End to End)資料傳輸與連結;後者則是沒有固定基地台的設備,而是利用通訊範圍的行動節點作為行動基地台來傳輸資料與連結。
在無線特殊行動網路(Mobile Ad hoc Wireless Network)中,因為不需要固定基地台的架構,所以在這樣環境中的每個節點,不但是終端機而且必須要具備路由器的功能,讓所有在相同環境下的節點可以做網路連結。
因此常見的無線特殊行動網路(Mobile Ad hoc Wireless Network)有基本兩種選徑的方式,一種是以路由表為建立路徑的方式(Table driven),另一種則是來源需求建立的方式(Source On-demend)。
路由表的方式作為建立路徑的方式(Table driven)的作法是當網路形成或有節點加入網路中,就必須先建立起路由表(Route Table),如果需要使用到網路功能時再利用自己所擁有的路由表(Route Table)找尋目的節點進行資料的傳輸。常見的以路由表為建立路徑的方式(Table driven)協定有Destination-Sequenced Distance-Vector Routing (DSDV)、Clusterhead Gateway Switch Routing (CGSR)…等協定。來源需求建立的方式(Source On-demend)則是只有需要用到網路功能時才會建立路徑進行傳輸。常見的來源需求建立的方式(Source On-demend)的協定有Ad Hoc On-Demand Distance Vector (AODV)、…等協定。
本文依來源需求建立的方式(Source On-demend)中的Dynamic Source Routing(DSR)協定中的備分路徑作為探討的目標,並提出修改的方法。
Abstract
Network's development main goal is for convenient which transmits. Were formerly majority of regarding network's idea mainly exists in the backbone-like network [24] construction, 1970 ages later, moves wireless the network (Wireless Network) the appearance already turned the modern computer's wind and cloud focal point.
The wireless network comparison has the removability in the wired network's difference. But moves the network to be possible wireless to divide the fixed base station (Infrastructure) pattern generally, with wireless special motion network (Mobile Ad hoc Wireless Network) [1-23] pattern. Both's distinction is the former is the use fixed base station completes two (or above) between the good moving point point-to-point (End to End) the material transmission with links; The latter does not have the fixed base station's equipment, but transmits the material using message area's motion node as the motion base station with to link.
In wireless special motion network (Mobile Ad hoc Wireless Network), because does not need to fix base station's construction, therefore in such environment each node, is not only the terminal moreover must have the router function, lets possess under the same environment the node may make the network to link.
Therefore the common wireless special motion network (Mobile Ad hoc Wireless Network) has the basic two kinds to choose the diameter the way, one kind is take the routing list as the establishment way way (Table driven), another kind is originates the demand establishment the way (Source On-demend).
Routing list way as establishment way way (Table driven) the method is when the network forms or has the node to join in the network, must establish the routing list first (Route Table), if needs to use time the network function uses the routing list which one have (Route Table) to pursue the goal node again to carry on the material the transmission. Common (Table driven) the agreement has Destination-Sequenced Distance-Vector Routing (DSDV), Clusterhead Gateway Switch Routing take the routing list as the establishment way's way (CGSR)…And so on agreements. The origin demand establishment's way (Source On-demend) will be when needs to use the network function only will then establish the way to carry on the transmission. Common origin demand establishment way (Source On-demend) the agreement has Ad Hoc On-Demand Distance Vector (AODV),…And so on agreements.
This article (Source On-demend) Dynamic Source in the Routing(DSR) agreement prepares a minute way according to the origin demand establishment's way to take the discussion the goal, and proposes the revision method.


Key word: Ad hoc, DSR, Table driven, Source On-demend
目錄
摘要 1
目錄 3
圖目錄 5
表目錄 7
第一章 緒論 8
1.1 研究背景與動機 8
1.1.1 Ad Hoc的基本概念 8
1.2 AD HOC的特徵 9
1.2.1 動態變化的網路拓墣 9
1.2.2 Ad Hoc具有獨立與分部性 11
1.2.3 電力消費高 12
1.2.4 較低的通信頻寬 12
1.2.5 高錯誤率 12
1.3 常見的AD HOC 路由協定 13
1.3.1 Destination-Sequenced Distance-Vector Routing(DSDV) 14
1.3.2 Clusterhead Gateway Switch Routing(CGSR) 14
1.3.3 Ad Hoc On-Demand Distance Vector Routing(AODV) 16
1.3.4 Dynamic Source Routing (DSR) 17
1.4 AD HOC ROUTING 的問題 19
1.5 論文架構 19
第二章 DYNAMIC SOURCE ROUTING (DSR) 20
2.1 DSR 概論 20
2.2 封包種類的介紹 21
2.2.1 Route REQuest Packet (RREQ) 22
2.2.2 Route REPly Packet (RREP) 22
2.2.3 Route ERRor Packet (RERR) 23
2.2.4 Data Packet 24
2.3 DSR ROUTING 流程 25
2.4 舉例說明DSR 29
2.4.1 Route Discovery 29
2.4.2 Route Maintenance 33
2.5 DSR路徑維護的問題 35
第三章 增加備份路徑的DSR 36
3.1 DSR維護路徑的方式 36
3.2 DSR流程規劃 36
3.3 具備份路徑的DSR架構 37
3.3.1 新架構的DSR在RREP程序處理方法 38
3.4 以圖例說明具備分路徑之DSR作法 39
3.5 利用備分路徑做路徑維護 42
3.6 路徑的穩定度 43
第四章 模擬軟體與實驗分析 44
4.1 DSR的模型建立 44
4.2 實驗評估的方式 45
4.3 實驗的結果與分析 46
4.3.1 18個節點數下相同資料長度不同流量覆載之模擬 46
4.3.2 18個節點數下不同資料長度相同流量覆載之模擬 50
4.3.3 24個節點數下相同資料長度不同流量覆載之模擬 54
4.3.4 24個節點數下不同資料長度相同流量覆載之模擬 58
4.4 模擬結果探討 61
第五章 結論 62
參考文獻
[1] E. Royer and C.-K. Toh, “A Review of Current Routing Protocols for Ad Hoc Wireless Networks,” IEEE Personal Communication, pp. 46–55, Apr. 1999.

[2] C. E. Perkins and E. M. Royer, "Ad-hoc On-Demand Distance Vector Routing,"Proc. 2nd IEEE Wksp. Mobile Comp. Sys. and Apps., Feb. 1999, pp. 90-100.

[3] S. Murthy and J. J. Garcia-Luna-Aceves, "An Efficient Routing Protocolfor Wireless Networks," ACM Mobile Networks and App. 1.. Special Issue on Routing in Mobile Communication Networks, Oct. 1996, pp. 183-97.

[4] D. B. Johnson and D. A. Maltz, "Dynamic Source Routing in Ad-Hoc Wireless Networks," Mobile Computing, T. lmielinski and H. Korth, Eds.,Kluwer, 1996, pp. 153-81.

[5] C. E. Perkins and P. Bhagwat, "Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers," Comp. Commun. Rev., Oct. 1994, pp. 234-44.

[6] V. D. Park and M. S. Corson, "A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks," Proc. lNFOCOM '97, Apr. 1997.

[7] V. Park and M. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” Proceeding of INFOCOM ’97, 1997.

[8] Y. H. Wang, C. M. Chung, C. C. Chuang, and C. P. Hsu, “Ad Hoc On-Demand Routing Protocol Setup with Backup Routes”, International Conference on Information Technology: Research and Education (ITRE 2003), August 10-13, 2003.



[9] Chunhung Richard Lin and Mario Gerla, Adaptive Clustering for Mobile Wireless Networks (1997), Chunhung Richard Lin, Mario Gerla, IEEE Journal of Selected Areas in Communications.

[10] M.H. Jiang and R.H. Jan, “An Efficient Multiple Paths Routing Protocol for Ad-Hoc Networks”, Proceedings of 15th IEEE International Conference on Information Networking, 2001, pp. 544-549.

[11] Chih-Chieh Chuang, Chung, C.M., and Ying-Hong Wang, “Ad hoc on-demand backup node setup routing protocol”, Information Networking, 2001. Proceedings. 15th International Conference on, 2001, Page(s): 933-937

[12] Garcia-Luna-Aceves, J.J., Mosko, M. “Multipath Routing in Wireless Mesh Networks. In”WiMesh 2005, Santa Clara, CA, September 26, 2005, IEEE Computer Society Press, Los Alamitos (2005)

[13] Kui Wu and Janelle Harms, “On-Demand Multipath Routing for Mobile Ad Hoc Networks”, EPMCC 2001, Vienna, 20th – 22nd February 2001

[14] A. Nasipuri, R. Castaneda, and S. R. Das,“Performance of Multipath Routing for On-Demand Protocols in Mobile Ad Hoc Networks”, Mobile Networks and Applications, vol. 6, no. 4, Aug. 2001, pp.339-349.

[15] S.-J. Lee and M. Gerla,“Split multipath routing with maximally disjoint paths in ad hoc networks”, in Proceedings of IEEE ICC 2001, pp. 3201-3205, 11-14 June 2001

[16] D. A. Maltz, J. Broch, J. Jetcheva, and D. B. Johnson. “The effects of on-demand behavior in routing protocols for multi-hop wireless ad hoc networks.”IEEE Journal on Selected Areas in Communications, 17(8):1439-1453, August 1999.

[17] S. R. Das, C. E. Perkins, E. M. Royer, and M. K. Marina, “Performance comparison of two on-demand routing protocols for ad hoc networks,” IEEE INFOCOM, 2000.

[18] C.C. Chiang, "Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel," Proc.IEEE SlCON '97, Apr. 1997, pp. 197-211.

[19] S. Singh, M. Woo, and C. S. Raghavendra, “Power-aware routing in mobile ad hoc networks,” International Conference on Mobile Computing and Networking The fourth annual ACM/IEEE international conference on Mobile computing and networking, pp. 181 – 190, 1998.

[20] 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. In In Proceedings of the Fourth Annual ACM/IEEE Inter national Conference on Mobile Computing and Net working, Oct. 1998.

[21] A. Nasipuri and S. R. Das, “On-Demand Multipath Routing for Mobile Ad Hoc Networks,” Proceedings of the 8th Int. Conf. On Computer Communications and Networks (IC3N), Boston, October 1999.

[22] Fang Jing, R.S. Bhuvaneswaran, Y. Katayama, N. Takahashi, "A Multipath On-Demand Routing with Path Selection Probabilities for Mobile Ad Hoc Networks", 2005. Proceedings. 2005 International Conference on Wireless Communications, Networking and Mobile Computing, Volume 2, 23-26 Sept. 2005, pp. 1145-1148.

[23] 謝博穎,”Study of Routing Protocol for Ad-hoc Wireless
Netwroks”,聖約翰科技大學自動化及機電整合研究所,2005.

[24] 張淵德,石維寬,"計算機網路”,至格圖書有限公司,1989.

[25] 葉乃菁,陳世維,"網路概論 ”,文魁資訊股份有限公司, 2002.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
系統版面圖檔 系統版面圖檔