Routing

Protocols
in Ad Hoc Wireless Network
ocol

switch routing protoce

Cluster-head gatcway
Fisheye state routing Routing
Vector
Distance

4.4.1 Destination S e q u e n c e d protocol is one

one of
of thep
th

Vector (DSDV) routing

Destination Scquen
u n a t i o n Sequcnced
Distance
DSDV,
cach keeps record
nooe

protocols of ad hoc network.

In
the following
informmati TOute
Proactive routing Each table
contains
n in the fom ofrouting table.
I D of destination node
Details of next hop
Metric
Sequence number

Time-to-live parameter number of

destination node, number of t
list of ID of hops
Each route broadcast message includes the
node, nexthop, recent sequence number and metrio
required to reach the destination
updated routing table with each other. Updates in the
parameter. Each node exchanges its
routing table can be sent to other nodes in two ways
Full dumpupdate
.Incremental update
In full dump update method, a node sends the whole routing table to the neighbors and
thereby increases network overhead. In incremental update method, only the recent updated
entries are sent. The incremental update method is more suitable when the network is large
and stable so that heavy traffic can be avoided.
Table Maintenance in DSDV
The steps followed for maintaining a routing table at each node is given below.

Each node receives the route information with most recent sequence number from other
nodes and updates its table.
The node looks at its routing table in order to determine
the shortest path to reach all the
destinations.
According to the shortest path information, each node constructs another
where the node has recently routing ta0
updated route information to reach destination with
distance. minimu
This new routing table will be broadcast to
its neighbors.
.On receipt of these messages, the
neighbor nodes update its routing table.
 Routing Protocols in Ad Hoc Wireless
Networks
chows the network topologY to depict DSDV protocol

----

Fig. 4.4.1 Network topology in DSDV.

between nodes are shown

connectivity using wireless links. The routing
igure, the
the figure,
e
ntained at node A is shown in Table 4.4.1.
maintained

Table 44.1 Routing Table at Node A

Destination Next Hop Metrix Sequence No

B B 342
C C 168

D B 2 121

E C 2 24
with
destination for node A, then node A can directly transmit the packet
tf node B is the it
if node A wants packet to node E, then
to transmit a
and next hop is node B. But,
wtric 1 in the visibility of node
table. In this case, the node E is not
metric

an find
the route from the routing with metric 2.
be transmitted through the next hop C
A.Therefore, the packet
can

Maintaining Metric Field

its position from time to
all the nodes are moving and relocate
In ad hoc wireless network, table update
each node will broadcast a routing
ime. When topology changes dynamically table update
field in the routing
The procedure for updating metric
packet to its neighbors.
pecket is given below.
starts with a metric of one.
he routing table update packet
it will increment this metric by one and
receive this packet,
When the neighbor nodes
to its neighbors.
then re-broadcast the updated packet
nodes in the network
receive the copy ofupdate
until all the
1nis process will be repeated
message. with smallest metric
packet, then the update packet
Whe node receives more than one
"en a will be 1gnored.
ensure the shortest path. Other packets
will be considered to

d Hoc and Sensor Networks

 Routing Protocolsin Ad Hoc Wireless letworks
Significance of Sequence Number
When a node broadcasts a it has to increase thesequeke
routing table update packet,
number by one. This is used to find out the updated route packet. When a node receives a
pdate packet from its neighbor node and if the sequence number is equal to or greatertha
the sequence number of already received packet, then the routing packet will be updated in te
table. Else, the received packet will be assumed as a stale or old packet and hencediscarded