Difference Between

Reactive Routing Location Added Routing

In this protocols, a node initiates a It attempts to reduce the routing
route discovery process throughout the overheads present in the traditional
network only when it wants to send flooding algorithm by using location
packets to its destination. information
Once a route has been established, it is This protocol assumes that each node
maintained by a route maintenance knows its location through a Global
process until either the destination Positioning System (GPS).
becomes inaccessible along every path
from the source or the route is no
longer desired.
Reactive Routing Protocol (RRP) is a Routes between two hosts in a Mobile
bandwidth-efficient on-demand routing Ad hoc Network (MANETS)
protocol for MANETs.
Some reactive protocols are Ad hoc LAR designs two regions
On-Demand Distance Vector (AODV), Expected zone and Request zone
Dynamic Source Routing (DSR),
Temporally Ordered Routing
Algorithm (TORA),
AssociativityBased Routing (ABR),
AODV
The routing is “on demand”, a route is
only traced when a source node wants
to establish communication with a
specific destination node. The route
remains established as long as it is
needed for next communication.
AODV responds very quickly to all
the topological changes which affect
the active routes, since it is adaptive to
highly dynamic networks.
AODV is loop free, self-starting and
scales to a large number of mobile
nodes.
The best example for this is the routing
information protocol (RREP).
AODV is a Reactive routing protocol
Standard distance vector algorithm
Every node maintains a routing table
and it contains all available
destinations details, the next node to
reach to destination, the number of
hops to reach the destination.
It is simpler to configure and
maintain than link state routing.
DV not suited for ad-hoc networks
because of Loops & Count to Infinity.
The best example for this is the routing
information protocol (RIP).
This is included in proactive routing
protocol
sensor networks
computer network consisting of
spatially distributed autonomous
devices using sensors to cooperatively
monitor physical or environmental
conditions, such as temperature, sound,
vibration, pressure, motion or
pollutants, at different locations.
Sensor nodes mainly use broadcast
communication paradigm whereas
Query processing: Most queries in this
network are continuous and multiple
queries may be executed at the same
time.
Data placement: Data placement is
used to implement in-network data
aggregation.
Data security: Data has to be protected
especially against tampering
Timeliness: Timeliness of data is an
important aspect, since late information control is used for the coordination of
is usually of lower value.
Peer to peer network
A network without the notion of clients
or servers, but only equal peer nodes
that simultaneously function as both
clients and servers.
Point-to-point communications.
Query processing: Most queries are
issued during initialization and setup
situations, but also, for obtaining
information about the state of an entity
Data placement: Data is placed in
distributed data structures, such as hash
tables.
Data security: Security depends on the
specific application and is often
important for accounting.
Transactional control: Transactional
actions.
 Applications of Sensor Network Applications of P2P

 Military Applications  Content delivery

 Health Applications  File-sharing networks
 Environmental Applications  Copyright infringements
 Home Applications
 Commercial Applications  Multimedia
 Area monitoring  Torrent Sharing
 Health care monitoring
 Environmental/Earth sensings
 Air pollution monitoring