Adaptive Demand-Driven Routing Protocol in Mobile Ad Hoc Networks

• Main Authors: Yu-Jen Wei, 魏毓仁
• Other Authors: Yung-Cheng Hung
• Format: Others
• Language: zh-TW
• Published: 2005
• Online Access: http://ndltd.ncl.edu.tw/handle/d6w837

碩士 === 東吳大學 === 資訊科學系 === 93 === On-Demand routing protocols provide an efficient solution for packet routing in ad hoc networks, Ad-hoc On-Demand Distance Vector Routing (AODV) and Dynamic Source Routing (DSR) are two prominent routing protocols in this approach. Those protocols, however, are focused on discovery a path from source to destination, and loosed sight of bandwidth consumption and control overhead in route maintenance. When the network topology changes violently, the probability of route failure will increase rapidly, that is we need spend more times to reconstruct failed route for improving route availability. In this paper proposed a routing protocol -- Adaptive Demand-Driven Routing Protocol (ADDR). The protocol is based on Demand-Driven routing, and using control nodes for partitioning routing path, it will be able to provide the ability of segment management in created routing path. Also, this protocol provides an adaptive mechanism to dynamically change the control nodes setting for adapting with the topology violent. For different speed of topology violent, adaptive mechanism still can reduce the cost of path reconstruction in route maintain. As performance analysis, ADDR has gained O(2d/k) in time complexity and O(2n/k) in communication complexity by partitioning routing path to k segments. In addition, ADDR will reduce 19% of packet transmission when the distance of reconstructed radius reducing 10%, and especially, ADDR will reduce 51% of packet transmission when the distance of reconstructed radius reducing 30%, this result reduce a half of communication cost in route reconstruction.