(3.236.231.14) 您好!臺灣時間:2021/04/11 23:43
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:賴建穎
研究生(外文):Chien-ying Lai
論文名稱:行動隨意網路中高穩定式位置輔助之繞徑協定
論文名稱(外文):High Stability and Location-Aided Routing Method for Mobile Ad Hoc Network
指導教授:吳光閔吳光閔引用關係
指導教授(外文):Guang-ming Wu
學位類別:碩士
校院名稱:南華大學
系所名稱:資訊管理學研究所
學門:電算機學門
學類:電算機一般學類
論文種類:學術論文
論文出版年:2007
畢業學年度:95
語文別:中文
論文頁數:52
中文關鍵詞:繞徑協定隨意網路
外文關鍵詞:MANETRouting ProtocolLocation-Aided Routing
相關次數:
  • 被引用被引用:1
  • 點閱點閱:138
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:10
  • 收藏至我的研究室書目清單書目收藏:0
  在行動隨意網路(Mobile Ad hoc Network, MANET)環境下,每一個行動主機(Mobile Host, MH)是透過彼此之間的連線(Link)以及多點跳躍(Multi-Hop)的方式將資料封包送達目的地。但在MANET環境下,過多的控制封包(Control Packet)在網路上傳遞,可能會浪費網路資源,甚至造成網路癱瘓;而如何減少路徑上的跳躍次數,也是繞徑協定上重要的議題。
 
  有許多的繞徑協定(Routing Protocol)被提出來研究,也有將無線網路上的節點(Node)加以定位(Location),利用座標(Position)的資訊提出不同方式的繞徑協定。本篇研究即是屬於位置輔助繞徑協定(Location-Aided Routing Protocol),結合已知的座標位置,可以求得任意兩個節點之間的最短直線(Baseline),並且因為座標資訊的關係,能有方向性的找尋路徑,減少封包漫無目的的在網路上流竄。透過本研究,我們提出High Stable Location Aided Routing Protocol(HSLAR)希望能控制路徑要求(Route Request, RREQ)封包朝向正確的方向傳遞,並且建立出最接近直線距離的路徑。
 
  透過模擬實驗的結果,顯示出本文所提出的HSLAR協定可以減少18.06%至28.83%的Hop Count,並且有效降低封包16.13%至27.65%的發送數量,以及減少傳輸路徑約1.01%至12.3%斷裂的機率。
  In Mobile Ad-hoc Network (MANET), the mobile hosts (MH) intercommunicate through single-hop or multi-hop paths in a peer-to-peer mechanism. But more control overhead of routes may waste resources of network. One problem of routing protocol is to cut down hop counts of a route.
 
  Part of routing protocol was proposed with location by using the global positioning system (GPS), for instance, LAR and ILAR scheme. In this paper, we propose a High Stability and Location-Aided Routing (HSLAR) scheme to improve the ILAR. Our method can reduce control overhead, hop counts and to enhance the stability of routes. We use the MHs’ location information to calculate a baseline between source node (or forward node) and destination node. And then depends on these baselines to establish a route.
 
  The simulation results show that our scheme is more efficiently on control overhead, hop counts and the stability of routes than ILAR scheme.
第一章 緒論1
 1.1 研究背景
  1.2 相關研究
  1.2.1 DSDV Protocol
  1.2.2 AODV Protocol
  1.2.3 ZRP Protocol
 1.3 Position Based Routing Protocol
  1.3.1 LAR Protocol
  1.3.2 ILAR Protocol
  1.3.3 High Stable Location Aided Routing Protocol (HSLAR)
 1.4 章節架構
 
第二章 問題描述23
 
第三章 研究方法23
 3.1 基本環境介紹
 3.2 封包格式描述
 3.3 尋找路徑階段
 3.4 路徑維護階段
 
第四章 模擬實驗38
 4.1 模擬環境
 4.2 模擬結果
 
第五章 結論48
 
參考文獻49
參考文獻
 
[1]B.N. Amotz, N. Joseph and S. Baruch, “Pushing dependent data in clients-providers-servers systems”, IEEE/ACM Wireless Networks (2003), pp. 421-430.
 
[2]D. Aksoy and M.S.F. Leung, “Pull vs Push: A Quantitative Comparison for Data Broadcast”, IEEE/GLOBECOM’04 (2004), pp.1464-1468.
 
[3]L. Barolli, Y. Honma, A. Koyama, A. Durresi and J. Arai, “A Selective Border-casting Zone Routing Protocol for Ad-hoc Networks”, IEEE/DEXA’04 (2004), pp. 326-330.
 
[4]H.L. Chen and C.H. Lee, “Two Hops Backup Routing Protocol in Mobile Ad Hoc Networks”, IEEE/ICPADS''05 (2005), pp. 600-604.
 
[5]J. Cai, T. Terada, T. Hara, and S. NISHIO, “On a Cooperation of Broadcast Scheduling and Base Station Caching in the Hybrid Wireless Broadcast Environment”, IEEE/ACM MDM''06 (2006), pp. 72.
[6]L. Cheng, A.G. Bourgeois and B.H. Yu, “Power Management in Wireless Ad Hoc Networks using AODV”, SNPD-SAWN’05 (2005), pp. 436-443.
 
[7]M.S. Corson and V.D. Park, “A Performance Comparison of the Temporally-Ordered Routing Algorithm and Ideal Link-State Routing”, IEEE/ISCC (1997), pp. 592.
 
[8]T.C. Chiang, P.Y. Wu and Y.M. Huang, “A limited flooding scheme for mobile ad hoc networks”, IEEE/WiMob2005 (2005), pp. 473-478.
 
[9]Y.C. Hu, D.B. Johnson and A. Perrig, “SEAD: Secure Efficient Distance Vector Routing for MobileWireless Ad Hoc Networks”, Elsevier B.V. /Ad hoc Networks (2003), pp. 175-192.
 
[10]D.B. Johnson, and D.A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks”, IEEE/Transactions on Mobile Computing (1996), pp.153-181.
[11]B. Karp and H.T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks”, IEEE/ACM MobiCom (2000), pp. 63-72.
 
[12]Y.B. Ko and N.H. Vaidya, “Location-Aided Routing(LAR) in mobile ad hoc networks”, Wireless Networks 6 (2000), pp. 307-321.
 
[13]H. Nakagawa, K. Ishida, T. Ohta, and Y. Kakuda, “GOLI: Greedy On-Demand Routing Scheme Using Location Information”, IEEE/ICDCSW’06 (2006), pp. 1-1.
 
[14]W. Ni, Q. Fang and S.V. Vrbsky, “A Lazy Data Request Approach for On-demand Data Broadcasting”, IEEE/ICDCSW’03 (2003), pp. 790-796.
 
[15]C.E. Perkins and P. Bhagwat, “Highly Dynamic Destination Sequenced Distance Vector Routing (DSDV) for Mobile Computers”, IEEE/ACM Applications, Technologies, Architectures, and Protocols for Computer Communication (1994), pp. 234-244.
 
[16]R. Purtoosi, H. Taheri, A. Mohammadi and F. Foroozan, “A High Performance Cluster-Based Flooding Algorithm for Wireless Ad Hoc Networks”, IEEE/CIT’05 (2005), pp. 417-423.
 
[17]S. Ramakrishnan1, T. Thyagarajan2, P.K. Ram1 and R. Vinodhl, “Design and Analysis of PADSR Protocol for Routing in MANETs”, IEEE/INDICON’05 (2005), pp. 193-197.
 
[18]X. Ren and H. Yu, “Multipath Disjoint Routing algorithm for Ad Hoc Wireless Sensor Networks”, IEEE/ISORC’05 (2005), pp. 253-256.
 
[19]C.R. Shiung, C.W. Yeh, and W.Y. Fu, “Hybrid Wireless Network Protocols”, IEEE/TVT (2003), pp. 1099-1109.
 
[20]M. Sheng, J. Li and Y. Shi, “Relative Degree Adaptive Flooding Broadcast Algorithm for Ad Hoc Networks”, IEEE/Transactions on Broadcasting (2005), pp. 216-222.
 
[21]N. Saxena, K. Basu and S.K. Das, “Design and Performance Analysis of a Dynamic Hybrid Scheduling Algorithm for Heterogeneous Asymmetric Environments”, IEEE/IPDPS’04 (2004), pp. 223.
 
[22]R. Sakellariou and H. Zhao, “A Hybrid Heuristic for DAG Scheduling on Heterogeneous Systems”, IEEE/IPDPS’04 (2004), pp. 111.
 
[23]Y. Sakurai and J. Katto, “AODV Multipath Extension using Source Route Lists with Optimized Route Establishment”, IEEE/IWWAN’04 (2004), pp. 63-67.
 
[24]M. Tauchi and T. Ideguchi and T. Okuda, “Ad-hoc Routing Protocol Avoiding Route Breaks Based on AODV”, IEEE/HICSS (2005), pp. 322a-322a.
 
[25]S. Tang and B. Zhang, “A Robust AODV Protocol with Local Update”, IEEE/10th dsia-pacific Conference on Communications and 5th International Symposium an Multi-Dimensional Mobile Communications (2004), pp. 418-422.
 
[26]N.C. Wang and S.M. Wang, “An Efficient Location-Aided Routing Protocol for Mobile Ad Hoc Networks”, IEEE/ICPADS’05 (2005), pp. 335-341.
 
[27]S.H. Wang, M.C. Chan, and T.C. Hou, “Zone-based Controlled Flooding in Mobile Ad Hoc Networks”, IEEE/WIRLES’05 (2005), pp. 421-426.
 
[28]X. Wu and V.C.S. Lee, “Preemptive Maximum Stretch Optimization Scheduling for Wireless On-Demand Data Broadcast”, IEEE/IDEAS’04 (2004), pp. 413-418.
 
[29]P. Yi, Z. Dai, Y. Zhong and S. Zhang, “Resisting Flooding Attacks in Ad Hoc Networks”, IEEE/ITCC’05 (2005), pp. 657-662.
 
[30]Z. Yang, Q. Zhang, X. Du and L. Yuan. “Location-based adaptive ad hoc routing (LAAR)”, IEEE/ISCIT’05 (2005), pp. 1013-1017.
 
[31]K. Zheng, N. Wang and A.F. Liu, “A new AODV based clustering routing protocol”, IEEE/WCNM’05 (2005), pp. 728-731.
 
[32]http://140.114.32.181/summer00/12/17/2-2.htm 畢氏定理
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
系統版面圖檔 系統版面圖檔