The document analyzes the performance of two routing protocols for mobile ad hoc networks (MANETs) - the Wireless Routing Protocol (WRP) and the Ad Hoc On-Demand Distance Vector (AODV) protocol. It describes the simulation setup used to evaluate the protocols under different scenarios varying offered load, pause time, and node speed. The results show that AODV outperformed WRP in terms of packet delivery ratio, throughput, and average end-to-end delay in most scenarios, demonstrating that AODV is generally better suited for MANETs compared to WRP. The same simulation framework could be used to evaluate other routing protocols.
Performance Analysis and Simulation of OLSR Routing Protocol in MANET ijcnac
Mobile ad hoc network is a collection of wireless nodes that are communicate other
nodes (router) without using access point, infrastructure . Mobile ad-hoc network is an
autonomous system that means no need for depaentd other nodes it have own capability
to handle and controlling all funcitionlity, to sending and receiving all information form
one device to other device. MANET has power full feature that controlling itself by
dynamic nature, multihop,low power and configuration of the system. In this paper we
analyzing, simulation and implements the TC messages and HELLO Message by MPR of
OLSR routing performance checked at 200 nodes on Qualnet 5.0.2 simulator. In Qualnet
simulator to simulate and implement the performance of OLSR routing protocols takes
various performance metrics like hello message sent (HMS) , hello message received
(HMR), TC message generated (TCMG), TC message replied (TCMR), TC messages
received on Constant Bit Rate (CBR) using random waypoint model. In this paper check
the performance OLSR routing protocol gives effective performance for lage networks.
In mobile ad hoc networks (MANETs), multipath routing protocols are more popular due to overcomes the certain limitation of single path routing like lower end-to-end delay, load balancing, energy efficiency and network lifetime. By providing multiple paths between a source-destination pair, multipath routing protocols are avoid such above problems. AOMDV (Ad Hoc On-Demand Multipath Distance Vector) routing protocol is an on-demand multipath routing and which is a relatively maturity and extensive application protocol. It doesn’t consider residual energy and load situation of the node on the time of route discovery process. So AOMDV’s efficiency declines sharply in case of high load and fast moving velocity. To solve the above problems, we propose an improved protocol Energy Efficient- AOMDV (EAOMDV) of AOMDV routing algorithm. EAOMDV is based on a strategy of energy model and load balancing concept. It will consider the residual energy and the load situation of the nodes, when it starts the route discovery phase. After considering the above concept and according to the simulation results, the EAOMDV routing protocol improves the efficiency, the packet delivery ratio and reduces the routing load.
Mobile Ad hoc Networks (MANETs) are characterized by open structure, lack of standard infrastructure
and un-accessibility to the trusted servers. The performance of various MANET routing protocols is
significantly affected due to frequently changing network topology, confined network resources and
security of data packets. In this paper, a simulation based performance comparison of one of the most
commonly used on-demand application oriented routing protocols, AODV (Ad hoc on-demand Distance
Vector) and its optimized versions R-AODV (Reverse AODV) and PHR-AODV (Path hopping based
Reverse AODV) has been presented. Basically the paper evaluates these protocols based on a wide set of
performance metrics by varying both the number of nodes and the nodes maximum speed. A NS-2 based
simulation study shows that, as compared to AODV and PHR-AODV, R-AODV enhances the packet
delivery fraction by 15-20% and reduces the latency approximately by 50%. R-AODV requires lesser node
energy for data transmission.
Performance Analysis and Simulation of OLSR Routing Protocol in MANET ijcnac
Mobile ad hoc network is a collection of wireless nodes that are communicate other
nodes (router) without using access point, infrastructure . Mobile ad-hoc network is an
autonomous system that means no need for depaentd other nodes it have own capability
to handle and controlling all funcitionlity, to sending and receiving all information form
one device to other device. MANET has power full feature that controlling itself by
dynamic nature, multihop,low power and configuration of the system. In this paper we
analyzing, simulation and implements the TC messages and HELLO Message by MPR of
OLSR routing performance checked at 200 nodes on Qualnet 5.0.2 simulator. In Qualnet
simulator to simulate and implement the performance of OLSR routing protocols takes
various performance metrics like hello message sent (HMS) , hello message received
(HMR), TC message generated (TCMG), TC message replied (TCMR), TC messages
received on Constant Bit Rate (CBR) using random waypoint model. In this paper check
the performance OLSR routing protocol gives effective performance for lage networks.
In mobile ad hoc networks (MANETs), multipath routing protocols are more popular due to overcomes the certain limitation of single path routing like lower end-to-end delay, load balancing, energy efficiency and network lifetime. By providing multiple paths between a source-destination pair, multipath routing protocols are avoid such above problems. AOMDV (Ad Hoc On-Demand Multipath Distance Vector) routing protocol is an on-demand multipath routing and which is a relatively maturity and extensive application protocol. It doesn’t consider residual energy and load situation of the node on the time of route discovery process. So AOMDV’s efficiency declines sharply in case of high load and fast moving velocity. To solve the above problems, we propose an improved protocol Energy Efficient- AOMDV (EAOMDV) of AOMDV routing algorithm. EAOMDV is based on a strategy of energy model and load balancing concept. It will consider the residual energy and the load situation of the nodes, when it starts the route discovery phase. After considering the above concept and according to the simulation results, the EAOMDV routing protocol improves the efficiency, the packet delivery ratio and reduces the routing load.
Mobile Ad hoc Networks (MANETs) are characterized by open structure, lack of standard infrastructure
and un-accessibility to the trusted servers. The performance of various MANET routing protocols is
significantly affected due to frequently changing network topology, confined network resources and
security of data packets. In this paper, a simulation based performance comparison of one of the most
commonly used on-demand application oriented routing protocols, AODV (Ad hoc on-demand Distance
Vector) and its optimized versions R-AODV (Reverse AODV) and PHR-AODV (Path hopping based
Reverse AODV) has been presented. Basically the paper evaluates these protocols based on a wide set of
performance metrics by varying both the number of nodes and the nodes maximum speed. A NS-2 based
simulation study shows that, as compared to AODV and PHR-AODV, R-AODV enhances the packet
delivery fraction by 15-20% and reduces the latency approximately by 50%. R-AODV requires lesser node
energy for data transmission.
The Optimized Link State Routing Protocol (OLSR) is an IP routing protocol optimized for mobile ad hoc networks, which can also be used on other wireless ad hoc networks. OLSR uses hello and topology control (TC) messages to discover and then disseminate link state information throughout the mobile ad hoc network.
Contents which are covered here:
Classification of Ad-Hoc Routing Protocol
Link State Routing
Problems of Link State Routing
Optimized Link State Routing Protocol
1 Hop and 2 Hop Neighbors
Hello Packet
MPR Selection
Topology Table
MPR Information Declaration
*** Animated figure/diagram might not be visible in PDF view. Please consider it. ***
OLSR Model, OLSR Protocol, Optimized Link-State Routing Protocol
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
Routing protocols for mobile ad-hoc networks have to
face the challenge of frequently changing topology, low
transmission power and asymmetric links. Both
proactive and reactive routing protocols prove to be
inefficient under these circumstances. The Zone Routing
Protocol (ZRP) combines the advantages of the proactive
and reactive approaches by maintaining an up-to-date
topological map of a zone centered on each node. Within
the zone, routes are immediately available. For
destinations outside the zone, ZRP employs a route
discovery procedure, which can benefit from the local
routing information of the zones.
Design and development of load sharing multipath routing protcol for mobile a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
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
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
The Optimized Link State Routing Protocol (OLSR) is an IP routing protocol optimized for mobile ad hoc networks, which can also be used on other wireless ad hoc networks. OLSR uses hello and topology control (TC) messages to discover and then disseminate link state information throughout the mobile ad hoc network.
Contents which are covered here:
Classification of Ad-Hoc Routing Protocol
Link State Routing
Problems of Link State Routing
Optimized Link State Routing Protocol
1 Hop and 2 Hop Neighbors
Hello Packet
MPR Selection
Topology Table
MPR Information Declaration
*** Animated figure/diagram might not be visible in PDF view. Please consider it. ***
OLSR Model, OLSR Protocol, Optimized Link-State Routing Protocol
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
Routing protocols for mobile ad-hoc networks have to
face the challenge of frequently changing topology, low
transmission power and asymmetric links. Both
proactive and reactive routing protocols prove to be
inefficient under these circumstances. The Zone Routing
Protocol (ZRP) combines the advantages of the proactive
and reactive approaches by maintaining an up-to-date
topological map of a zone centered on each node. Within
the zone, routes are immediately available. For
destinations outside the zone, ZRP employs a route
discovery procedure, which can benefit from the local
routing information of the zones.
Design and development of load sharing multipath routing protcol for mobile a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
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
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
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
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
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 Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are
connecting each other through wireless network. It includes several routing protocols specifically designed
for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector
(AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this
paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of
DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile
Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network
parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol
having some excellent performance Metrics then other protocols. We have taken different performance
parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified
by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet
delivery.
ENHANCING STUDENTS’ LEARNING AND SATISFACTION THROUGH THE USE OF SOCIAL MEDIAIJITE
Communication in and out the classroom is an essential component for education. As the technology
emerges, there is a need to adopt to the new technologies to enhance students’ learning experience. Social
media technologies provide informal communication methods that promote student engagement and
satisfaction by removing communication barriers. In this paper, we report our experience in using different
social media technologies to enhance students’ learning experience and satisfaction with the course. We
perform our experiment in software project management course and conduct a survey to assess the
students’ perspective towards using these different social media technologies in enhancing their learning
and satisfaction. Results show that students are satisfied and feel that their learning experience has
improved when using social media for class communication.
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are connecting each other through wireless network. It includes several routing protocols specifically designed for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector (AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol
having some excellent performance Metrics then other protocols. We have taken different performance parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet
delivery.
Our area of interest for the paper is the improvement of performance of DSR routing protocol by
changing in algorithm and this Improved DSR protocol should compare with remaining protocols
taken in this research paper.
2. In this paper we made changesin traditional DSR protocol and generation of new improved DSR the
different performance parameters and compare with AODV/DSR/DSDV protocols in mobility and
non- mobility scenarios nodes up to 300.
3. We can plot the graphs throughput, End to end Delay, Packet delivery Ratio, Dropping Ratio, and
average energy consumption on Mobility and Non-Mobility scenario by using Network Simulator
version 2.34 for Modified DSR protocols. M-DSR, DSDV perform well when Mobility is low.
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are
connecting each other through wireless network. It includes several routing protocols specifically designed
for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector
(AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this
paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of
DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile
Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network
parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol
having some excellent performance Metrics then other protocols. We have taken different performance
parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified
by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet
delivery.
Progressive Routing Protocol using Hybrid Analysis for MANETsidescitation
In this paper, we proposed a replacement hybrid multipath routing protocol for
MANET known as Hybrid Multipath Progressive Routing Protocol for MANET (HMPRP),
during this work we improve the performance of accepted MANET routing protocols,
namely, the Ad-hoc On-demand Distance Vector routing protocol and use of their most
popular properties to formulate a replacement Hybrid routing protocol using the received
signal strength. The proposed routing protocol optimizes the information measure usage of
MANETs by reducing the routing overload and overhead. This proposed routing protocol
additionally extends the battery lifetime of the mobile devices by reducing the specified
variety of operations for (i) Route determination (ii) for packet forwarding. Simulation
results are used to draw conclusions regarding the proposed routing algorithm and
compared it with the AODV, OLSR, and ZRP protocol. Experiments carried out based on
this proposed algorithm, shows that better performance are achieved with regard to AODV,
OLSR, and ZRP routing algorithm in terms of packet delivery ratio, throughput, energy
consumed and end-to-end packet delay.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
1. Sachchida Nand Singh, Surendra Verma, Ravindra Kumar Gupta / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 6, November- December 2012, pp.337-342
Performance Analysis of AODV and WRP in MANET
Sachchida Nand Singh*, Surendra Verma**, Ravindra Kumar Gupta***
*(Pursuing M.Tech in Software Engineering, SSSIST Sehore(M.P), India, Email: sesachchida@gmail.com)
** (Pursuing M.Tech in CS, GCIT , Greter Noida(U.P.), India, Email :surendraverma1@gmail.com)
***(Asst. Prof. Ravindra kumar Gupta, SSSIST Sehore(M.P),India, Email: ravindra_p84@gmail.com ).
ABSTRACT
The Mobile ad hoc networks (MANET) and more research could be done on removing those
is a wireless networks which have no shortcomings.
central bridge, and where each node acts as a However, this paper proposes to undertake
destination as well as a router. The MANETs are comparison of these two protocols in specific
dynamic networks because the network topology scenarios with MANET in order to help in choosing
keeps on changing because of the mobility of the the best protocol suited to particular conditions by
nodes. There are many protocols that have been highlighted the pros and cons of these two tested
developed to aid in routing in these types of protocols.
networks. Each of these protocols is
designed with some certain mobility scenarios in 2. ROUTING PROTOCOLS
mind. To achieve effective routing in a given A routing protocol[3] is desirable whenever
scenario, the right protocol must be chosen. a packet needs to be transmitted to a destination via
Choosing the right protocol involves evaluating number of nodes and many routing protocols have
many interdependent performance metrics that been planned for such kind of ad hoc networks.
define the effectiveness of a routing protocol, and MANET routing protocols can be categorize into:
this often poses a challenge to - Proactive routing protocols
application designers. - Reactive routing protocols
This research endeavoured to model a
simulation platform on which various protocols 2.1 PRO-ACTIVE OR TABLE DRIVEN
could be evaluated under various mobility ROUTING PROTOCOLS
scenarios to determine their suitability. The Proactive MANET protocols are based on
GloMoSim[1] was used as the simulation periodic exchange of control message and maintain
platform and two MANET protocols namely routing table and will dynamically determine the
wireless routing protocol WRP[4] and ad hoc layout of the network. Through a regular exchange
on-demand distance vector AODV[5] evaluated. of network topology packets between the nodes of
Our results demonstrated the usefulness of this the network, a complete path of the network is
modelled platform as it was able to establish that maintained at every single node. Hence minimal
the AODV outperformed WRP in four out of the delay in determining the route to be taken. Some
five of the measured performance metrics. The Proactive MANET Protocols include: WRP[4] ,
AODV is thus a better protocol for MANETs DSDV, DBF, GSR.
compared to WRP. The same simulation
platform could be used test other protocols. 2.2 REACTIVE OR ON DEMAND
ROUTING PROTOCOLS
Keywords: AODV, MANET, WRP In Reactive protocol, a route is discovered
only when it is necessary. The protocol tries to
1. INTRODUCTION discover a route only on-demand, when it is
Routing protocol play important role to any necessary. These protocols generate much less
Networks. In Mobile Ad Hoc Network MANET control traffic at the cost of latency. Some Reactive
wireless mobile nodes that communicate with each MANET Protocols include DSR, AODV[5] and
other without centralized control or established TORA.
infrastructure. Therefore, routing in MANET is a
difficult task due to highly dynamic environment. 2.3 DESCRIPTION OF PROTOCOLS
Wireless routing protocol WRP and Ad Hoc On- 2.3.1 WIRELESS ROUTING PROTOCOL
Demand Distance Vector Routing AODV are good WRP
examples of Ad hoc protocols that are proposed and The Wireless Routing Protocol WRP is a
implemented in MANET. By analyzing how a proactive, distance vector based protocol designed
protocol performs under certain environment, the for ad hoc networks. WRP modifies and enhances
shortcomings of the protocol could be discovered distance vector routing in the following three ways.
First, when there are no link changes, WRP
337 | P a g e
2. Sachchida Nand Singh, Surendra Verma, Ravindra Kumar Gupta / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 6, November- December 2012, pp.337-342
periodically exchanges a simple HELLO packet is also built in a layered approach; such as OSI
rather than exchanging the whole route table. If layer network architecture. GloMoSim is designed
topology changes are perceived, only the „path- as a set of library modules, each of which
vector tuples contain the destination, distance, and simulates a specific wireless communication
the predecessor (second-to-last-hop) node ID. protocol in the protocol stack. The library has been
Second, to improve reliability in delivering update developed using PARSEC, a C-based parallel
messages, every neighbor is required to send simulation language. New protocols and modules
acknowledgments for update packets received. can be programmed and added to the library using
Retransmissions take place if no positive this language. GloMoSim„s source and binary
acknowledgements are received within the timeout code can be downloaded only by academic
period. Third, the predecessor node ID information institutions for research purposes. Commercial
allows the protocol to recursively calculate the entire users must use QualNet, the commercial version
path from source to destination. of GloMoSim.
2.3.2 ON DEMAND DISTANCE VECTOR Our simulation considered a network of 35
ROUTING PROTOCOL AODV wireless nodes placed randomly within a 1500 x
AODV is a simple, efficient, and effective 1500 m2 area and transmission range of each node is
routing protocol for Mobile Ad-hoc Net-works 250 meters. CBR data sessions are chosen. Only a
which do not have fixed topology. AODV is a specified number of nodes out 35 will be engaged in
distributed algorithm using distance vector data transfer which we specify as offered load. This
algorithms, such as the Bellman Ford algorithm. is done to see the impact of varied load on various
Routes are created on Demand but maintained in performance metrics. Five runs with different seeds
tables. only the routing information for the routes have been conducted for each scenario and collected
which is currently in use is maintained in tables. To data is averaged over these runs. A summary of
find a path from source to the destination, the source salient simulation parameters are given in Table 3.1.
broadcasts a route request packet. The neighbors in
turn broadcast the packet to their neighbors till it Table 1 Simulation Parameters
reaches an intermediate node that has recent route Parameter Value
information about the destination or till it reaches the Simulation Time 20 min(1200 sec)
destination. A node discards a route request packet Terrain Area 1500x1500 m2
that it has already visited. Number of Nodes 35
When a node forwards a route request Node Placement Random
packet to its neighbors, it also records in its tables strategy
the node from which the first copy of the request Propagation Model Two-Ray Model
came. This information is used to construct the Mobility Model RANDOM-WAYPOINT
reverse path for the route reply packet. AODV uses Radio Type Accumulated Noise
symmetric links because the route reply packet Model
follows the reverse path of route request packet. As Network Protocol IP
the route reply packet traverses back to the source, MAC Protocol IEEE 802.11
the nodes along the path enter the forward route into
Routing Protocol AODV,WRP
their tables.
Since source moves in MANET then it can
reinitiate route discovery to the destination. If one of 4. NETWORK SCENARIOS
the intermediate Routing Protocols for MANET In the MANET, we have simulated the following 3
nodes move then the moved nodes neighbor realizes different scenario:
the link failure and sends a link failure notification - Offered Load (number of source destination pairs)
to its upstream neighbors and so on till it reaches the - Pause Time
source upon which the source can reinitiate route - Node Speed
discovery if needed.
4.1 OFFERED LOAD (NUMBER OF SDPS)
Offered load refers to the number of source
3. SIMULATION ENVIRONMENT
destination pairs engaged in data transfer. i.e. if 7
All simulations have been carried out using
SDPs amongst 35 nodes, 7 source nodes and 7
the GloMoSim 2.03[1] simulator programme under
destination nodes (i.e. 14 nodes in total) will be
Windows platform.
engaged in data transfer. However, during this data
GloMoSim is a scalable simulation
transfer process, all of the 35 nodes (including the
environment for wired and wireless network systems
above 14 nodes) will operate in the background for
built using the PARSEC simulation environment.
providing necessary support (i.e. routing/forwarding)
Currently it only supports protocols for a purely
to the ongoing communication process in the
wireless network. The modules have been
network. In our simulation we considered 10 m/s as
developed using VC++ programming language. It
338 | P a g e
3. Sachchida Nand Singh, Surendra Verma, Ravindra Kumar Gupta / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 6, November- December 2012, pp.337-342
an average speed and 0s pause time with offered
load (i.e. number of SDPs) varied as 10,20,30,40
pairs.
4.2 PAUSE TIME
Pause time refers to the rest time of the
node. random waypoint mobility model RWMM[2]
includes pause times between changes in direction
and/or speed. A node begins by staying in one
location for a certain period of time (i.e. a pause
time). Once this time expires, the node chooses a
random destination in the simulation area and a
speed that is uniformly distributed between [MIN
SPEED, MAX SPEED]. The node then travels
towards the newly chosen destination at the selected Fig. 1 PDR versus Offer Load(CBR Traffic)
speed. Upon arrival the node pauses for a specified
time period before starting the process again. In our Fig..1 shows the impact of offered load
simulation, we considered 10 m/s as an average node (i.e. number of source destination pairs) on the
speed, 10 SDPs as offered load, random waypoint as packet delivery ratio in a network of 35 nodes
mobility model and 0,300,600,900,1200 seconds as randomly placed with 0s pause time. The results
pause time. Where, 0s pause time represent the show that for reactive protocols AODV and
continuous node mobility and 1200s pause time Proactive protocol WRP, the delivery ratio degrades
represents static network environment. and then raise and then again degrades with increase
in load. The AODV, having a delivery ratio of more
4.3 NODE SPEED than 90% at load of 7 SDPs and the same 90% at
Node speed refers to the average speed with load of 35 SDPs. While proactive protocol WRP
which nodes move in the simulation area. We have having the least delivery ratio between the two
used random waypoint mobility model .In RWMM, protocols there is a slight decrease in the delivery
nodes move at a speed uniformly distributed in ratio with load. It has a delivery ratio of 25% at a
[MIN SPEED, MAX SPEED]. In our simulation, we load of 7 SDPs which decrease to less than 17% at a
have considered 10 SDPs for data transfer and load of 35 SDPs.
average node speeds considered are 10,20,30,40,50
m/s. Each node begins the simulation by moving 6.1.2 . THROUGHPUT
towards a randomly chosen destination. Whenever a 6.1.3
node chooses a destination, it rests for a pause time.
It then chooses a new destination and moves towards
the same. This process is repeated until the end of
the simulation time.
5. PERFORMANCE METRICS
The following performance metrics were compared:
Mean end-to-end packet latency, defined as the
time elapsed from the moment a packet
leaves the source to the time the packet is
received at the destination.
Packet delivery ratio (PDR), the total number
of packets delivered to the destination to the
total number of data packets generated.
Throughput, the number of packets delivered per FIG 2 Throughput versus Offer Load(CBR traffic)
unit time.
Fig.2 shows the impact of offered load on
6.SIMULATION RESULTS the Throughput in a network of 35 nodes randomly
For the simulation, we will take constant bit rate placed with 0s pause time. The results show that for
(CBR) traffic into consideration. reactive protocols AODV and Proactive protocol
WRP, the delivery ratio degrades and raise and then
6.1 OFFERED LOAD (NUMBER OF again degrades with increase in load. The AODV,
SOURCE DESTINATION PAIRS) SCENARIO having a Throughput of more than 90% at load of 7
6.1.1 PACKET DELIVERY RATIO SDPs and the same 90% at load of 35 SDPs. While
proactive protocol WRP having the least Throughput
between the two protocols there is a slight decrease
339 | P a g e
4. Sachchida Nand Singh, Surendra Verma, Ravindra Kumar Gupta / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 6, November- December 2012, pp.337-342
in the delivery ratio with load. It has a Throughput performance with 98% packet delivery at 1200s
of 20% at a load of 7 SDPs which decrease to less pause time. The WRP protocol has lesser packet
than 15% at a Throughput of 35 SDPs. delivery ratio i.e. approximately 60% less delivery
ratio than AODV.
6.1.3. AVERAGE END TO END DELAY
6.2.2. THROUGHPUT
Fig.3 Average end to end delay versus Offer
Load(CBR Traffic) Fig. 5 Throughput versus Pause Time(CBR Traffic)
Fig. 3 shows the impact of offered load on In Fig. 5 we observe the impact of pause
the Average end to end delay in a network of 35 time on Throughput for CBR Traffic. For AODV
nodes randomly placed with 0s pause time. The protocol first Throughput decrease and then increase
results show that for reactive protocols AODV and with increase with pause time, while for WRP
Proactive protocol WRP, For AODV , with protocol it will constant with pause time. The
increasing load , it can be seen that the end-to-end protocol AODV shows the best performance with
delay decreases and then increase with increasing 99% packet delivery at 1200s pause time. The WRP
load, the delivery ratio degrades and then raise and protocol has lesser Throughput i.e. approximately
then again degrades with increase in load. For 90% less delivery ratio than AODV.
Proactive protocol WRP it is seen that average end
to end delay slightly increase with increasing load. 6.2.3. AVERAGE END TO END DELAY
6.2. PAUSE TIME SCENARIO
6.2.1. PACKET DELIVERY RATIO
Fig.6 Average end to end delay versus Pause
Time(CBR Traffic)
Fig.4 PDR versus pause Time(CBR Traffic) In Fig..6 we observe the impact of pause
time on average end to end delay for CBR Traffic.
In Fig. 4 we observe the impact of pause After a certain pause time, it can be seen that the
time on packet delivery ratio for CBR Traffic. The end-to-end delay decreases and then constant for
results show that the packet delivery ratio is AODV. This can be attributed to the fact that beyond
maximum when the pause time is equal to the 300 seconds, packets are either delivered quickly
simulation time (i.e. when the nodes in the network (due to longer lifetimes) or packets are timed out
are static). The protocol AODV shows the best and dropped (due to higher network partitions).
340 | P a g e
5. Sachchida Nand Singh, Surendra Verma, Ravindra Kumar Gupta / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 6, November- December 2012, pp.337-342
The WRP protocol has constant end to end delay all node speed. The WRP shows a increase of 20%
with increase pause time. in Throughput when the average node speed
increases from 10 m/s to 50 m/s.
6.3. NODE SPEED SCENARIO
6.3.1. PACKET DELIVERY RATIO 6.3.3. AVERAGE END TO END DELAY
Fig.7 PDR versus Node Speed(CBR Traffic) Fig.9 Average end to end delay versus Node Speed
(CBR Traffic)
The Fig.7 shows the impact of changing the
speed, with which nodes move in an ad hoc network, The Fig.9 shows the impact of changing the
on the packet delivery ratio. Packet delivery ratio speed, with which nodes move in an ad hoc network,
decreases with increase in average node speed in on average end to end delay. Average end to end
AODV, While packet delivery ratio increase in delay of packet Packets first increase and then
average node speed in WRP protocol. The packet decrease rapidly with increase in average node speed
delivery ratio for AODV is approximately 90% in AODV, While packet delivery ratio remains
which remains almost same for all node speed. The constant with increase in average node speed in
WRP shows a increase of 30% in delivery ratio WRP protocol.
when the average node speed increases from 10 m/s
to 50 m/s. 7. CONCLUSIONS AND FUTURE SCOPE
The performance of both routing protocols
6.3.2. THROUGHPUT evaluated by detailed simulation result.
We used performance metrics are packet delivery
ratio, throughput and average end to end delay. We
have used three different scenario, offer Load, pause
Time and average node speed.
In the terms of packet delivery ratio,
throughput and end to end delay in pause time
scenario AODV performs better than WRP . WRP
exhibits the worst performance in terms of packet
delivery ratio, throughput and routing message
overhead.
From analysis we observed that packet loss
is very less in case of AODV in comparison to
WRP. 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 WRP should not be prefer to setup a
Fig.8 Throughput versus Node Speed(CBR Traffic) MANET for a small amount of time because initially
there is packet loss is very high.
The Fig 8 shows the impact of changing the
speed, with which nodes move in an ad hoc network, 7.1 FUTURE SCOPE
on the Throughput. Throughput have constant with We can evaluate the performance for web
increase in average node speed in AODV, While server pages like the HTTP traffic, Multimedia
Throughput increase constantly in average node traffic and other different real time scenario. We can
speed at 30 m/s after it decrease slightly at 50 m/s in comparison other routing protocols with using these
WRP protocol. The Throughput for AODV is scenarios.
approximately 90% which remains almost same for
341 | P a g e
6. Sachchida Nand Singh, Surendra Verma, Ravindra Kumar Gupta / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 6, November- December 2012, pp.337-342
REFERENCES
[1] L. Bajaj, M. Takai, R. Ahuja, R. Bagrodia.
“GloMoSim: A Scalable Network
Simulation Environment.” Technical
Report 990027, University of California,
13, November 1999.
[2] J. Yoon, M. Liu, B. Noble, “Random
Waypoint Considered Harmful,” 0-7803-
7753-2/03, IEEE INFOCOM, 2003.
[3] R. Al-Ani, “Simulation and performance
analysis evaluation for variant MANET
routing protocols”, International Journal of
Advancements in Computing Technology,
Volume 3, Number 1, February 2011
[4] SandipVijay; Sharma, S.C.; Parmanand;
Santhosh Kumar; : Research Reviews of
IEEE 802.11 Wireless Ad-hoc
Networks,Proceedings of International
Journal of Trends in Engineering
Vol.1,No.2,May 2009. pp. 234
[5] David Oliver Jorg; :Performance
Comparision Of MANET Routing
Protocols In Different Network Sizes
,Computer Science Project .
342 | P a g e