標題: 基於可調動區域之無線隨意網路路由演算法
Adaptive Zone Routing Algorithm for Ad-hoc Networks
作者: 賴鈺婷
Lai, Yu-Ting
黃育綸
Huang, Yu-Lun
電控工程研究所
關鍵字: 無線隨意網路;區域路由演算法;Ad-hoc network;ZRP;DNLBR;AODV
公開日期: 2012
摘要: 無線隨意網路是由多個擁有無線裝置且可以任意移動的節點所組成。此類型網路不需要依賴既有的公共建設或是中心控制系統,如:無線網路基地台。 在封包傳送的方面,無線隨意網路需要透過節點與節點間的合作才能成功傳送封包。 網路中的每個節點可作為中繼點,將封包轉送給其他節點以達到路由的效果。 現今已開發多種無線隨意網路通訊協定,如 ZRP。 ZRP 中每個節點利用區域(zone)的概念先找出周圍的網路拓樸結構,根據各個區域所提供的拓樸資訊,可以提高網路封包傳送的效能。本論文基於區域路由協定提出一個可動態更改區域大小的方法。 此外,本論文也考慮到了電量消耗的問題。我們發現透過選擇最大剩餘電量之路由路徑,可以延長整個網路的生命週期。 最後,透過一些模擬實驗,我們比較ZRP與所提方法的封包傳送延遲時間及電量消耗。 實驗的結果顯示,處理拓樸變化小的網路時,本論文所提的方法,可以降低封包傳送延遲時間,相較於ZRP,則有34.68倍的傳輸延遲改善。而中繼節點電量消耗部分也較ZRP來得平均。
An ad-hoc network, constructed by a set of mobile nodes, is a decentralized small wireless network and does not require any infrastructure or the central control systems. Each mobile node in this network can either send/receive messages or help relay messages in between. This has brought up a need of an efficient routing protocol which can route packets between mobile nodes. Zone Routing Protocol (ZRP), as one of the ad-hoc routing protocols, creates a topological map of a zone for routing packets, such that the whole ad-hoc network can benefit from the local topology information of the entire zone. In this thesis, we propose a ZRP-based routing protocol to dynamically adjust the zone size by the node mobility while reducing the overall routing cost of an ad-hoc network. We also consider the residual energy of each node on a routing path and select the path with maximum residual energy to increase the network lifetime. Through some simulations, we compare the proposed protocol with ZRP in terms of message delivery latency and energy consumption. The results show that our protocol has improved the latency by a factor of 34.68 for a low-mobility network. In addition, our protocol can consume energy more evenly on every relay node than ZRP.
URI: http://140.113.39.130/cdrfb3/record/nctu/#GT079912545
http://hdl.handle.net/11536/49246
Appears in Collections:Thesis