1.

Table Working Principle Route establishment(a) and route

maintenance(b)
Advantages Disad

Driven
Protocol
s
Name of the
Protocol
DSDV(Destination Each node The In ord
Sequenced maintains a table availability obtai
Distance Vector) that contains the of routes to infor
shortest distance all abou
and the first node destinations parti
on the shortest at all times desti
path to every implies that node
other node in the much less to wa
network. delay is table
involved in mess
The end node of the route initia
the broken link setup same
initiates a table process. node
update message could
with the broken The stale
link's weight mechanism infor
assigned to of node
infinity (∞) and incremental
with a sequence updates with The u
number greater sequence to br
than the stored number tags lead
sequence number makes the contr
for that existing durin
destination. wired mobi
network smal
Each node, upon protocols with
receiving an adaptable to mobi
update with ad hoc large
weight ∞, quickly wireless with
disseminates it to networks. mobi
its neighbours in
order to Hence, an Even
propagate the existing netw
broken-link wired high
information to the network a larg
whole network. protocol can with
be applied to can c
Thus a single link ad hoc chok
break leads to the wireless avail
propagation of networks band
table update with many
information to the fewer Henc
whole network. modification proto
s. from
 contr
The updates that
are prop
propagated the n
throughout node
the network netw
in order to there
maintain an scala
up-to-date hoc w
view of the netw
network have
topology at band
all the whos
nodes. topol
highl

WRP(Wireless To counter the The The c

Routing count-to-infinity availability of ma
Protocol) problem and to of routes to of mu
enable faster all table
convergence, it destinations a larg
employs a unique at all times and g
method of implies that proce
maintaining much less powe
information delay is node
regarding the involved in hoc w
shortest distance the route netw
to every setup
destination node process. At hi
in the network the c
and the The overh
penultimate hop mechanism invol
node on the path of upda
to every incremental entri
destination node. updates with the s
sequence of DS
It differs from number tags henc
DSDV in table makes the suita
maintenance and existing highl
in the update wired and a
procedures. network large
protocols wirel
WRP uses a set of adaptable to netw
tables to maintain ad hoc
more accurate wireless
information. networks.

The tables that Hence, an

are maintained by existing
a node are the wired
following: distance network
table (DT), routing protocol can
table (RT), link be applied to
 cost table (LCT), ad hoc
and a message wireless
retransmission list networks
(MRL). with many
fewer
modification
s.

It has faster
convergence
and involves
fewer table
updates.
CGSR( Cluster CGSR uses a CGSR is a The m
-Head hierarchical hierarchical disad
Gateway network topology, routing CGSR
Switch unlike other table- scheme incre
Routing driven routing which lengt
Protocol) approaches that enables insta
employ flat partial syste
topologies. coordination mobi
between the r
CGSR organizes nodes by chan
nodes into electing clust
clusters, with cluster- high.
coordination heads.
among the In ord
members of each Hence, gatew
cluster entrusted better confl
to a special node bandwidth resou
named utilization is as ad
clusterhead. possible. inter
requ
This cluster-head It is easy to
is elected implement The p
dynamically by priority cons
employing a least scheduling the c
cluster change schemes node
(LCC) algorithm. with token matt
scheduling conc
According to this and gateway the b
algorithm, a node code drain
ceases to be a scheduling. the c
cluster-head only is hig
if it comes under that
the range of node
another cluster-
head, where the This
tie is broken to fre
either using the chan
lowest ID or clust
highest whic
connectivity in mu
algorithm. break
STAR(Source- It is the variation STAR has The u
Tree Adaptive of table-driven very low LORA
Routing routing protocols, communicati in thi
Protocol) with the least on overhead drive
overhead routing among all proto
approach (LORA) the table- the a
as the key driven contr
concept. routing comp
protocols. seve
With LORA, the dema
routing protocol routi
attempts to proto
provide feasible
paths that are not
guaranteed to be
optimal, but
involve much less
control overhead.
In STAR protocol,
every node
broadcasts its
source tree
information.