25-09-2014, 12:40 PM
A Comparitive Study of Reactive Protocols
[attachment=68521]
INTRODUCTION
A Mobile Ad-hoc Network (MANET) is a collection of self-organized wireless mobile
nodes dynamically forming a temporary network without the aid of any fixed infrastructure and
centralized administration control stations. A node can move anytime in an ad hoc scenario and,
thus a routing protocol is needed which can adapt to the dynamically changing wireless topology.
However, since there is no fixed infrastructure in this network, each mobile node operates not only
as a node but also as a router forwarding packets from one node to other mobile nodes in the
network that are outside the range of the sender. Routing, as an act of transporting information
from a source to a destination through intermediate nodes, is a fundamental issue for networks.
MANETs have many applications: they can be used in military communication and
operations, in search and rescue operations, in commercial and civilian environments, in home and
enterprise networks, in entertainment, in sensor networks, in context aware services and in
education. MANETs are a kind of Wireless ad hoc network that usually has a routable networking
environment on top of a Link Layer ad hoc network.
The growth of laptops and 802.11/Wi-Fi wireless networking have made MANETs a
popular research topic since the mid-1990s. Many academic papers evaluate protocols and their
abilities, assuming varying degrees of mobility within a bounded space, usually with all nodes
within a few hops of each other. Different protocols are then evaluated based on measures such as
the packet drop rate, the overhead introduced by the routing protocol, end-to-end packet delays,
network throughput etc. MANET share several salient characteristics. 1) Dynamic topologies 2)
Bandwidth constrained links 3) Energy con strained operation 4) Limited physical security.
Several protocols have been proposed for MANETs. In this paper we focus on the operation
of the two of the most popular routing protocols which are: the Ad-Hoc On Demand Distance
Vector Routing (AODV) and the Destination-Sequenced Distance Vector (DSDV). As a tool in
our work we use the Network Simulator 2 (NS-2) which is an open source freeware software which
has become a popular tool for modeling networks at many universities and academic communities.
This paper attempts to compare the two most popular routing protocols mentioned above by
constructing simple simulation scenarios
PROACTIVE ROUTING PROTOCOLS
Proactive routing protocols will try to maintain correct routing information on all nodes in
the network at all times. This can be achieved in different ways, and thus divides the protocols into
two subclasses: Event driven and Regular updated protocols.
Event driven protocols will not send any routing update packets, if no change in topology
occurs. Only if a node detects a change of the topology (usually a node moves out of reach of this
node, or a new node comes close enough), this is reported to other nodes, according to the strategy
of the routing protocol. Protocols that are updated in regular intervals will always send their
topology information to other nodes at regular intervals. Many link state protocols work in such a
manner (but varying the maximum distance of an update message with the length of the interval).
Nodes farther away get updates less frequently than close nodes, thus balancing the load imposed
on the network.
Proactive protocols of either subclass impose a fixed overhead to maintain the routing
tables. Even if many of the entries are not used at all. Their advantage is, that the routes can be
used at once and there is no setup delay
REACTIVE ROUTING PROTOCOLS
A network using an on-demand protocol will not maintain correct routing information on
all nodes for all times. Instead, such routing information is obtained on demand. If a node wants
to transmit a message, and does not have enough routing information to send the message to the
destination, the required information has to be obtained. Usually the node needs at least to know
the next hop (among its neighbors) for the packet. Although the node could just broadcast the
PROJECT DESCRIPTION
Several protocols have been proposed for MANETs. In this paper we focus on the operation of the
two of the most popular routing protocols which are: the Ad-Hoc On Demand Distance Vector
Routing (AODV) and the Destination-Sequenced Distance Vector (DSDV). As a tool in our work
we use the Network Simulator 2 (NS-2) which is an open source freeware software which has
become a popular tool for modeling networks at many universities and academic communities.
This paper attempts to compare the two most popular routing protocols mentioned above by
constructing simple simulation scenarios.
PROJECT DESCRIPTION
Several protocols have been proposed for MANETs. In this paper we focus on the operation of the
two of the most popular routing protocols which are: the Ad-Hoc On Demand Distance Vector
Routing (AODV) and the Destination-Sequenced Distance Vector (DSDV). As a tool in our work
we use the Network Simulator 2 (NS-2) which is an open source freeware software which has
become a popular tool for modeling networks at many universities and academic communities.
This paper attempts to compare the two most popular routing protocols mentioned above by
constructing simple simulation scenarios.
[attachment=68521]
INTRODUCTION
A Mobile Ad-hoc Network (MANET) is a collection of self-organized wireless mobile
nodes dynamically forming a temporary network without the aid of any fixed infrastructure and
centralized administration control stations. A node can move anytime in an ad hoc scenario and,
thus a routing protocol is needed which can adapt to the dynamically changing wireless topology.
However, since there is no fixed infrastructure in this network, each mobile node operates not only
as a node but also as a router forwarding packets from one node to other mobile nodes in the
network that are outside the range of the sender. Routing, as an act of transporting information
from a source to a destination through intermediate nodes, is a fundamental issue for networks.
MANETs have many applications: they can be used in military communication and
operations, in search and rescue operations, in commercial and civilian environments, in home and
enterprise networks, in entertainment, in sensor networks, in context aware services and in
education. MANETs are a kind of Wireless ad hoc network that usually has a routable networking
environment on top of a Link Layer ad hoc network.
The growth of laptops and 802.11/Wi-Fi wireless networking have made MANETs a
popular research topic since the mid-1990s. Many academic papers evaluate protocols and their
abilities, assuming varying degrees of mobility within a bounded space, usually with all nodes
within a few hops of each other. Different protocols are then evaluated based on measures such as
the packet drop rate, the overhead introduced by the routing protocol, end-to-end packet delays,
network throughput etc. MANET share several salient characteristics. 1) Dynamic topologies 2)
Bandwidth constrained links 3) Energy con strained operation 4) Limited physical security.
Several protocols have been proposed for MANETs. In this paper we focus on the operation
of the two of the most popular routing protocols which are: the Ad-Hoc On Demand Distance
Vector Routing (AODV) and the Destination-Sequenced Distance Vector (DSDV). As a tool in
our work we use the Network Simulator 2 (NS-2) which is an open source freeware software which
has become a popular tool for modeling networks at many universities and academic communities.
This paper attempts to compare the two most popular routing protocols mentioned above by
constructing simple simulation scenarios
PROACTIVE ROUTING PROTOCOLS
Proactive routing protocols will try to maintain correct routing information on all nodes in
the network at all times. This can be achieved in different ways, and thus divides the protocols into
two subclasses: Event driven and Regular updated protocols.
Event driven protocols will not send any routing update packets, if no change in topology
occurs. Only if a node detects a change of the topology (usually a node moves out of reach of this
node, or a new node comes close enough), this is reported to other nodes, according to the strategy
of the routing protocol. Protocols that are updated in regular intervals will always send their
topology information to other nodes at regular intervals. Many link state protocols work in such a
manner (but varying the maximum distance of an update message with the length of the interval).
Nodes farther away get updates less frequently than close nodes, thus balancing the load imposed
on the network.
Proactive protocols of either subclass impose a fixed overhead to maintain the routing
tables. Even if many of the entries are not used at all. Their advantage is, that the routes can be
used at once and there is no setup delay
REACTIVE ROUTING PROTOCOLS
A network using an on-demand protocol will not maintain correct routing information on
all nodes for all times. Instead, such routing information is obtained on demand. If a node wants
to transmit a message, and does not have enough routing information to send the message to the
destination, the required information has to be obtained. Usually the node needs at least to know
the next hop (among its neighbors) for the packet. Although the node could just broadcast the
PROJECT DESCRIPTION
Several protocols have been proposed for MANETs. In this paper we focus on the operation of the
two of the most popular routing protocols which are: the Ad-Hoc On Demand Distance Vector
Routing (AODV) and the Destination-Sequenced Distance Vector (DSDV). As a tool in our work
we use the Network Simulator 2 (NS-2) which is an open source freeware software which has
become a popular tool for modeling networks at many universities and academic communities.
This paper attempts to compare the two most popular routing protocols mentioned above by
constructing simple simulation scenarios.
PROJECT DESCRIPTION
Several protocols have been proposed for MANETs. In this paper we focus on the operation of the
two of the most popular routing protocols which are: the Ad-Hoc On Demand Distance Vector
Routing (AODV) and the Destination-Sequenced Distance Vector (DSDV). As a tool in our work
we use the Network Simulator 2 (NS-2) which is an open source freeware software which has
become a popular tool for modeling networks at many universities and academic communities.
This paper attempts to compare the two most popular routing protocols mentioned above by
constructing simple simulation scenarios.