抽象的な

PERFORMANCE ANALYSIS OF DYNAMIC ROUTING PROTOCOL IN MOBILE AD HOC NETWORK

Nikhil Patearia

Mobile ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Due of the limited transmission range of wireless network, multiple "hops" are needed to exchange data across the network. Routing protocols used in ad hoc networks must automatically adjust to environments that can vary between the extremes of high mobility with low bandwidth, and low mobility with high bandwidth. This paper argues that such protocols must operate in an on-demand fashion and that they must carefully limit the number of nodes required to react to a given topology change in the network. I have embodied these two principles in a routing protocol called Dynamic Source Routing. As a result of its unique design, the protocol adapts quickly to routing changes when node movement is frequent, yet requires little or no overhead during periods in which nodes move less frequently. This paper generalizes the lessons learned from Dynamic Source Routing, so that we can be applied to the new routing protocols that have adopted the basic Dynamic Source Routing framework. The paper proves practicality of the Dynamic Source Routing protocol through performance results, and it demonstrates several methodologies for experimenting with protocols and applications in an ad hoc network environment.