Scribd
Upload
12 views

Proactive or Table Driven Routing Protocol

project of routing

Uploaded by

diyide4473
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
12 views

Proactive or Table Driven Routing Protocol

project of routing

Uploaded by

diyide4473
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16

Proactive or table driven Routing

Protocol
• Maintain the global topology information in the
form of tables at every node.
• These tables are updated frequently in order to
maintain consistent and accurate network state
information.
Examples of table driven routing
Protocol
• Destination sequenced distance-vector routing
protocol (DSDV)
• Wireless routing protocol (WRP)
• Source-tree adaptive routing protocol (STAR)
• Cluster-head Gateway Switch routing protocol
(CGSR)
DSDV

• First protocols proposed for adhoc wireless


network.
• Enhanced version of Bellman-ford algorithm.
Routing Table information

• Each node maintains a table that contains the


shortest distance and first node on the shortest
path to every other node in the network.
• It incorporates table updates with increasing
sequence number tags to prevent loops, to
counter the count to infinity problem and faster
convergence.
Exchange of table

• Routes to all destinations are readily available at


every node at all times.
• Tables are exchanged between Neighbors at
regular intervals to keep an up-to-date view of
the network topology.
• Tables are also forwarded if a node observes a
significant change in local topology.
Table updates
Table updates are of two types :
1. Incremental updates
2. Full dumps
• Incremental updates takes a single network data packet
unit.
• Incremental updates takes a single network data packet
unit are used when a node does not observe significant
changes in the local topology.
Full dumps:
• Full dumps may take multiple NDPU.
• It is done either when the local topology changes
significantly (or) when an incremental updates requires
more than a single NDPU.
• Table updates are initiated by Destination with a new
sequence number always greater than the previous.
Node function after table update

• Upon receiving an updated table, node either


updates its tables based on the receiving
information or holds it for some time to select
best metric.
• Based on the sequence number of the table
update, it may forward or reject the table.
Finding the route by node using routing
table
• Here node1 is the source node and node15 is the
destination.
• All nodes maintain global topology in formation.
• The routing table of node1 indicates that the
Shortest route to the destination node is
available through node 5 and the distance to its
is 4 hops.
Route Establishment in DSDV
Reconfiguration of path

• If the links broken in the finding path means, the


end node of the broken link initiates a table
update message with the broken link’s weight
assigned to infinity and with the sequence umber
greater than the stored sequence number for
that destination.
• Each node upon receiving an update with weight
infinity, quickly disseminates it to its neighbors in
order to propagate the broken link information to
the whole network.
•A single link break leads to the propagation of table
update information to the propagation of table
update information to the whole network.

•A node always assigns an odd sequence number to


the link break update to differentiate it from the even
sequence number generated by the destination.
Route Maintenance in DSDV
Example

• Consider the case When node 11 moves from its


current position to new position.
• When a neighbor node perceives the link break, it
sets all the paths passing through the broken
links with distance as infinity.
• Fr example when node 10 knows about the link
break, it sets the path to node 11 as infinity and
broadcasts its routing table to its neighbors.
• These neighbors detecting significant changes in
their routing table rebroadcast it to their neighbors.
•In this way the broken link in formation propagates
throughout the network .
•Node 1 also sets the distance to node 11 as infinity.
•When node 14 receives a table update information
from node 11, it informs the neighbors about the
shortest distance to node 11.
•This information is also prepated throughout the
network.
•All needs receiving the new update message with
the higher sequence number set the new distance
to node 11 in their corresponding tables.
•The updated table at node 1, where the current
distance from node 1 to node 11 has increased from
3 to 4 hops.
Advantages of DSDV

• Less delay – The availability of routes to all


times is involved in the route setup process.
• Adaptable: The mechanism of incremental
updates with sequence number tags makes the
existing wired network protocols adaptable to
adhoc wireless network .
• Maintain network topology: The updates are
propagated throughout the network in order to
maintain up-to-date view of the network topology.
Disadvantages of DSDV

• Heavy control overhead: The updates due to


broken links lead to heavy control overhead during
high mobility.
• Hence this protocol suffer from excessive control
overhead (ie) proportional to the number of nodes in
the network.
• Delay: In order to obtain information about a
particular destination node, a node has to wait for a
table update message initiated by the same
destination node.
• This delay could result in stale routing informations at
nodes.

You might also like