Distributed cache updating for the dynamic source routing protocol ppt
So, the update is both time-driven and event-driven.The routing table updates can be sent in two ways:- a "full dump" or an incremental update.When the network is relatively stable, incremental updates are sent to avoid extra traffic and full dump are relatively infrequent.In a fast-changing network, incremental packets can grow big so full dumps will be more frequent. If two routes have the same sequence number then the route with the best metric (i.e. Based on the past history, the stations estimate the settling time of routes.[Back to Table of Contents] In Table-driven routing protocols each node maintains one or more tables containing routing information to every other node in the network.All nodes update these tables so as to maintain a consistent and up-to-date view of the network.The following sections discuss some of the existing table-driven ad hoc routing protocols.The Destination-Sequenced Distance-Vector (DSDV) Routing Algorithm [Perkins94]is based on the idea of the classical Bellman-Ford Routing Algorithm with certain improvements.
The mobile unit can move geographically while it is communicating. In contrast to infrastructure based networks, in ad hoc networks all nodes are mobile and can be connected dynamically in an arbitrary manner.This article discusses proposed routing protocols for these ad hoc networks.