Subject: Adhoc Networks 10CS841

TABLE-DRIVEN ROUTING PROTOCOLS

These protocols are extensions of the wired network routing protocols

They maintain the global topology information in the form of tables at every node.
Tables are updated frequently in order to maintain consistent and accurate network state
information
Ex: Destination sequenced distance vector routing protocol (DSDV), wireless routing protocol
(WRP), source-tree adaptive routing protocol (STAR) and cluster-head gateway switch routing
protocol (CGSR).

Destination sequenced distance-vector routing protocol

It is an enhanced version of the distributed Bellman-Ford algorithm where each node maintains
a table that contains the shortest distance and the 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 for faster convergence.
As it is a table-driven routing protocol, routes to all destinations are readily available at every
node at all times.
The tables are exchanged between neighbors at regular intervals to keep an up-to-date view of
the network topology.
The table updates are of two types:
 Incremental updates: Takes a single network data packet unit (NDPU). These are
used when a node does not observe significant changes in the local topology.
 Full dumps: Takes multiple NDPUs. It is done either when the local topology
changes significantly or when an incremental update requires more than a single
NDPU.
Table updates are initiated by a destination with a new sequence number which is always
greater than the previous one.
Consider the example as shown in figure (a). Here node 1 is the source node and node 15 is the
destination. As all the nodes maintain global topology information, the route is already available as
shown in figure (b).
Here the routing table node 1 indicates that the shortest route to the destination node is
available through node 5 and the distance to it is 4 hops, as depicted in figure (b)
The reconfiguration of a path used by an on-going data transfer session is handled by the
protocol in the following way.
The end node of the broken link initiates a table update message with the broken link’s weight
assigned to infinity (∞) and with a sequence number greater than the stored sequence number for
that destination.
Each node upon receiving an update with weight ∞, quickly disseminates it to its neighbors in
order to propagate the broken-link information to the whole network.
A node always assign an odd number to the link break update to differentiate it from the even
sequence number generated by the destination.
Figure 7.6 shows the case when node 11 moves from its current position.

Navodaya Institute of Technology, Raichur Page 1

Subject: Adhoc Networks 10CS841

Advantages

Navodaya Institute of Technology, Raichur Page 2

Subject: Adhoc Networks 10CS841

Less delay involved in the route setup process.

Mechanism of incremental update with sequence number tags makes the existing wired
network protocols adaptable to ad hoc wireless networks.
The updates are propagated throughout the network in order to maintain an up-to-date view of
the network topology at all nodes.

Disadvantages
The updates due to broken links lead to a heavy control overhead during high mobility.
Even a small network with high mobility or a large network with low mobility can completely
choke the available bandwidth.
Suffers from excessive control overhead.
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 state routing information at nodes.

Wireless Routing Protocol (WRP)

WRP is similar to DSDV; it inherits the properties of the distributed bellman-ford algorithm.
To counter the count-to-infinity problem and to enable faster convergence, it employs a unique
method of maintaining information regarding the shortest distance to every destination node in the
network and penultimate hop node on the path to every destination node.
Maintains an up-to-date view of the network, every node has a readily available route to every
destination node in the network.
It differs from DSDV in table maintenance and in the update procedures.
While DSDV maintains only one topology table, WRP uses a set of tables to maintain more
accurate information.
The table that are maintained by a node are :
 Distance table (DT): contains the network view of the neighbors of a node. It
contains a matrix where each element contains the distance and the penultimate
node reported by the neighbor for a particular destination.
 Routing table (RT): contains the up-to-date view of the network for all known
destinations. It keeps the shortest distance, the predecessor/penultimate node, the
successor node, and a flag indicating the status of the path. The path status may be a
simplest (correct) path or a loop (error), or destination node not marked (null).
 Link cost table (LCT): contains the cost of relaying messages through each link. The
cost of broken link is ∞.it also contains the number of update periods passed since
the last successful update was received from that link.
 Message retransmission list (MRL): contains an entry for every update message that
is to be retransmitted and maintains a counter for each entry.
After receiving the update message, a node not only updates the distance for transmitted
neighbors but also checks the other neighbors’ distance, hence convergence is much faster than
DSDV.
Consider the example shown in figure below, where the source of the route is node 1 and
destination is node 15. As WRP proactively maintains the route to all destinations, the route to any
destination node is readily available at the source node.
From the routing table shown, the route from node 1 to node 15 has the next node as node 2.
The predecessor node of 15 corresponding to this route is route 12. The predecessor information
helps WRP to converge quickly during link breaks.

Navodaya Institute of Technology, Raichur Page 3

Subject: Adhoc Networks 10CS841

Navodaya Institute of Technology, Raichur Page 4

Subject: Adhoc Networks 10CS841

When a node detects a link break; it sends an update message to its neighbors with the link cost
of the broken link set to ∞. After receiving the update message; all affected nodes update their
minimum distances to the corresponding nodes. The node that initiated the update message then
finds an alternative route, if available from its DT. Figure 7.8 shows route maintenance in WRP.
Advantages 
WRP has the same advantages as that of DSDV.
It has faster convergence and involves fewer table updates.
Disadvantages 
The complexity of maintenance of multiple tables demands a larger memory and greater
processing power from nodes in the Adhoc wireless network.
It is not suitable for highly dynamic and also for very large ad hoc wireless networks.

Cluster-Head Gateway Switch Routing Protocol (CGSR)

Uses a hierarchical network topology.
CGSR organizes nodes into clusters, with coordination among the members of each cluster
entrusted to a special node named cluster-head.
This cluster-head is elected dynamically by employing a least cluster change (LCC) algorithm.
According to this algorithm, a node ceases to be a cluster-head only if it comes under the range
of another cluster-head, where the tie is broken either using the lowest ID or highest connectivity
algorithm.
Clustering provides a mechanism to allocate bandwidth, which is a limited resource, among
different clusters, thereby improving reuse.
A token-based scheduling is used within a cluster for sharing the bandwidth among the
members of the cluster.
CGRS assumes that all communication passes through the cluster-head. Communication
between 2 clusters takes place through the common member nodes that are members of both the
cluster are called gateways.
A gateway is expected to be able to listen to multiple spreading codes that are currently in
operation in the clusters in which the node exist as a member.
A gateway conflict is said to occur when a cluster-head issues a token to a gateway over
spreading code while the gateway is tuned to another code.
Gateways that are capable of simultaneously communicating over two interfaces can avoid
gateway conflicts.
The performance of routing is influenced by token scheduling and code scheduling that is
handled at cluster-heads and gateways, respectively.
Every member node maintains a routing table containing the destination cluster-head for every
node in the network.
In addition to the cluster member table, each node maintains a routing table which keeps the list
of next-hop nodes for reaching every destination cluster.
The cluster routing protocol is used here.
Figure below shows the cluster head, cluster gateways, and normal cluster member nodes in an
ad hoc wireless network.

Navodaya Institute of Technology, Raichur Page 5

Subject: Adhoc Networks 10CS841

Advantages
CGSR is a hierarchical routing scheme which enables partial coordination between nodes by
electing cluster-heads.
Easy to implement priority scheduling schemes with token scheduling and gateway code
scheduling.
Disadvantages
Increase in path length and instability in the system at high mobility when the rate of change of
cluster-head is high.
In order to avoid gateway conflicts, more resources are required.
The power consumption at the cluster-head node is also a matter of concern.
Lead to Frequent changes in the cluster-head, which may result in multiple path breaks.

Source-Tree Adaptive Routing Protocol (STAR)

Key concept least overhead routing approach (LORA)
This protocol attempts to provide feasible paths that are not guaranteed to be optimal
Involves much less control overhead
In STAR protocol, every node broadcasts its source tree information
The source tree of a node consists of the wireless links used by the node
Every node builds a partial graph of the topology
During initialization, a node sends an update message to its neighbors
Each node will have a path to every destination node

Navodaya Institute of Technology, Raichur Page 6

Subject: Adhoc Networks 10CS841


The path would be sub-optimal
The data packet contains information about the path to be traversed in order to prevent the
possibility of routing loop formation
In the presence of a reliable broadcast mechanism, STAR assumes implicit route maintenance
In addition to path breaks, the intermediate nodes are responsible for handling the routing
loops
The RouteRepair packet contains the complete source tree of node k and the traversed path of
the packet
When an intermediate node receives a RouteRepair update message, it removes itself from the
top of the route repair path and reliably sends it to the head of the route repair path
Advantages
Very low communication overhead
Reduces the average control overhead

Navodaya Institute of Technology, Raichur Page 7