Reliable local recovery routing protocol with clustering coefficient for ad hoc networks

機構典藏 > College of Engineering > Graduate Institute & Department of Computer Science and Information Engineering > Thesis > Item 987654321/87965

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/87965

Title:	Reliable local recovery routing protocol with clustering coefficient for ad hoc networks
Other Titles:	無線隨意網路中以叢集度為考量之可靠繞徑協定
Authors:	姚成翰;Yao, Chen-Han
Contributors:	淡江大學資訊工程學系博士班蔡憶佳
Keywords:	叢集度;無線隨意網路;局部復原;需求導向繞徑協定;複雜網路;clustering coefficient;Wireless Mobile Ad Hoc Network;Local Recovery;On-demand Routing Protocol;complex network
Date:	2012
Issue Date:	2013-04-13 11:54:23 (UTC+8)
Abstract:	在無線隨意網路中，當裝置要傳送資料時，必須利用在通訊範圍內的鄰居節點將資料一步一步代傳至目的節點。傳統的繞徑協定通常利用封包廣播的方式來尋找傳送路徑，網路拓墣變動容易造成傳送路徑失效。當傳送路徑失效時，來源節點會重新尋找新的傳送路徑；頻繁的路徑失效導致不斷的重新尋找傳送路徑會造成大量的資源消耗。不論網路拓樸如何變動，有效率的繞徑協定必須快速且正確的將資料傳送至目的節點並同時減少資源消耗。因此在本篇論文中我們提出兩個以叢集度為考量並具備局部復原能力的繞徑協定：(一) 以叢集度為考量之局部復原繞徑協定，(二)以可靠性及叢集度為考量之局部復原繞徑協定。方法一依據路徑叢集度總和選擇傳送路徑，當路徑失效時，節點快速的利用其他最短路徑或周邊鄰居節點將資料繼續傳送至目的節點。方法二依據連線穩定度及節點叢集度選擇傳送路徑，此方法可選擇較穩定的連線路徑，減少路徑失效發生的頻率；同時利用局部復原方法快速修復失效路徑。實驗結果顯示本論文所提出的兩個繞徑協定皆可以有效地減少當路徑失效時重新尋找路徑的資源消耗，並同時可以提升資料成功傳送的送達率。 Nodes in mobile ad hoc network communicate with each other through wireless multi-hop links. When a node wants to send data to another node, it uses some routing protocol to find the path. In on-demand routing protocols, the source starts a route discovery to find the route leading to the destination. Route discovery is typically performed via flooding, which consumes a lot of control packets. Because of node mobility, the network topology change frequently and cause the route broken. Traditional routing protocols restart a route discovery when link failure. In this thesis, we propose two on-demand local recovery routing protocols based on clustering coefficient, (I) "Local Path Recovery Routing Protocol based on Clustering Coefficient "(LPRCC), (II) "Reliable Local Recovery Routing Protocol based on Clustering Coefficient"(RLRCC). Our first protocol LPRCC use route clustering coefficient to choose routing path. When link failure occurs, nodes can quickly salvage the data without starting another route discovery. Our second protocol RLRCC choose a route with higher route score, route score is calculated by link stable value and node triangle value. RLRCC can decrease the number of route failure occur and also can reduce the route discovery times. Simulation results show both of our protocols can decrease the number of control packets and increase route delivery ratio.
Appears in Collections:	[Graduate Institute & Department of Computer Science and Information Engineering] Thesis

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	183	View/Open

Loading...