Modeling and Simulation of Dynamic Intermediate Nodes and Performance Analysis in MANETS Reactive Routing Protocols

International Journal International Journal International Journal International Journal of of of of Grid and Distributed Computing Grid and Distributed
ted Computing Grid and Distributed Computing Grid and Distributed Computing
Vol. 4 Vol. 4 Vol. 4 Vol. 4, ,, , No. 1, March No. 1, March No. 1, March No. 1, March 2011 2011 2011 2011

31

Modeling and Simulation Of Dynamic Intermediate Nodes And
Performance Analysis in MANETS Reactive Routing protocols

Jahangir khan
, Dr.syed Irfan Hyder
, Dr.Syed Malek Fakar Duani syed Mustafa

School of Information & communication Technology

Asia e University, No. 4, Jalan Sultan Sulaiman, 50000 Kuala Lumpur, Malaysia.
Graduate School of science & Engineering

PAF-KIET, PAF Base Korangi Creek karachi75190 pakistan
jahangirkhanpaf@yahoo.com
, syed@pafkiet.edu.pk
, syed.malek@aeu.edu.my

Abstract
Loads of research work and efforts have been done since last decade to provide
support and solution to different problems and challenges related to mobile ad hoc networks.
But still the fast growing technology needs attention in many areas such as routing,
bandwidth, security, power consumption, collisions, simulations, and topology control due to
moving nodes. In mobile ad hoc network we cannot use the existing techniques for better
quality as we are using in fixed wireless network for better efficiency. In this paper we not
only compare the performance of ad-hoc routing protocols in order to prove its correctness,
efficiency, traffic load and end to end delay in dynamic intermediate nodes senario but also
to implement OPNET simulator in AODV and DSR routing protocols. we proposed OPNET
simulator to check performance with respect to different parameters that mobility model
changes have a significant impact on their performance in different ways to support QOS.
By proposing OPNET which results the combined performance of both AODV and DSR
routing protocol could be best solution for routing in MANET, instead of separate
performance of both AODV and DSR and also in intermediate nodes data transfer rate from
source to destination.

Keywords: performance comparision , Mobility, Reactive protocols,
MANET,OPNET .

1. Introduction

In modern world wireless communication technology, mobile computers are using
very increasingly in many areas for different activities. Mobile Ad hoc Networks or peer to
peer networks are an old concept defined in modified form by the invention of wireless
technologies like Bluetooth and Wi-Fi etc. Mobile Ad hoc Networks (MANETS) are dynamic
independent networks consists of mobile nodes. Such networks represent a fully mobile
infrastructure due to the wireless communication between nodes. Mobile Ad hoc Network can
be created and used at any time, any where without any pre-existing base station
infrastructure and central administration. The nodes in the network are used to provide
connectivity and services, i.e. the nodes communicate directly with one another in peer-to-
peer fashion. MANETS are used in applications such as disaster recovery, conferences,
lectures, emergency situation in hospitals, meetings, crowd control, and battle fields. In such
International Journal International Journal International Journal International Journal of of of of Grid and Distributed Computing Grid and Distributed Computing Grid and Distributed Computing Grid and Distributed Computing

32

applications there is no need for central administration or fax infrastructure. The only way to
add or delete nodes in Mobile Ad hoc Network is by interaction with other nodes [3].
In the fast world of growing technology the advancement in computers and mobile wireless
communication technology have increasingly used applications in every area of life. Most of
the technology operates in the traditional Internet Protocol (IP) suite. In the competition of
this modern technology the aim of Mobile Ad Hoc networking is to provide efficient
communication in wireless technology by adopting routing functionality in mobile nodes. The
main aim behind the developing of ad hoc networking is multi-hop relaying. Wireless Ad hoc
networks or infrastructure less networks are very easy to establish by using radio waves as
transmitting medium without the requirements of any other equipment or infrastructure. In
such a network mobile nodes can be moved and organized freely in an arbitrary way. This
dynamic connectivity of nodes allow mobile ad hoc network to be organized any where any
time. The development in computer equipments and the commercial arrival of laptop
computers and other enhancements in mobile technology during 1990s gave birth to third
generation of Ad hoc networks. The researchers proposed the idea of a collection of mobile
nodes in ad hoc network. Mobile Ad hoc network working group was formed by Internet
Engineering Task Force (IETF) in mid 1990s to standardized routing protocols for the newly
adopted technology as well as by IEEE 802.11 for wireless networks. Mobile Ad hoc working
group proposed reactive and proactive routing protocols for MANETS [12].The objective of
this work is to evaluate the performance of intermediate nodes as well as source to destination
of two routing protocols based on On-demand behavior, namely, Ad hoc Demand Distance
vector (AODV) and Dynamic Source Routing (DSR), for wireless ad hoc networks based on
performance of intermediate nodes for the delivery of data form source to destination and vice
versa.
Implementation of these routing protocols may contribute in the 5G environment in
which cellular and ah-hoc networks merge in such a fashion of performance, that may achive
a best QOS not only in an autonomous system but also make contribution for fixed or
dynamic gateway, to share the data ins distributed fashion,e.gon line access to world wide
web from any where.
The paper is organized as follows. In section 2 describes classification of routing
protocols in MANETS. In section 3 briefs the overview of AODV and DSR routing protocols.
In section 4 to examine analysis and simulation along with program codes of selected
protocols. Section 5 covers the performance comparison of hop-to-hop in AODV and DSR
protocols as well as performance analysis. In 2
nd
last section describes proposed performance
based routing model and last one concludes the paper.

2. Classification of MANET Routing Protocols

The routing function of transferring data packets in mobile ad hoc network is
performed by mobile nodes itself. Due to un-centralized and limited transmission range of ad
hoc network, routing between mobile nodes consists of multiple hops depend on one another
to forward packets to destination node. Routing protocol uses several metrics to calculate best
suitable path for routing data packets between source and destination node. The routing
protocol of ad hoc network must be distributed in nature and have the capability to compute
multiple routes during the dynamic changes in network topology. Routing protocols for ad
hoc network can be classified into different categories. Based on different criteria such as;
type of routing information, when and how routing information is exchanged, and when and
how routes are computed etc., here we classify ad-hoc network as proactive and reactive for
routing protocols.

33

2.1 Proactive or Table Driven Routing Protocols
As the name implies, these routing protocols maintains information about global
network topology in the form of routing tables at every node all time. Proactive Routing
protocols are enhanced version of traditional wired/wireless network routing protocols. These
protocols maintain routing information on every single node in network even before it
needed. In other words it provides complete picture of network topology on every node.
Routing informations in routing tables is updated periodically and therefore actively
determines layout of the network as network topology changes. These protocols are ideal in
time-critical environment as it takes less time to determine best route for packets, but are not
suitable for larger networks as it needs new node entry in table on every node which cause
overhead and consumption of bandwidth. When a host node in the network requires a path to
destination to send data packets, proactive routing protocol runs path finding algorithm to find
best available route [7].
The common proactive routing protocols used by MANET are DSDV, OLSR, STAR, CGSR,
FSR, HSR, GSR, and WRP.
2.2 Reactive or On-Demand Routing Protocols
Ad Hoc networks using the reactive protocols do not maintain network topology
information on all nodes at all time. As clear form the name on-demand routing these
protocols do not exchange routing information periodically but use flooding method to obtain
information when required for a node to send data packet. The host node which needs to
transmit packets to destination in network, broadcasts a route request to all nodes in network.
The host node will be waiting for reply of the nodes in the network to provide a path to
destination before transmitting packets [7]. Reactive protocol performs two main functions in
Ad hoc network routing, i.e. route discovery and route maintenance. The route discovery
function of protocol is responsible for detecting of new route to forward packets when
required by a node. Route maintenance function of reactive protocol is responsible for
detecting of broken links and repairing of an existing route [8].The route discovered by global
search process are then stored for future use until they become invalid and deleted because of
link failure or topological changes. The route request and selection process leads to
significant delay in initial setup of transmitting packets. Reactive protocols are bandwidth
efficient and reduce storage space as it does not need to keep unnecessary network topology
information up-to-date [9].
The common reactive routing protocols used by MANET are DSR, AODV, TORA,
ABR, SSA, LAR, FORP, LMR, ROAM and PLBR.
3. Overview Of Selected Routing Protocols
This section discuss in details the current Mobile Ad Hoc Network (MANET) routing
protocols concept as described by Internet Engineering Task Force (IETF) MANET working
group and IEEE of wireless 802.11 standard. In particular, Ad Hoc On-Demand Distance
Victor (AODV) Routing and Dynamic Source Routing (DSR),) are discussed along with a
review of previous research implementation of these routing protocols.

34

3.1 Ad-hoc on-demand distance vector routing protocol (AODV)
AODV routing algorithm is a routing protocol design for mobile Ad-hoc networks
and is using on-demand routing approach for establishment of route between nodes. As it uses
on-demand routing therefore it built route to transmit data packets when the source node
desired and is trying to maintain established route as long as they are needed. AODV protocol
has quality to support unicast, multicast and broadcast routing with loop free, self starting and
scalable characteristics. AODV protocol routes data packets between mobile nodes of ad hoc
network. This protocol allows mobile nodes to pass data packets to required destination node
through neighbors node which cannot directly communicate. Nodes of network periodically
exchange information of distance table to their neighbors and ready for immediate updates.
AODV protocol is responsible to select shortest and loop free route from table to transfer data
packets. In case of errors or changes in selected route, AODV is able create a new route for
the rest of transmission of establishment and maintenance as below in figure1.
Route Management
AODV routing protocol in ad hoc network communicate between mobile nodes
through four types of different messages.
Route Request
Route Reply
Route Error
Hello Message
To establish a route between source and destination node Route Request (RREQ) and Route
Reply (RREP) packet query cycle are used. Route Error (REER) and HELLO data packets are
used for route maintenance [2].

Route Establishment
Consider the following figure 2, where source node 1 broadcast flooded RREQ
message in network for destination node 9. Node 2, 5, and 6 are neighbor of node 1 therefore
receives RREQ packet. When neighbor nodes receive RREQ packet, first of all these nodes
create a reverse route entry for source node in their route table. These nodes check their
routes to destinations if not available, they rebroadcast RREQ packet to their next own
neighbors i.e. 3, 5, 7, and 9 after increasing the hop count. As shown in the figure 3.1, an
intermediate node 5 can receive multiple RREQ packets from its multiple neighbors, i.e. node
1, 2 and 4. In such situation when a node receives multiple RREQ with same sequence
number and broadcast identifier, it drops redundant RREQ and does not forward it
Eventually, three different routes are discovered on the arrival of RREQ packet on destination
node. This time destination node 9 sends unicast RREP packet which follow reverse route
back to source node 1. The RREP packet from destination node includes current sequence
number of destination and distance in hops to destination. During reverse routing of RREP
packet nodes also set forward route table entry for destination node in their route table. Thus a
unicast RREP packet reaches to source node with updated destination sequence number. The
source node 1 accepts destination sequence number with shortest route and transmits data
packets through forward route [1]. During transmission if source node receive RREP packet
with greatest destination sequence number or equivalent it already using with less number of
hops, it then updates its route table and begins to transmit data packets on new route. In a
situation where source node does not receive RREP in required life span. The source node
rebroadcast RREQ packet by increasing life span.


35

(a) (b)
Figure1. Route establishments. (a) Route maintenance. (b) in AODV

Properties of AODV
The AODV protocol contained on-demand/reactive functionality to establish a rout to
destination and uses destination sequence number to find latest route. Connection setup delay
is less as compared to other protocols.Stale route entries are occurred due to inconsistent
routes information by intermediate nodes which contain old source sequence number but not
latest destination sequence number. Control overhead is high in AODV routing protocol
because of multiple replies of RREP packets for a single RREQ packet. The wastage in
bandwidth occurs due to periodic beaconing (hello messages) architecture of AODV protocol.
[14]
3.2 Dynamic source Routing (DSR)
Dynamic Source Routing (DSR) Protocol is an on-demand routing protocol
developed at Carnegie Mellon university Pittsburgh USA for use of multi-hop wireless
mobile ad hoc networks. DSR routing protocol is designed for mobile ad hoc network to keep
features of both on-demand routing protocol and source routing protocol. DSR protocol
performing as on-demand routing establishes a route between source and destination node
when source node wants to send data packets, routing of data packets in DSR protocol
between mobile nodes of ad hoc network is based on request/reply method.
DSR control the wastage of bandwidth by eliminating need of periodic table
updating. As discussed earlier that DSR protocol can establish a route to destination through
source routing, therefore it does not require transmission of periodic hello message by a node
to inform its neighbor about his presence [14]. Attractive point of DSR source routing
protocol is that intermediate nodes of ad hoc network do not need to keep route information.
The path is clearly defined in data packet of source node. DSR routing protocol supports uni-
directional communication between mobile nodes [3]. In mobile wireless ad hoc network
communication between mobile nodes through DSR routing protocol is achieved by two
phases: Route establishment and maintenance along with figiure2.

Route Establishment
The DSR protocol dynamically discovers a source route across mobile nodes to any
destination in ad hoc network. The DSR on-demand routing protocol operation based on

36

source routing divides route establishment phase between source and destination node into
three parts.
Route Request (RREQ)
Route Reply (RREP)
Route Cache

Route Maintenance
In DSR routing protocol, mobile nodes of ad hoc network do not need to broadcast
update periodic messages. Source node in network is responsible to maintain route for
communication. Consider the following figure 3. where source node1 broadcasting data
packets to destination node 9 through route 1-5-7-9. When communicating links 5-7 in the
source route is broken down and node 5 cannot receive acknowledgement packet from node
7. The node 5 deletes current source route form its route cache and sends a RERR packet to
source node 1. RERR packet from node 5 contains information about broken links between
node 5 and 7. As soon as source node receive RERR packet, it deletes used source route from
route cache and select another route to destination from route cache. If route cache does not
contain any other route to destination then the source node broadcast the RREQ packet again
to discover a new route to destination [4].
DSR protocol uses reactive/on-demand approach for routing in ad hoc network such
as source routing instead of hop to hop routing and eliminates advertisement of periodically
update messages. The intermediate nodes of the network are able to utilize route cache
information effectively and efficiently so that to reduce control overhead. The saving in
bandwidth occurs in DSR protocol due to beacon less (no hello messages) architecture [14].

(a) (b)
Figure2. Route establishments. (a) Route maintenance. (b) In DSR


37

Optimizations

Since last couple of years lots of research work has been done to discover and
implement optimized techniques for best performance of DSR routing protocol. The
following optimization techniques are achieved to improve performance and reduce overhead
of DSR protocol. [3]

Non-propagating RREQ

DSR protocol uses route cache at intermediate nodes to maintain route information between
different nodes in ad hoc network. When the neighbour or intermediate nodes receive RREQ
from source node and it is not by itself destination node, then it checks its route cache for
corresponding destination address. Thus if there is a route to destination in the intermediate
node route cache, it forward a RREP packet to source node by providing route to destination.
In this way propagating RREQ to destination node does not need.

Piggy-backing of a data packet
This DSR optimization technique eliminates delay in route discovery process between source
and destination nodes. In DSR protocol data packet can be piggy-backed on RREQ packet at
the time source node generate a request for route to destination. In case where intermediate
node finds a route to destination in its cache, it simply replies RREP packet to source node
and forward data packet on obtained route to destination without losing any data.

Shortest route reply
DSR protocol of ad hoc network provides capability to intermediate node to send RREP
packet to source node in situation of finding a route to destination in their route cache. Thus
when an intermediate node receive RREQ packet which itself is not part of source route but
contains short path to destination, sends a RREP packet to source node. After receiving such
multiple RREP packets from intermediate nodes, source node reselect shortest route to send
data packets to destination.

Gratuitous RERR
When source node receive RERR packets about broken links in route during transmission of
data packets in ad hoc network, then source node of DSR protocol piggy-back RERR packet
to re-broadcast RREQ packet in network to discover a new route to destination. The aim of
piggy-backing of RERR packet is to prevent mobile nodes from replying RREP with broken
links.
Recovering
During transmission of data packet when an intermediate node in the source route detects that
next node is broken and is not possible to send packet through. The communicating node
searches its route cache for next alternative route to forward data packet to destination. If
node finds such a new route it replaces current broken route in header of data packet and
forward it to destination. At the same time, intermediate node also send RERR packet to
source node.

38

Properties of DSR
DSR protocol uses reactive/on-demand approach for routing in ad hoc network such
as source routing instead of hop to hop routing and eliminates advertisement of periodically
update messages. The intermediate nodes of the network are able to utilize route cache
information effectively and efficiently so that to reduce control overhead. The saving in
bandwidth occurs in DSR protocol due to beacon less (no hello messages) architecture [Ram,
2004]. DSR routing protocol is not suitable for a large ad hoc network of mobile nodes.
Instead of repairing a broken link locally route maintenance mechanism of DSR protocol
broadcast broken link to source node for repairing. The higher delay in connection setup due
to the route establishment and fast mobility of nodes degrades the performance of DSR
protocol rapidly. Control overhead is much larger in this protocol due to the source routing
mechanism for entire path[15].

3.3. Quality of Service in Mobile Ad Hoc Networks
The widely accepted definition of QoS is defined by the consultative committee for
international telephony and telegraph (CCIT) recommendation E.800 as the collective effect
of service performance which determines satisfaction degree of a service user.
The maturity of wireless mobile technologies and the evolution of different applications
provide a reason for the introduction of QoS in wireless ad hoc networks.The goal of QoS
routing in MANET is to select routes with sufficient resources for data packets with QoS
requirements to increase possibility that network will be capable of supporting and
maintaining them. The following figure3. shows the QoS components.

Figure3. QoS Components in Routing

The QoS routing in mobile ad hoc network is measured with respect to the following
attribute.
Available bandwidth

39

Control message overhead
Data throughput
Probability of packet loss
Table storage overhead
Delay (setup connection)
Delay (end-to-end)
Service coverage area
Low power operation

Thus from above discussion it is clear that achieving QoS in mobile ad hoc network
corresponds to a real need and is difficult as compared with traditional wired networks. QoS
is essential element in routing which informs source node about successful availability of
destination node. QoS guarantees in mobile ad hoc networks are difficult because of the
following elements;

Dynamic network topology
Imprecise state information
Lack of central administration
No pre-existing base station / infrastructure less network
Hidden terminal problem
Limited resources availability
Energy constrained operation
Multicasting
Variable capacity link
Weak physical security

3.4 Simulation Study
Conducting real world mobile ad hoc network experiments for researchers are
difficult and costly. Therefore MANET research community commonly rely on computer
simulation to evaluate and analyze their experiments on different routing protocols for
dynamic ad hoc networks. The simulation results are far from perfect real environment but
still provide a better understanding. Simulation is the process of designing a model of real
system and conducting experiments for purpose of understanding behaviour and verification
of proposed system control at different stages. To achieve such goals a number of simulation
tools are available in market. The selection of good simulation tool helps a lot in better

40

understanding and testing of proposed mechanism in several different possible environments.
The emerging MANET routing algorithm studies shows that some sensitive simulation
parameters affect simulation results. Simulation result of two previously published MANET
routing protocols AODV and DSR are presented using TCP based application. AODV and
DSR are most popular MANET on-demand routing protocols. The analysis of proposed
protocols is done using the MANET model in OPNET simulator.

3.5 OPNET

Optimized Network Engineering Tools (OPNET) is commercial software developed
by OPNET Technologies Inc for simulation, analysing, and modelling of communication
networks, distributed systems, devices, and routing protocols. OPNET is most scalable and
efficient simulation tool and friendly to use because of its tremendous features, such as
comprehensive graphical user interface and animation. It contains hundreds of protocol and
vender device models with great flexibility for experiments and analysis. OPNET provide
object oriented modelling and open source code models which give easy understanding of
system. OPNET provide ideal simulation environment for wireless ad hoc network including
terrain, mobility, and multiple wireless models. OPNET contains 64-bit parallel simulation
kernel and provide discrete event, hybrid and analytical simulation environment for
researchers. This simulation tool enables its user to optimize performance and maximize
availability of communication networks and applications by using 3D visualization and
animation. [16]
The finite state machines of OPNET provide a natural representation of routing
protocols and contain an extensive support for communication related applications. OPNET
simulation software provides most flexible and scalable wireless mobile ad hoc network
performance modelling environment which includes a huge number of powerful advanced
technologies for accelerating simulation run time [18].
The OPNET simulation tools are divided into three main categories that communicate
in to three different phases of modelling and simulation projects. These three phases are;
Specification
Data Collection
Simulation and Analysis

Figure 4. Simulation cycle of OPNET [17]


41

The three phases of OPNET simulation is performed in a sequence and forms a cycle
as shown in the above figure4. Specification phase of the tool is actually divided into two
parts, i.e. Initial specification and Re-specification, where re-specification phase is part of
simulation cycle.

3.6 MANET Node Model Structure of OPNET

Routing protocols AODV, DSR, and TORA are implemented at IP layer in MANET
model structure as shown in the following figure. Models of AODV, DSR, TORA, and OLSR
are available in OPNET version 12. The following figure explains node model architecture of
a MANET node in detail.

Figure 5. MANET node model structure (OPNET model documentation)

ip_dispatch is root process for IP in MANET node and creates a child process manet_mgr.
The manet_mgr function as manager process and provides a common interface to multiple
mobile ad hoc routing protocols in OPNET. The manet_mgr is further child process for
required MANET protocol as configured in parameter. This OPNET ad hoc routing model
does not support multiple routing protocols on a single node and redistribution between
MANET routing protocols. The model also limits router node interfaces to be running same
MANET routing protocol.

Node Model

The MANET object palette contains all MANET capable nodes as shown in the
following figure6.

42

Figure6. MANET object palette
To simulate different routing protocols in mobile ad hoc network models some nodes of the
above object palette are used. The commonly used nodes in MANET network models are;

Wireless LAN Workstations and Servers
To generate application traffic such FTP, E-mail, and HTTP over TCP over IP over wireless
LAN in a MANET network model these node models of object palette are used. For each
MANET routing protocol these nodes can be configured to run in a specific way.
MANET Stations
To generate raw packet over IP over wireless LAN these node models of MANET object
palette are used. For each MANET routing protocol these nodes can be configured to function
as traffic sources or destination.
Wireless LAN routers and MANET gateway
These node models play very important role in MANET network models by performing
function as access point in a mobile ad hoc network. By enabling MANET gateway, these
nodes of object palette can also connect mobile nodes of ad hoc network to IP based
networks.
4. Analysis and Simulation
The main parameters that effect mobility in Ad Hoc Network are maximum speed of
mobile host nodes and pause time between each moving. In this paper we discuss different
phases such as simulation, data collection, and analysis of mobile ad hoc network. In this
simple scenario of ad hoc network the following parameters are used for simulation purpose.

43

The simulation is done by OPNET simulator version.12 for AODV and DSR routing
protocols, here the scenario consists of four to thirty wireless nodes for simulation.

Table1. Parameters of simulation
Routing Protocols AODV ,DSR and TORA
Number of wireless nodes scenario Dynamic intermediate 4 nodes to 50
toatal nodes
Movement space 4000m x 3000m
Maximum speed 2, 10, and 20 m/s
Maximum pause time 0 , 200s
Transmission rates 2, 5, and 10 packets/s
Packet size 512 bytes
Simulation time 300s
4.1 Analysis of AODV routing protocol
The simulated scenario evaluates the performance of important TCP parameters for
AODV network. All nodes in the network are configured to run AODV protocol and FTP
sessions. In simulation process different AODV parameters are used as suggested by RFC and
WLAN data rate. A single TCP connection is established between wireless nodes of scenario.
Two different self mobility trajectories are defined for mobile. The results shows amount of
routing traffic generated, route discovery time and the number of hops per route, TCP/IP
traffic, no; of RREQ and RREP packets and FTP download and upload time. Simulation of
mobile ad hoc network consist of six nodes was run for 300 seconds and the following results
were generated.
4.1.1 Program Code
C file for AODV Data Packet Support
/* aodv_pkt_support.ex.c */
#include <opnet.h>
#include <aodv.h>
#include <aodv_pkt_support.h>
#include <aodv_ptypes.h>
#include <ip_addr_v4.h>
static AODV_Packet* aodv_pkt_memcopy (AODV_Packet*option_ptr);
static void aodv_pkt_memfree (AODV_Packet*option_ptr);
static AODV_Packet* aodv_mem (void);

44

static AodvT_Rreq*aodv_rreq_mem (void);
static AodvT_Rrep*aodv_rrep_mem (void);
static AodvT_Rerr*aodv_rerr_mem (void);
static void aodv_rreq_memfr (AodvT_Rreq* rreq_ptr);
static void aodv_rrep_memfr (AodvT_Rrep* rrep_ptr);
static void aodv_rerr_memfr (AodvT_Rerr* rerr_ptr);
Packet*aodv_pkt_create (AODV_Packet* pkt_option_ptr, int option_size)
{static int index_x = OPC_FIELD_INDEX_INVALID;
Packet* aodv_pkptr;
#ifndef BIN
#define BIN
#endif
#ifndef BOUT
#define BOUT
#endif
4.1.2 Global statistics of AODV routing protocol

To establish a route source node initiated route discovery process by
sending FTP request to the destination node. In the route establishment process source
node broadcasting RREQ packet and destination node reply by RREP packet. As soon as
route is established between source and destination nodes, data transfer is started. The
destination node sending data to source node in response of FTP request. Due to delay in
Hello messages exchange between neighbor nodes chances of link breakage is higher. In case
of link breakage route establishment process is started again. Mobile nodes of define ad hoc
network wait until 3 minutes and 20 seconds (i.e. 200seconds) and start moving away towards
path defined by trajectory during simulation process as in figure7.

45

(a)

(b)

Figure7. Global Statistics of AODV traffic sent (a) and received (b)

As described earlier that Hello messages are used for maintenance of a route between
source and destination. This attribute of AODV is also used to determine neighbor nodes
connectivity by the following formula,
Allowed Hello Loss * Hello interval
The periodic time interval of hello message transmission for this six node simulated scenario
is defined as Uniform (10, 10.1) sec. Allowed Hello loss defines number of packet loss a node
can maintain before link break which is defined 3 in this simulation.
4.1.3 Object Statistics of Source and Destination nodes

The lifetime of a routing table entry is initialized to active route timeout and is
defined as 5 seconds for this scenario. If a route is not used and refreshed within defined
period of time, AODV marks route as invalid and removes it from IP common table. To
establish a route for the first time, originating node uses a TTL start value which is 1 for the
first RREQ packet.
The number of hops covered by source node is 2 where destination node is 1. The AODV
packets are queued during route establishment, when route is established then packets are
transmitted without any waiting in queue. Both nodes routing table contains same number of
nodes information. The routing traffic sent and received by both source and destination nodes
are also shown in the figure8.

46

(a)

(b)

Figure8. Object statistics AODV Source node (a) and Destination node (b)
4.1.4 Object Statistics of AODV Mobile nodes 1 and 2

The individual statistics of both mobile nodes in simulated scenario as shown in
figure9. The mobile node 2 is used as a hop in selected route for data transmission from
source to destination. The AODV routing traffic sent and received in both packets and bits of
mobile node 2 is high than mobile node 1. As the graph shows both mobile nodes are used in
establishment of routes but OPNET internal mechanism selects the route of mobile node 2
because of shortest way to destination. Mobile node 1 graph shows that it sent routing traffic
only in the establishment of route but is not use any more in the communication of data
packets.

47

(a)

(b)

Figure9. Object statistics AODV mobile node 1(a) and node 2
4.1.5 Object Statistics of AODV Intermediate nodes 1 and 2

The individual statistics of both wireless intermediate nodes in simulated scenario as
shown in figure10. The intermediate node 2 is used as a hop in selected route for data
transmission from source to destination. The AODV routing traffic sent and received in both
packets and bits of intermediate node 2 is high than intermediate node 1. The following
figures shows the same results as discussed above for mobile nodes.

(a)

(b)

Figure10. Object statistics AODV Intermediate node 1(a) and node 2 (b)

48

4.2 Analysis of DSR Routing protocol
The simulated scenario evaluates performance of important TCP parameters for
DSR based six to thirty nodes network. All nodes in network are configured to run DSR
protocol and FTP sessions. In simulation process different DSR parameters are used as
suggested by RFC and WLAN data rate. A single TCP connection is established
between wireless nodes of scenario. The mobility pattern for mobile nodes is defined by
two different self defined trajectories. Different results are taken which shows the
amount of routing traffic generated the route discovery time and number of hops per
route, TCP/IP traffic, no of RREQ and RREP packet.
4.2.1 Program Code
C file for DSR Data Packet Support
/* dsr_pkt_support.ex.c */
#include <opnet.h>
#include <dsr.h>
#include <dsr_pkt_support.h>
#include <dsr_ptypes.h>
#include <ip_addr_v4.h>
static List*dsr_memcopy (List* t1v_options_lptr);
static DsrT_Packet_Option*dsr_rreq_memcopy (DsrT_Packet_Option*);
static DsrT_Packet_Option*dsr_rrep_memcopy (DsrT_Packet_Option*);
static DsrT_Packet_Option*dsr_err_memcopy (DsrT_Packet_Option*);
static DsrT_Packet_Option*dsr_sur_memcopy (DsrT_Packet_Option*);
static DsrT_Packet_Option*dsr_pkt_memall (void);
static DsrT_Route_Request_Option* dsr_rreq_memallo (void);
static DsrT_Route_Reply_Option*dsr_rrep_memallo (void);
static DsrT_Source_Route_Option*dsr_sup_memallo (void);
/** Create the DSR packet**/
Packet*pkt_create (int next_header)
{ Packet*dsr_pkptr = OPC_NIL;

49

List*tlv_options_lptr = OPC_NIL;
#ifndef BIN
#define BIN
#endif
#ifndef BOUT
#define BOUT
#endif
4.2.2 Global statistics of DSR routing protocol

The simulated scenario for DSR routing protocol is the same as for AODV
protocol. The different parameters defined for AODV protocol is kept same for DSR
protocol to get best results for comparison of these two widely used routing protocols.
The route request table of the wireless nodes in simulated ad hoc network is defined to
hold 10 nodes towards destination. The number of hops in discovered route from source
to destination in DSR routing protocol is 1 as shown in the figure11.The route is
established only once during start of data transmission in simulation run time. The route
establishment phase in DSR protocol consists of three parts, i.e. RREQ, RREP, and
route cache, Route cache is used to hold maximum number of routes at any time during
simulation. The expiry time for a route in the route cache is defined as 300 seconds for
this simulation scenario. The DSR routing global traffic sent and received in both
packets and bits per seconds in simulated nodes of ad hoc network.

(a)

(b)

Figure11. Global statistics of DSR Routing Traffic sent (a) and received (b).

50

The above figures shows that maximum routing traffic sent by DSR routing
protocol in simulated scenario is between 2200 and 2400 bits/s, where 7 packets/s. This
is very good result during start of data packet transmission, but the routing traffic
during transmission is draft to a very less value after the 20 seconds of route
establishment. The routing traffic is reached to 0 bits and packets/s during
communication and mostly less than 400 bits/s and 1 packet/s in the whole 300s
simulation time.
4.2.3 Object statistics of intermediate nodes in DSR

During transmission of data in simulated ad hoc network routing traffic sent by all
wireless nodes is shown in below. The route selected by DSR protocol in simulated scenario
for transmission of data between source and destination nodes consists of four nodes, i.e.
source, mobile node 2, intermediate node 2, and destination. Source node sent traffic only
once during start of transmission. During reply by destination node a lot of traffic is added to
the data as shown in the figure. The intermediate node 2 and mobile node 2 ads nearly same
data traffic during simulation time. The source node sent less than 100 bits/sec traffic where a
mobile and intermediate node 2 sent more than 500 bits/sec traffic. The traffic sent by all
wireless DSR routing nodes in ad hoc network during simulation is shown in the following
figure12.

Figure12. Total DSR routing traffic sent


51

The traffic received by all wireless DSR routing nodes in ad hoc network during
simulation in intermediate nodes routing traffic received as shown in the following figure13.

Figure13. Total DSR routing traffic received

4.3 Analysis Of Reactive Routing Protocols
In this research work performance analysis of two different previously published
routing protocols AODV and DSR were done through OPNET simulator. Simulation results
for AODV and DSR routing protocols have been presented in many papers by different
researchers.
The simulated scenario evaluates the performance of important TCP parameters fo AODV
routing protocol in ad-hoc network. All nodes in the network are configured to run AODV
protocol and FTP sessions. In simulation process different AODV parameters are used as
suggested by RFC and WLAN data rate. A single TCP connection is established between
wireless nodes of scenario. Two different self mobility trajectories are defined for mobile.
The results shows amount of routing traffic generated, route discovery time and the number
of hops per route, TCP/IP traffic, no of RREQ and RREP packets, and FTP download and
upload time. Simulation of mobile ad hoc network consist of source, dynamic intermediade
(1,....,5) and destination nodes was run for 300 seconds and the following results were
generated. Simulation of mobile ad hoc network consist of six nodes was run for 300 seconds
and the following results were generated.
The simulated scenario evaluates performance of important TCP parameters for DSR based
on source, intermediate dynamic (1....5) and destination nodes in ad hoc network. All nodes in

52

network are configured to run DSR protocol and FTP sessions. In simulation process different
DSR parameters are used as suggested by RFC and WLAN data rate. A single TCP
connection is established between wireless nodes of scenario. The mobility pattern for mobile
nodes is defined by two different self defined trajectories. Different results are taken which
shows the amount of routing traffic generated the route discovery time and number of hops
per route, TCP/IP traffic, no of RREQ and RREP packets.

Figure14. Simulation progress report for DSR and AODV routing protocol

Figure15. Global Statistics of MANET delay

53

Constant Bit Rate (CBR) packet also affects delay during transmission of data packets. The
buffer area in node table becomes full quickly due to transmission of data packets, therefore
the packets have to stay for a longer time in buffer area before they are sent to next node. The
delay is high even during start of transmission, at this stage buffer contains a lot of packet
where route discovery is in progress. Due to high delay there is more chances of packets
drops.Total MANET traffic sent and received during transmission of data in six wireless node
ad hoc scenarios is shown in following figure. The figure15. shows that total MANET traffic
sent and received in both packets and bits are same.
5. Routing Protocols Comparison Summary
In order to judge the performance of any routing protocol one needs to know different
metrics. Both AODV and DSR routing protocols deliver a greater percentage of originated
data packets where there is node mobility occur. Both DSR and AODV are on-demand
protocols whose basic characteristic is demonstrated in the shape of its overhead. DSR
routing protocol limits scope and overhead of RREQ packets by using route cache.. The
global statistics shows that traffic sent and received by DSR protocol is greater than AODV
routing protocols. Data traffic is high in AODV during re-establishment of route between
source and destination node, where in DSR traffic is going high and low during whole
transmission.
OPNET simulator internal mechanism select shortest possible path between all
nodes of ad hoc network at any time during simulation and forward all data packets on
specified path. In our scenario OPNET uses same route for both routing protocols. In
order to check how AODV and DSR protocols react as rate of topology change varies; I
changed the maximum node speed from 30 m/s to 5 m/s which show effect on both
routing protocols. The global statistic of DSR MANET delay is very low than AODV
delayed. The DSR delay is high only in start of transmission and a bit high during
second and third time when route was established. On the other side AODV delay is
very high in start of transmission and through out the simulation time. The size of the
network, traffic load, and delay affects both AODV and DSR routing protocols. DSR
routing protocol is not efficient for large networks with many mobile nodes and high
load in terms of traffic and delay which will increase overhead. In such situation AODV
routing protocol is ideal because of its hop-by-hop routing. The results also shows that
total MANET traffic sent and received by DSR routing protocol is higher than AODV.
The route discovery time of DSR is good than AODV routing protocol. Thus our
simulation results show that some parameters of AODV are good as compared to DSR.
But the overall performance of DSR is good than AODV routing protocol in this small
and medium simulated ad hoc node scenarios.
6. Proposed performance based Routing protocol Model
For best routing between wireless nodes of ad hoc network a number of qualitative properties
is desirable. For best and effective routing loop freedom is very necessary for data packets to
avoid collision and waste of time. MANET uses time to live (TTL) to avoid such loops, but
more structured approach is required to get best results. The MANET delay effects on routing
very badly, as the mobile nodes are battery powered and scarce memory. The routing protocol

54

needs to be routed intelligently and utilize network bandwidth and energy resources in a
better way in case of network route delay.
One of the important characteristics of MANET is dynamic topology based on node
mobility. Mobile nodes in ad hoc network are free to change position frequently, therefore
routing protocol needs to quickly adopt topology changes. Due to dynamic mobility and
limited energy resources a unique wireless node in MANET cannot be trusted for auto
configuration in case of break down. Therefore support of distributed operation is required by
routing protocols to solve such type of problems. Therefore the routing protocol should
design to eliminate or minimize control traffic and other periodic messages. Source routing
protocol DSR is quite good in route establishment and route maintenance phases but not as
good in routing data packets. Where hop-by-hop routing protocol is good in transmission of
data packets. AODV is authentic for large networks in routing of data packets.
Here three different simulation scenarios are generated and the simulation time has
varied from 2sec, 10sec and 20 sec. It is observed that the packet loss is very less in case of
AODV, initially but it increases substantially on the simulation time increases. In case of
DSR simulation the packet loss is very high initially but it decreases substantially on the
simulation time increases.
7. Conclusion
In this scenario of hop to hop (intermediate) nodes the traffic load and delay affects both AODV and
DSR routing protocols. In this paper we came to the conclusion that DSR routing protocol is not
efficient for large networks with many mobile nodes and high load in terms of traffic and delay which
will increase overhead. So, we can conclude that if the MANET has to be setup for a small
amount of time then AODV should be prefer due to low initial packet loss and DSR should
not be prefer to setup a MANET for a small amount of time because initially there is packet
loss is very high. If we have to use the MANET for a longer duration then both the protocols
can be used, because after some times both the protocols have same ratio of packet delivering.
But AODV have very good packet receiving ratio in comparison to DSR.The two protocols
Ad hoc On-Demand Distance Vector Routing (AODV) and Dynamic Source Routing (DSR)
have been compared using simulation, it would be interesting to note the behavior of these
intermediate nodes on a real life test bed. In such situation AODV routing protocol is ideal
because of its hop-by-hop routing. Thus the combined performance of both AODV and DSR
routing protocol could be best solution for routing in MANET instead of separate
performance of both AODV and DSR in authentic intermediate data transfer rate from source
to destination.
Implementation of these routing protocols may contribute in the 5G environment in
which cellular and ah-hoc networks merge in such a fashion of performance, that may
achive a best QOS not only in an autonomous system but also make contribution for
fixed or dunamic gateway, to share the data as a distributed fashion,e.g world wide web
access from any where. This is our future plane to merge cellular and ad-hoc networks
to obey high speed of data thoughput i-e 2G to 5G acknowlge such best performance.
Acknowledgements

We are very pleased with core of heart to our family who pray for us, and we are
very greatful to SERSC for giving oppertunity to share our ideas and researcch in a global
platform.

55

References
[1.] Feeney, M. L. (2005) Introduction to MANET Routing. [Internet]. Swedish Institute of Computer
Science. Available from:
[2.] <http://www.nada.kth.se/kurser/kth/2D1490/05/lectures/feeney_mobile_adhoc_routing.pdf>
[3.] [Accessed 15 February 2007]
[4.] Lin, C. (N/A) AODV Routing Implementation for Scalable Wireless Ad Hoc Network Simulation
(SWANS). [Internet]. Available from:
[5.] <http://jist.ece.cornell.edu/docs/040421-swans-aodv.pdf>
[6.] [Accessed 10 February-2007]
[7.] Lee, S. (2000) Routing and Multicasting Strategies in Wireless Mobile Ad Hoc Networks,
[Internet].University of California Los Angeles. Available from:
[8.] <http://www.sigmobile.org/phd/2000/theses/sjlee.pdf>
[9.] [Accessed 01 April 2007]
[10.] Nicolau, A. & Grigoras, D. (2005) Concurrent Information Processing and Computing. 2
nd
edition.
Netherlands, IOS Press.
[11.] Forouzan, A.B. (2005) TCP/IP Protocol Suite. 3
rd
edition. McGraw Hill Book Company.
[12.] De Renesse, R. & Aghvami, A.H. (2004) Formal Verification of Ad-hoc Routing Protocols using SPIN
Model Checker. Centre for Telecommunication Research, King's College London, UK.
[13.] Lang, D. (2006) On the Evaluation and Classification of Routing Protocols for Mobile Ad Hoc
Networks. [Internet].Available from: < http://home.leo.org/~dl/dissertation.pdf> [Accessed 12 March
2007]
[14.] Mukija, A. (2001) Reactive Routing Protocols for Mobile Ad Hoc network. [Internet]. Available from:
[15.] <http://www.ifi.unizh.ch/~mukhija/papers/rrp_thesis.pdf>[Accessed 12 March 2007]
[16.] Halgamuge, K. S. & Wang, P. L. (2005) Classification and Clustering for Knowledge Discovery. 1
st

edition. Netherlands, Springer.
[17.] kenjiro., Cho., Philippe., & Jacquet. (2005) Technologies for Advanced Heterogeneous network , 1
st

edition. Netherlands, Springer.
[18.] Agha, A.K., & Omidyar, G.C. (2003) Mobile and Wireless Communications Networks. 2
nd
edition.
Singapore, World Scientific
[19.] Bakht, H. (2005) WIRELESS INFRASTRUCTURE: Critical ah-hoc networking features. [Internet].
Available from:
[20.] <http://www. zatz.com/authors/authorpages/humayunbakht.htm> [Accessed on 03-03-2007]
[21.] He, C. (2003) Throughput and delay in Wireless Ad Hoc Networks, Final report of EE359 Class project,
Stanford University.
[22.] Ram.S.C; & Manoj. S.B(2004) Ad-Hoc wireless networks: architecture and protocols 1
st
edition New
Jersey Prentice Hall.
[23.] KIM, G. T. (2004) Artificial Intelligence and Simulation. 1
st
edition. New York, Springer.
[24.] OPNET.(2007) Modeler Wireless Suite for Defence. http://www.opnet.com/products/modeler
[25.] Suresh, A. (2005) Performance Analysis of Ad Hoc On-demand Distance Vector routing (AODV) using
OPNET Simulator. University of Bremen.http://www.comnets.uni-bremen.de/~koo/OPNET-AODV-
asn.pdf>
[26.] Koziniec,T. (2007) OPNET Modeler My research and
experience.http://www.koziniec.com/research/presentations/opnet.PDF


56

Authors

1. (R)Abdul Ghaffar Khan Rtd. Principle and Adocate in
peshawar High court pakistan is beloved Father of the
Author Jahangir khan(L), currently Pursuing his PHD
degree. He is an Assistant Professor at Department of
computer science & IT in Sarhad university of science and
Information Technology peshawar , 25000 Pakistan.
2. Prof Dr. Syed Irfan Hayder is Dean of Graduat School
of Science & Engineering, PAF-KIET, PAF Base korangi
Creek karachi 75190, Pakistan.
3. Prof.Dr. Syed Malek Fakar Duani syed Mustafa is
Dean of School of Information & communication
Technology

Asia e University, No. 4, Jalan Sultan
Sulaiman, 50000 Kuala Lumpur, Malaysia.

Modeling and Simulation of Dynamic Intermediate Nodes and Performance Analysis in MANETS Reactive Routing Protocols

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Modeling and Simulation of Dynamic Intermediate Nodes and Performance Analysis in MANETS Reactive Routing Protocols

Uploaded by

Copyright:

Available Formats

International Journal International Journal International Journal International Journal of of of of Grid and Distributed Computing Grid and Distributed

, Dr.syed Irfan Hyder

, Dr.Syed Malek Fakar Duani syed Mustafa

You might also like