Adaptive Zone Routing Algorithm for Ad-hoc Networks

碩士 === 國立交通大學 === 電控工程研究所 === 101 === 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...

Full description

Bibliographic Details
Main Authors: Lai, Yu-Ting, 賴鈺婷
Other Authors: Huang, Yu-Lun
Format: Others
Language:en_US
Published: 2012
Online Access:http://ndltd.ncl.edu.tw/handle/t78jkp
Description
Summary:碩士 === 國立交通大學 === 電控工程研究所 === 101 === 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.