Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed.
An ad-hoc routing protocol is a convention, or standard, that controls how nodes decide which way to route packets between computing devices in a mobile ad hoc network .
In ad-hoc networks, nodes are not familiar with the topology of their networks; instead, they have to discover it.The basic idea is that a new node may announce its presence and should listen for announcements broadcast by its neighbors.Each node learns about nodes nearby and how to reach them, and may announce that it, too, can reach them
Mobility and Node Density Based Performance Analysis of AODV Protocol for Adh...IDES Editor
A mobile ad-hoc network (MANET) is a collection of
mobile nodes, which communicate over radio. These networks
have an important advantage; they do not require any
existing infrastructure or central administration. Therefore,
mobile ad-hoc networks are suitable for temporary
communication links. This flexibility, however, comes at a
price: communication is difficult to organize due to frequent
topology changes. In this paper we propose on-demand
routing algorithm for mobile, multi-hop ad-hoc networks. The
algorithm is based on ant algorithms, which are a class of
swarm intelligence. The main goal in the design of the
algorithm is to reduce the overhead for routing. Furthermore,
in this paper the performance of AODV protocol is analyzed
by varying mobility and node density parameters through
simulation of results ns2 simulator.
An ad-hoc routing protocol is a convention, or standard, that controls how nodes decide which way to route packets between computing devices in a mobile ad hoc network .
In ad-hoc networks, nodes are not familiar with the topology of their networks; instead, they have to discover it.The basic idea is that a new node may announce its presence and should listen for announcements broadcast by its neighbors.Each node learns about nodes nearby and how to reach them, and may announce that it, too, can reach them
Mobility and Node Density Based Performance Analysis of AODV Protocol for Adh...IDES Editor
A mobile ad-hoc network (MANET) is a collection of
mobile nodes, which communicate over radio. These networks
have an important advantage; they do not require any
existing infrastructure or central administration. Therefore,
mobile ad-hoc networks are suitable for temporary
communication links. This flexibility, however, comes at a
price: communication is difficult to organize due to frequent
topology changes. In this paper we propose on-demand
routing algorithm for mobile, multi-hop ad-hoc networks. The
algorithm is based on ant algorithms, which are a class of
swarm intelligence. The main goal in the design of the
algorithm is to reduce the overhead for routing. Furthermore,
in this paper the performance of AODV protocol is analyzed
by varying mobility and node density parameters through
simulation of results ns2 simulator.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Effective Path Identification Protocol for Wireless Mesh NetworksIDES Editor
Wireless Mesh Networks (WMNs) have emerged as
a key technology for next-generation wireless networking.
Routing is a key factor for transfer of packets from source to
destination. SrcRR is widely used protocol for transferring
packets from source to destination. This protocol often uses
Dijkstra’s algorithm on its link state database to find the next
alternative path to the destination when ever the ETX metric
of the link changes.This is a time consuming process if the
ETX metric of the links are changing frequently. So this paper
eliminates the use of Dijkistra’s algorithm and uses the a
search operation for finding the best paths.
AGPM: An Authenticated Secure Group Communication Protocol for MANETsIDES Editor
Secure group communication is a challenging task
with respect to MANET’s, authentication of mobile nodes,
group key establishment and rekeying for secure
information exchange and QoS in data transfer. In this
paper we authenticate the mobile nodes through transitive
signature scheme in the routing phase of AODV protocol.
For a secure group communication we establish a
collaborative group key with the members participating in
the route path to the destination. The nodes are dynamic in
nature, in which any new node can join in the group or
leave the group. Instead of performing individual Rekeying
operations, it is performed at a particular time interval.
Performance of the group communication is compared with
the existing protocols. The analysis is made with respect to
the throughput, rekeying time, delay, overhead and
communication cost. The simulation result shows that our
protocol enjoys greater advantage over other protocols in
the literature.
SIMULATION AND ANALYSIS OF AODV, DSDV, ZRP IN VANETijfcstjournal
The main aim of this paper is to present comprehensive study on the performance and behavior of Ondemand
Distance Vector Routing approach (AODV), Table Driven Routing approach (DSDV) and Hybrid
Routing approach (ZRP) in VANETs. VANETs are an enhanced form of MANETs where moving nodes are
replaced by vehicles. This paper evaluates these protocols under realistic mobility models to analyze their
performance in VANETs. To evaluate the performance of given protocols, different set of scenarios with
varying nodes density have been simulated with the help of simulators NS-2, SUMO and MOVE.
Performance Analysis and Development of an Efficient Routing Scheme for IEEE ...IDES Editor
A collision-free centralized scheduling algorithm
for IEEE 802.16 WiMAX provides a mechanism for
creations multi-hop mesh and high-quality wireless
multimedia services which can be developed as a high speed
broad band wireless network. In centralized scheduling for
IEEE 802.16 mesh networks, all packets should be
transported through the BS (Base station).The links to or
from the BS becomes the system’s bottleneck and the
throughput is heavily impacted by the interference. To solve
this problem, we evaluated the proposed algorithm with five
selection criteria of scheduling through extensive simulations
and the experimental results are instrumental for improving
the performance of IEEE 802.16 based WMNs in terms of link
scheduling. We compared the effect of two routing and one
scheduling algorithm on the scheduling length. The result
shows that best algorithm has improved the system
performance in the aspects of scheduling length, transmission
range, and channel utilization ratio.
Minimizing mobiles communication time using modified binary exponential backo...IJCNCJournal
The domain of wireless Local Area Networks (WLANs) is growing speedily as a consequence of
developments in digital communications technology. The early adopters of this technology have mainly
been vertical application that places a premium on the mobility offered by such systems. Examples of these
types of applications consist of stocking control in depot environments, point of sale terminals, and rental
car check-in. Furthermore to the mobility that becomes possible with wireless LANs; these systems have
also been used in environments where cable installation is expensive or impractical. Such environments
include manufacturing floors, trading floors on stock exchanges, conventions and trade shows, and historic
buildings. With the increasing propagation of wireless LANs comes the need for standardization so as to
allow interoperability for an increasingly mobile workforce. Despite all the advantages and facilities that
Wi-FI offers, there is still the delay problem that is due to many reasons that are introduced in details in
our case study which also presents the solutions and simulation that can reduce this delay for better
performance of the wireless networks
journal publishing, how to publish research paper, Call For research paper, i...IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Abstract- Delay Tolerant Network (DTN) in routing concerns itself with the ability to route data from source to destination which is the fundamental ability all communication network must have. During the transmission of packets it has the fixed landmark so that only one path can be chosen. It cannot choose the alternative path, that path is considered to be as the best path. To solve this problem, an optimized inter – landmark data routing algorithm, namely DTN – FLOW which chooses the alternative path that is considered to be as the shortest and best path. The DTN – FLOW algorithm not only transmit packet with the use of landmark and inter – landmark. The information message will be performed in all the nodes so the performance of each and every node decreases by means of traffic. In order to increase the high throughput, node to node communication can be done effectively in DTN network.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Effective Path Identification Protocol for Wireless Mesh NetworksIDES Editor
Wireless Mesh Networks (WMNs) have emerged as
a key technology for next-generation wireless networking.
Routing is a key factor for transfer of packets from source to
destination. SrcRR is widely used protocol for transferring
packets from source to destination. This protocol often uses
Dijkstra’s algorithm on its link state database to find the next
alternative path to the destination when ever the ETX metric
of the link changes.This is a time consuming process if the
ETX metric of the links are changing frequently. So this paper
eliminates the use of Dijkistra’s algorithm and uses the a
search operation for finding the best paths.
AGPM: An Authenticated Secure Group Communication Protocol for MANETsIDES Editor
Secure group communication is a challenging task
with respect to MANET’s, authentication of mobile nodes,
group key establishment and rekeying for secure
information exchange and QoS in data transfer. In this
paper we authenticate the mobile nodes through transitive
signature scheme in the routing phase of AODV protocol.
For a secure group communication we establish a
collaborative group key with the members participating in
the route path to the destination. The nodes are dynamic in
nature, in which any new node can join in the group or
leave the group. Instead of performing individual Rekeying
operations, it is performed at a particular time interval.
Performance of the group communication is compared with
the existing protocols. The analysis is made with respect to
the throughput, rekeying time, delay, overhead and
communication cost. The simulation result shows that our
protocol enjoys greater advantage over other protocols in
the literature.
SIMULATION AND ANALYSIS OF AODV, DSDV, ZRP IN VANETijfcstjournal
The main aim of this paper is to present comprehensive study on the performance and behavior of Ondemand
Distance Vector Routing approach (AODV), Table Driven Routing approach (DSDV) and Hybrid
Routing approach (ZRP) in VANETs. VANETs are an enhanced form of MANETs where moving nodes are
replaced by vehicles. This paper evaluates these protocols under realistic mobility models to analyze their
performance in VANETs. To evaluate the performance of given protocols, different set of scenarios with
varying nodes density have been simulated with the help of simulators NS-2, SUMO and MOVE.
Performance Analysis and Development of an Efficient Routing Scheme for IEEE ...IDES Editor
A collision-free centralized scheduling algorithm
for IEEE 802.16 WiMAX provides a mechanism for
creations multi-hop mesh and high-quality wireless
multimedia services which can be developed as a high speed
broad band wireless network. In centralized scheduling for
IEEE 802.16 mesh networks, all packets should be
transported through the BS (Base station).The links to or
from the BS becomes the system’s bottleneck and the
throughput is heavily impacted by the interference. To solve
this problem, we evaluated the proposed algorithm with five
selection criteria of scheduling through extensive simulations
and the experimental results are instrumental for improving
the performance of IEEE 802.16 based WMNs in terms of link
scheduling. We compared the effect of two routing and one
scheduling algorithm on the scheduling length. The result
shows that best algorithm has improved the system
performance in the aspects of scheduling length, transmission
range, and channel utilization ratio.
Minimizing mobiles communication time using modified binary exponential backo...IJCNCJournal
The domain of wireless Local Area Networks (WLANs) is growing speedily as a consequence of
developments in digital communications technology. The early adopters of this technology have mainly
been vertical application that places a premium on the mobility offered by such systems. Examples of these
types of applications consist of stocking control in depot environments, point of sale terminals, and rental
car check-in. Furthermore to the mobility that becomes possible with wireless LANs; these systems have
also been used in environments where cable installation is expensive or impractical. Such environments
include manufacturing floors, trading floors on stock exchanges, conventions and trade shows, and historic
buildings. With the increasing propagation of wireless LANs comes the need for standardization so as to
allow interoperability for an increasingly mobile workforce. Despite all the advantages and facilities that
Wi-FI offers, there is still the delay problem that is due to many reasons that are introduced in details in
our case study which also presents the solutions and simulation that can reduce this delay for better
performance of the wireless networks
journal publishing, how to publish research paper, Call For research paper, i...IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Abstract- Delay Tolerant Network (DTN) in routing concerns itself with the ability to route data from source to destination which is the fundamental ability all communication network must have. During the transmission of packets it has the fixed landmark so that only one path can be chosen. It cannot choose the alternative path, that path is considered to be as the best path. To solve this problem, an optimized inter – landmark data routing algorithm, namely DTN – FLOW which chooses the alternative path that is considered to be as the shortest and best path. The DTN – FLOW algorithm not only transmit packet with the use of landmark and inter – landmark. The information message will be performed in all the nodes so the performance of each and every node decreases by means of traffic. In order to increase the high throughput, node to node communication can be done effectively in DTN network.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Narendra Singh Yadav
Clustering is an important research area for mobile ad hoc networks (MANETs) as it increases the capacity of network, reduces the routing overhead and makes the network more scalable in the presence of both high mobility and a large number of mobile nodes. Routing protocols based on flat topology are not scalable because of their built-in characteristics. However, clustering cause overhead which consumes considerable bandwidth, drain mobile nodes energy quickly, likely cause congestion, collision and data delay in larger networks. This paper uses an implementation of the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based routing protocol to examine the influence of clustering on the performance of mobile ad hoc networks. This paper evaluates channel utilization and control overhead as a function of number of nodes per sq. km to show the effect of clustering. Simulation results show that in high mobility scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
Performance Comparison of AODV and DSDV Routing Protocols for Ad-hoc Wireless...Narendra Singh Yadav
An ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple “hops” may be needed to exchange data across the network. Consequently, many routing algorithms have come into existence to satisfy the needs of communications in such networks. This paper presents performance comparison of the three routing protocols AODV and DSDV. Protocols were simulated using the ns-2 and were compared in terms of packet delivery fraction, normalized routing load and average delay, while varying number of nodes, and pause time. Simulation revealed that although DSDV perfectly scales to small networks with low node speeds, AODV is preferred due to its more efficient use of bandwidth.
PERFORMANCE COMPARISON AND ANALYSIS OF PROACTIVE, REACTIVE AND HYBRID ROUTING...ijwmn
Wireless Sensor networks are a challenging task due to the lack of resources in the network as well as the frequent changes in network topology. Various routing protocols are designed basically to establish correct and efficient paths between source and destination. In the recent years, several routing protocols
have been proposed in literature and many of them studied through extensive simulation at different network characteristics. In this paper, we compare the performance of three most common routing protocols of wireless sensor networks i.e. AODV, DSDV and ZRP. These protocols have been simulated
using NS2 Package. This study investigates the routing protocols corresponding to packet delivery ratio, packet loss ratio, average throughput, dropped packets and end-to-end delay. Hence, evaluation and comparison between routing protocols is required because performance of any routing protocol can be changed with various parameters such as speed of nodes, pause times and number of nodes.
Performance Comparison and Analysis of Proactive, Reactive and Hybrid Routing...ijwmn
Wireless Sensor networks are a challenging task due to the lack of resources in the network as well as the frequent changes in network topology. Various routing protocols are designed basically to establish correct and efficient paths between source and destination. In the recent years, several routing protocols have been proposed in literature and many of them studied through extensive simulation at different network characteristics. In this paper, we compare the performance of three most common routing protocols of wireless sensor networks i.e. AODV, DSDV and ZRP. These protocols have been simulated using NS2 Package. This study investigates the routing protocols corresponding to packet delivery ratio, packet loss ratio, average throughput, dropped packets and end-to-end delay. Hence, evaluation and comparison between routing protocols is required because performance of any routing protocol can be changed with various parameters such as speed of nodes, pause times and number of nodes.
Performance Comparison and Analysis of Proactive, Reactive and Hybrid Routing...ijwmn
Wireless Sensor networks are a challenging task due to the lack of resources in the network as well as the frequent changes in network topology. Various routing protocols are designed basically to establish correct and efficient paths between source and destination. In the recent years, several routing protocols have been proposed in literature and many of them studied through extensive simulation at different network characteristics. In this paper, we compare the performance of three most common routing protocols of wireless sensor networks i.e. AODV, DSDV and ZRP. These protocols have been simulated using NS2 Package. This study investigates the routing protocols corresponding to packet delivery ratio, packet loss ratio, average throughput, dropped packets and end-to-end delay. Hence, evaluation and comparison between routing protocols is required because performance of any routing protocol can be changed with various parameters such as speed of nodes, pause times and number of nodes.
Performance Evaluation of DSDV & OLSR Proactive Protocols in MANETijsrd.com
MANETS are working in distributed environment and dynamically changing the network topology. MANET protocols can be table driven or on demand as per requirement. DSDV (Destination Sequenced Distance Vector) and OLSR (Optimized Link State Routing protocol) both are table driven (proactive) protocol. Performances of both proactive protocols are evaluated using NS-2 simulator under various metrics and no. of mobile nodes is 10 in the network.
Mobile ad hoc network (MANET) is an autonomous system of mobile nodes. Each node operates not only as an end system, but also as a router to forward packets. The nodes are free to move about and organize themselves into a network. These cause extra challenges on security. In this paper, evaluation of prominent on-demand routing protocol i.e. AODV,MAODV,RAODV has been done by varying the network size. An effort has been carried out to do the performance evaluation of these protocols using random way point model. The simulator used is NS 2.34. The performance of either protocol has been studied by using a self created network scenario with respect to pause time.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Based on Heterogeneity and Electing Probability of Nodes Improvement in LEACHijsrd.com
In heterogeneous sensor networks, certain nodes become cluster heads which aggregate the data of their cluster nodes and transfer it to the sink. An Improved Energy leach protocol for cluster head selection in a hierarchically clustered heterogeneous network to reorganize the network topology efficiently is proposed in this research work. The proposed algorithm will use thresholding to improve the cluster head selection. The presented algorithm considers the sensor nodes in wireless network and randomly distributed in the heterogeneous network. The coordinates of the sink and the dimensions of the sensor field are known in prior.
Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...ijsrd.com
In Mobile Ad hoc network (MANETS), no fixed infrastructure is available. Different wireless hosts are free to move from one location to another without any centralized administration, so, the topology changes rapidly or unpredictably. Every node operates as router as well as an end system. Routing in MANETs has been a challenging task ever since the wireless networks came into existence. The major reason for this is continues changes in network topology because of high degree of node mobility. The MANET routing protocols have mainly two classes: Proactive routing (or table-driven routing) protocols and Reactive routing (or on-demand routing) protocols. In this paper, we have analyzed various Random based mobility models: Random Waypoint model, Random Walk model, Random Direction model and Probabilistic Random Walk model using AODV and DSDV protocols in Network Simulator (NS 2.35). The performance comparison of MANET mobility models have been analyzed by varying number of nodes using traffic TCP. The comparative conclusions are drawn on the basis of various performance metrics such as: Routing Overhead (packets), Packet Delivery Fraction (%), Normalized Routing Load, Average End-to-End Delay (milliseconds) and Packet Loss (%).
Similar to Research Inventy : International Journal of Engineering and Science (20)
Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...
Research Inventy : International Journal of Engineering and Science
1. RESEARCH INVENTY: International Journal Of Engineering And Science
ISSN: 2278-4721, Vol. 1, Issue 12 (December 2012), PP 61-64
Www.Researchinventy.Com
A Result based comparison of DSDV, AODV and DSR routing
protocols
1
,Prof. Nilesh U. Sambhe, 2, Prof. Sagar S. Badhiye
1,2,
Department Of Computer Technology, Yeshwantrao Chavan College Of Engineering, Nagpur
Abstract: Mobile Ad Hoc network is a collection of wireless mobile hosts forming a temporary network
without the aid of any centralized administration, in which individual nodes cooperate by forwarding packets
to each other to allow nodes to communicate beyond direct wireless transmission range. Routing protocols of
mobile ad-hoc network tend to need different approaches from existing Internet protocols because of dynamic
topology, mobile host, distributed environment, less bandwidth, less battery power. Ad Hoc routing protocols
can be divided into two categories: table-driven (proactive schemes) and on-demand routing (reactive
scheme) based on when and how the routes are discovered. In Table -driven routing protocols each node
maintains one or more tables containing routing information about nodes in the network whereas in on -
demand routing the routes are created as and when required. The table driven routing protocols is
Destination Sequenced Distance Vector Routing protocols (DSDV).The on-demand routing protocols are Ad
Hoc On-Demand Distance Vector Routing (AODV), Dynamic Source Routing (DSR).Here we compare these
protocols different parameters such as packet delivery fraction, good put(average throughput),energy
consumed( in Joules) and the no of forwardline used and compare the performance of these routing protocols
using NS2 environment.
Keywords: MANET, DSDV, AODV, DSR, NS2
1. INTRODUCTION
A. Destination Sequenced Distance Vector Routing Algorithm:
Destination-Sequenced Distance-Vector Routing (DSDV) is a table-driven routing scheme for adhoc
mobile networks based on the Bellman-Ford algorithm. It was developed by C. Perkins and P. Bhagwat in 1994.It
eliminates route looping, increases convergence speed, and reduces control message overhead.In DSDV, each
node maintains a next-hop table, which it exchanges with its neighbours. There are two types of next -hop table
exchanges: periodic full-table broadcast and event-driven incremental updating. The relative frequency of the
full-table broadcast and the incremental updating is determined by the node mobility. In each data packet sent
during a next-hop table broadcast or incremental updating, the source node appends a sequence number. This
sequence number is propagated by all nodes receiving the corresponding distance -vector updates, and is stored
in the next-hop table entry of these nodes. A node, after receiving a new next -hop table from its neighbour,
updates its route to a destination only if the new sequence number is larger than the recorded one, or if the new
sequence number is the same as the recorded one, but the new route is shorter. In order to further reduce the
control message overhead, a settling time is estimated for each route. A node updates to its neighbours with a
new route only if the settling time of the route has expired and the route remains optimal.
2. Source Initiated On Demand Routing
A. Ad Hoc On Demand Distance Vector Routing (Aodv):
The Ad hoc On-Demand Distance Vector (AODV) algorithm enables dynamic, self-starting, multihop
routing between participating mobile nodes wishing to establish and maintain an ad hoc network. AODV allows
mobile nodes to obtain routes quickly for new destinations, and does not require nodes to maintain routes to
destinations that are not in active communication. AODV allows mobile nodes to respond to link breakages and
changes in network topology in a timely manner. The op eration of AODV is loop-free, and by avoiding the
Bellman-Ford "counting to infinity" problem offers quick convergence when the adhoc network topology
changes (typically, when a node moves in the network). When links break, AODV causes the affected set of
nodes to be notified so that they are able to invalidate the routes using the lost link. Route Requests (RREQs),
Route Replies (RREPs) and Route Errors (RERRs) are message types defined by AODV.
61
2. A Result Based Comparison Of DSDV…
B. Dynamic Source Routing Protocol (Dsr):
The Dynamic Source Routing protocol (DSR) is an on demand routing protocol. DSR is a simple and
efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes.
Using DSR, the network is completely self organizing and self-configuring, requiring no existing network
infrastructure or administration. The DSR protocol is composed of two main mechanisms that work together to
allow the discovery and maintenance of source routes in the ad hoc network:
Route Discovery is the mechanis m by which a node S wishing to send a packet to a destination node D
obtains a source route to D. Route Discovery is used only when S attempts to send a packet to D and does not
already know a route to D.
Route Maintenance is the mechanism by which node S is able to detect, while using a source route to D, if the
network topology has changed such that it can no longer use its route to D because a link along the route no
longer works. When Route Maintenance indicates a source route is broken, S can attempt to use any other route
it happens to know to D, or it can invoke Route Discovery again to find a new route for subsequent packets to D.
Route Maintenance for this route is used only when S is actually sending packets to D.In DSR Route Discovery
and Route Maintenance each operates entirely on demand.
3. . METHODOLOGY
In this section we have described about the tools and methodology used in our paper for analysis of
adhoc routing protocol performance i.e. about simulation tool, simulation model, simulation environment
performance metrics used.
A. Simulation Tool:
In this paper the simulation tool used for analysis is NS-2 which is highly preferred by research
communities. NS is a discrete event simulator targeted at networking research. Ns provides substan tial support
for simulation of TCP, routing, and multicast protocols over wired and wireless (loc al and satellite) networks. NS2
is an object oriented simulator, written in C++, with an OTcl interpreter as a frontend. This means that most of the
simulation scripts are created in Tcl(Tool Command Language). If the components have to be developed for ns2,
then both tcl and C++ have to be used.
B. Why We Chosen Ns-2?
NS-2 is chosen as the simulation tool among the others simulation tools because NS-2 supports
networking research and education. Ns -2 is suitable for designing new protocols, comparing different protocols
and traffic evaluations. NS-2 is developed as a collaborative environment. It is distributed freely and open
source. A large amount of institutes and people in development and research use, maintain and develop NS-2.
This increase the confidence in it. Versions are available for FreeBDS, Linux, Solaris, Windows, Mac OS X. NS-2
also provides substantial support for simulation of TCP, UDP, routing and multicast protocols over wired and
wireless networks.
C. Simulation Model:
We run the simulation in Network Simulator (NS-2) accepts as input a scenario file that describes the
exact motion of each node and the exact packets originated by each node, together with the exact time at which
each change in motion or packet origination is to occur. The detailed trace file created by each run is stored to
disk, and analyzed using a variety of scripts, particularly one called file *.tr that counts the number of packets
successfully delivered and the length of the paths taken by the packets, as well as additional information about
the internal functioning of each scripts executed. This data is further analyzed with AWK file and Microsoft Excel
to produce the graphs.
Figure 1: Overview of simulation model
62
3. A Result Based Comparison Of DSDV…
D. Simulation Environment:
The performance analysis is done on Linux Operating System. Ns –allinone-2.34 was installed.
Scenario 1
Platform Linux Operating System
NS version Ns –allinone-2.34
Simulation time 50 s
Number of nodes 20 wireless nodes
Traffic CBR(Constant Bit Rate)
Packet size 1000 bytes
Simulation Area size 1500 x 900 m
Node speed 20 m/s
Table 1: Simulation parameters for scenario 1
Scenario 2
Platform Linux Operating System
NS version Ns –allinone-2.34
Simulation time 50 s
Number of nodes 30 wireless nodes
Traffic CBR(Constant Bit Rate)
Packet size 1000 bytes
Simulation Area size 1900 x 900 m
Node speed 50 m/s
Table 2: Simulation parameters for scenario 2
E. Performance Metrics:
The following parameters are selected for scenario 1 and scenario 2.
1) Packet Delivery fraction
The packet delivery ratio in this simulation is defined as the ratio between the number of packets sent by
constant bit rate sources and the number of received packets by the CBR sink at destination.
2) Goodput
Throughput is total number of successful received packet at destination during simulation time and
goodput is the average throughput in kbps.
3) Energy Consumed
It is the difference between the initial energy and the final energy. Here we consider initial energy as 30
Joules and the final energy is the energy which is utilised by the node after simulation. And the average
energy is calculated by ratio of total energy/ number of nodes.
4) Forward Line
The total number of lines used by the source node to send the packets to the destination node.
4. RESULT
Table 3: Protocols comparison on different parameters for 20 nodes
63
4. A Result Based Comparison Of DSDV…
Table 4: Protocols comparison on different parameters for 30 nodes
5. Conclusion
i) For Node =20
a) DSR performs better than AODV and DSDV in case of packet delivery fraction and goodput because the
number of nodes is less and no periodic update is maintained in DSR.
b) In case of energy consumption as the number of nodes used for the communication between source and
destination are more compared to AODV and DSDV, so the energy consumed by nodes and forward lines in
DSR is more as compared to AODV and DSDV.
ii)For Node =30
a) DSDV performs better than AODV and DSR in case of packet deliv ery fraction and goodput. Because the
increase in speed of movement of node and as the nodes becomes more stationary will lead to more stable
path from source to destination.
b) DSR consumes more energy as the number of nodes used for the communication betwe en source and
destination are more compared to AODV and DSDV, and also the number of forward lines used in DSR is
more.
6. References
[1] Kapil Suchdeo, Durgesh Kumar Mishra, “Comparison of On-Demand Routing Protocols” 2010 Fourth Asia
International Conference on Mathematical/Analytical Modelling and Computer Simulation, 978-0-7695-4062-
7/10 ,2010 IEEE
[2] Nor Surayati, Mohamad Usop, Azizol Abdullah“Performance Evaluation of AODV, DSDV & DSR Routing
Protocol in Grid Environment” IJCSNS International Journal of Computer Science and Network Security, 9,
No.7, July 2009.
[3] David B. Johnson, “Routing in Ad hoc Networks of Mobile Hosts", Proc IEEE Workshop on Mobile
Computing Systems and Applications .
[4] Elizabeth M. Royer, Chai-Keong Toh, “A Review of Current
Routing Protocols for Ad Hoc Mobile Wireless Networks”, Proc. IEEE, 1999.
[5] Runcai Huang, Yiwen Zhuang, Qiying Cao “Simulation and Analysis of Protocols in Ad Hoc Network”, 2009
International Conference on Electronic Computer Technology, 978-0-7695-3559-3/09 ,2009 IEEE.
[6] Qian Feng, Zhongmin Cai, Jin Yang,Xunchao Hun,“A Performance Comparison of the Ad Hoc Network
Protocols”, 2009 Second International Workshop on Computer Science and Engineering, 978-0-7695-3881-
5/09 ,2009 IEEE
[7] “Performance Measurement of Various Routing Protocols in Ad-hoc Network”, Md. Anisur Rahman, Md.
Shohidul Islam, Alex Talevski, Proceedings of the International MultiConference of Engineers and Computer
Scientists 2009, 1, IMECS 2009, March 18 - 20, 2009, Hong Kong.
[8] www.ces.wust1.edu/-jain/cis788-99/adhoc_routing/
[9] www.comp.brad.ac.uk/~sburuha1/
64