Ad-hoc Routing Protocols

An Ad hoc routing protocol is a convention or standard that controls how nodes come to
agree which way to route packets between computing devices in a mobile ad-hoc network
(MANET).
n ad hoc networks! nodes do not have a priori knowledge o" topology o" network around
them! they have to discover it. The basic idea is that a new node (optionally) announces
its presence and listens to broadcast announcements "rom its neighbours. The node learns
about new near nodes and ways to reach them! and may announce that it can also reach
those nodes. As time goes on! each node knows about all other nodes and one or more
ways how to reach them.
The "ollowing are ad-hoc network routing protocols#
1. Pro-active Routing (Table-driven)
This type o" protocols maintains "resh lists o" destinations and their routes by periodically
distributing routing tables throughout the network. The main disadvantages o" such
algorithms are -
$. %espective amount o" data "or maintenance.
&. 'low reaction on restructuring and "ailures.
2. Reactive Routing (On-demand)
This type o" protocols "inds a route on demand by "looding the network with %oute
%e(uest packets. The main disadvantages o" such algorithms are -
$. )igh latency time in route "inding.
&. E*cessive "looding can lead to network clogging.
3. Flow Oriented Routing
This type o" protocols "inds a route on demand by "ollowing present "lows. +ne option is
to unicast consecutively when "orwarding data while promoting a new link The main
disadvantages o" such algorithms are -
$. Takes long time when e*ploring new routes without a priori knowledge.
&. May re"er to entitative e*isting tra""ic to compensate "or missing knowledge on
routes.
4. Adative Routing (!ituation-Aware)
This type o" protocols combines the advantages o" proactive and o" reactive routing. The
routing is initially established with some proactively prospected routes and then serves
the demand "rom additionally activated nodes through reactive "looding. 'ome metrics
must support the choice o" reaction. The main disadvantages o" such algorithms are ,
$. Advantage depends on amount o" nodes activated.
&. %eaction to tra""ic demand depends on gradient o" tra""ic volume.
". #$brid (Pro-Active%Reactive)
This type o" protocols combines the advantages o" proactive and o" reactive routing. The
routing is initially established with some proactively prospected routes and then serves
the demand "rom additionally activated nodes through reactive "looding. The choice "or
one or the other method re(uires predetermination "or typical cases. The main
disadvantages o" such algorithms are -
$. Advantage depends on amount o" nodes activated.
&. %eaction to tra""ic demand depends on gradient o" tra""ic volume.
&.#ierarc'ical Routing Protocol(
-ith this type o" protocols the choice o" proactive and o" reactive routing depends on the
hierarchic level where a node resides. The routing is initially established with some
proactively prospected routes and then serves the demand "rom additionally activated
nodes through reactive "looding on the lower levels. The choice "or one or the other
method re(uires proper attributation "or respective levels. The main disadvantages o"
such algorithms are -
$. Advantage depends on depth o" nesting and addressing scheme.
&. %eaction to tra""ic demand depends on meshing parameters.
).*eogra'ical Routing Protocol(
This type o" protocols acknowledges the in"luence o" physical distances and distribution
o" nodes to areas as signi"icant to network per"ormance. The main disadvantages o" such
algorithms are -
$. E""iciency depends on balancing the geographic distribution versus occurrence o"
tra""ic.
&. Any dependence o" per"ormance with tra""ic load thwarting the negligence o" distance
may occur in overload.
+. Power Aware Routing Protocol(
Energy re(uired to transmit a signal is appro*imately proportional to d
.
! where d is the
distance and is the Attenuation /actor or path loss e*ponent! which depends on the
transmission medium. -hen . 0 & (which is the optimal case)! transmitting a signal hal"
the distance re(uires one "ourth o" the energy and i" there is a node in the middle willing
spend another "ourth o" its energy "or the second hal"! data would be transmitted "or hal"
o" the energy than through a direct transmission - a "act that "ollows directly "rom the
inverse s(uare law o" physics. The main disadvantages o" such algorithms are -
$. This method induces a delay "or each transmission.
&. No relevance "or energy network powered transmission operated via su""icient repeater
in"rastructure.