SlideShare ist ein Scribd-Unternehmen logo
1 von 6
Downloaden Sie, um offline zu lesen
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
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
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
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
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
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

Weitere ähnliche Inhalte

Was ist angesagt?

IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
 
Simulation & comparison of aodv & dsr protocol
Simulation & comparison of aodv & dsr protocolSimulation & comparison of aodv & dsr protocol
Simulation & comparison of aodv & dsr protocolPrafull Johri
 
Comparison between aodv and olsr protocol
Comparison between aodv and olsr protocolComparison between aodv and olsr protocol
Comparison between aodv and olsr protocolMehedi
 
Zone Routing Protocol
Zone Routing ProtocolZone Routing Protocol
Zone Routing Protocolnitss007
 
Wireless routing protocols
Wireless routing protocolsWireless routing protocols
Wireless routing protocolsbarodia_1437
 
Zone Routing Protocol (ZRP)
Zone Routing Protocol (ZRP)Zone Routing Protocol (ZRP)
Zone Routing Protocol (ZRP)Senthil Kanth
 
A novel approach of hybrid multipath routing protocol for manets using receiv...
A novel approach of hybrid multipath routing protocol for manets using receiv...A novel approach of hybrid multipath routing protocol for manets using receiv...
A novel approach of hybrid multipath routing protocol for manets using receiv...eSAT Publishing House
 
Design and development of load sharing multipath routing protcol for mobile a...
Design and development of load sharing multipath routing protcol for mobile a...Design and development of load sharing multipath routing protcol for mobile a...
Design and development of load sharing multipath routing protcol for mobile a...eSAT Publishing House
 
Progressive Routing Protocol using Hybrid Analysis for MANETs
Progressive Routing Protocol using Hybrid Analysis for MANETsProgressive Routing Protocol using Hybrid Analysis for MANETs
Progressive Routing Protocol using Hybrid Analysis for MANETsidescitation
 
PERFORMANCE EVALUATION ON EXTENDED ROUTING PROTOCOL OF AODV IN MANET
PERFORMANCE EVALUATION ON EXTENDED ROUTING PROTOCOL OF AODV IN MANETPERFORMANCE EVALUATION ON EXTENDED ROUTING PROTOCOL OF AODV IN MANET
PERFORMANCE EVALUATION ON EXTENDED ROUTING PROTOCOL OF AODV IN MANETijasuc
 
Lecture 11 14. Adhoc routing protocols cont..
Lecture 11 14. Adhoc  routing protocols cont..Lecture 11 14. Adhoc  routing protocols cont..
Lecture 11 14. Adhoc routing protocols cont..Chandra Meena
 
Performance Evaluation of Routing Protocols for MAC Layer Models
Performance Evaluation of Routing Protocols for MAC Layer ModelsPerformance Evaluation of Routing Protocols for MAC Layer Models
Performance Evaluation of Routing Protocols for MAC Layer ModelsIOSR Journals
 
Mobility and Node Density Based Performance Analysis of AODV Protocol for Adh...
Mobility and Node Density Based Performance Analysis of AODV Protocol for Adh...Mobility and Node Density Based Performance Analysis of AODV Protocol for Adh...
Mobility and Node Density Based Performance Analysis of AODV Protocol for Adh...IDES Editor
 

Was ist angesagt? (17)

IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
 
OLSR | Optimized Link State Routing Protocol
OLSR | Optimized Link State Routing ProtocolOLSR | Optimized Link State Routing Protocol
OLSR | Optimized Link State Routing Protocol
 
O26087092
O26087092O26087092
O26087092
 
Hs2413641369
Hs2413641369Hs2413641369
Hs2413641369
 
Simulation & comparison of aodv & dsr protocol
Simulation & comparison of aodv & dsr protocolSimulation & comparison of aodv & dsr protocol
Simulation & comparison of aodv & dsr protocol
 
Comparison between aodv and olsr protocol
Comparison between aodv and olsr protocolComparison between aodv and olsr protocol
Comparison between aodv and olsr protocol
 
Zone Routing Protocol
Zone Routing ProtocolZone Routing Protocol
Zone Routing Protocol
 
Wireless routing protocols
Wireless routing protocolsWireless routing protocols
Wireless routing protocols
 
Zone Routing Protocol (ZRP)
Zone Routing Protocol (ZRP)Zone Routing Protocol (ZRP)
Zone Routing Protocol (ZRP)
 
A novel approach of hybrid multipath routing protocol for manets using receiv...
A novel approach of hybrid multipath routing protocol for manets using receiv...A novel approach of hybrid multipath routing protocol for manets using receiv...
A novel approach of hybrid multipath routing protocol for manets using receiv...
 
Design and development of load sharing multipath routing protcol for mobile a...
Design and development of load sharing multipath routing protcol for mobile a...Design and development of load sharing multipath routing protcol for mobile a...
Design and development of load sharing multipath routing protcol for mobile a...
 
Progressive Routing Protocol using Hybrid Analysis for MANETs
Progressive Routing Protocol using Hybrid Analysis for MANETsProgressive Routing Protocol using Hybrid Analysis for MANETs
Progressive Routing Protocol using Hybrid Analysis for MANETs
 
PERFORMANCE EVALUATION ON EXTENDED ROUTING PROTOCOL OF AODV IN MANET
PERFORMANCE EVALUATION ON EXTENDED ROUTING PROTOCOL OF AODV IN MANETPERFORMANCE EVALUATION ON EXTENDED ROUTING PROTOCOL OF AODV IN MANET
PERFORMANCE EVALUATION ON EXTENDED ROUTING PROTOCOL OF AODV IN MANET
 
Lecture 11 14. Adhoc routing protocols cont..
Lecture 11 14. Adhoc  routing protocols cont..Lecture 11 14. Adhoc  routing protocols cont..
Lecture 11 14. Adhoc routing protocols cont..
 
Performance Evaluation of Routing Protocols for MAC Layer Models
Performance Evaluation of Routing Protocols for MAC Layer ModelsPerformance Evaluation of Routing Protocols for MAC Layer Models
Performance Evaluation of Routing Protocols for MAC Layer Models
 
E010322531
E010322531E010322531
E010322531
 
Mobility and Node Density Based Performance Analysis of AODV Protocol for Adh...
Mobility and Node Density Based Performance Analysis of AODV Protocol for Adh...Mobility and Node Density Based Performance Analysis of AODV Protocol for Adh...
Mobility and Node Density Based Performance Analysis of AODV Protocol for Adh...
 

Andere mochten auch (18)

Ex319981004
Ex319981004Ex319981004
Ex319981004
 
Ev31986991
Ev31986991Ev31986991
Ev31986991
 
Hi2413031309
Hi2413031309Hi2413031309
Hi2413031309
 
Ic2414251429
Ic2414251429Ic2414251429
Ic2414251429
 
Gb2511071110
Gb2511071110Gb2511071110
Gb2511071110
 
Gt2412081212
Gt2412081212Gt2412081212
Gt2412081212
 
Jm2516821688
Jm2516821688Jm2516821688
Jm2516821688
 
Hl2413221328
Hl2413221328Hl2413221328
Hl2413221328
 
Gy2412371242
Gy2412371242Gy2412371242
Gy2412371242
 
Jy2417091713
Jy2417091713Jy2417091713
Jy2417091713
 
Hb2412611268
Hb2412611268Hb2412611268
Hb2412611268
 
Ks2518741883
Ks2518741883Ks2518741883
Ks2518741883
 
Jq2517021708
Jq2517021708Jq2517021708
Jq2517021708
 
Oh2423312334
Oh2423312334Oh2423312334
Oh2423312334
 
Hv2413821386
Hv2413821386Hv2413821386
Hv2413821386
 
Au26297302
Au26297302Au26297302
Au26297302
 
Al26234241
Al26234241Al26234241
Al26234241
 
Ac26185187
Ac26185187Ac26185187
Ac26185187
 

Ähnlich wie Az26337342

Network Surveillance Based Data Transference in Cognitive Radio Network with ...
Network Surveillance Based Data Transference in Cognitive Radio Network with ...Network Surveillance Based Data Transference in Cognitive Radio Network with ...
Network Surveillance Based Data Transference in Cognitive Radio Network with ...IRJET Journal
 
Review paper on performance analysis of AODV, DSDV, OLSR on the basis of pack...
Review paper on performance analysis of AODV, DSDV, OLSR on the basis of pack...Review paper on performance analysis of AODV, DSDV, OLSR on the basis of pack...
Review paper on performance analysis of AODV, DSDV, OLSR on the basis of pack...IOSR Journals
 
Hybrid networking and distribution
Hybrid networking and distribution Hybrid networking and distribution
Hybrid networking and distribution vivek pratap singh
 
A Simulation Based Performance Comparison of Routing Protocols (Reactive and ...
A Simulation Based Performance Comparison of Routing Protocols (Reactive and ...A Simulation Based Performance Comparison of Routing Protocols (Reactive and ...
A Simulation Based Performance Comparison of Routing Protocols (Reactive and ...IOSR Journals
 
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD Editor
 
IRJET- Survey on Enhancement of Manet Routing Protocol
IRJET- Survey on Enhancement of Manet Routing ProtocolIRJET- Survey on Enhancement of Manet Routing Protocol
IRJET- Survey on Enhancement of Manet Routing ProtocolIRJET Journal
 
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
 
ENHANCING STUDENTS’ LEARNING AND SATISFACTION THROUGH THE USE OF SOCIAL MEDIA
ENHANCING STUDENTS’ LEARNING AND SATISFACTION THROUGH THE USE OF SOCIAL MEDIAENHANCING STUDENTS’ LEARNING AND SATISFACTION THROUGH THE USE OF SOCIAL MEDIA
ENHANCING STUDENTS’ LEARNING AND SATISFACTION THROUGH THE USE OF SOCIAL MEDIAIJITE
 
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
 
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
 
Progressive Routing Protocol using Hybrid Analysis for MANETs
Progressive Routing Protocol using Hybrid Analysis for MANETsProgressive Routing Protocol using Hybrid Analysis for MANETs
Progressive Routing Protocol using Hybrid Analysis for MANETsidescitation
 
Welcome to International Journal of Engineering Research and Development (IJERD)
Welcome to International Journal of Engineering Research and Development (IJERD)Welcome to International Journal of Engineering Research and Development (IJERD)
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
 

Ähnlich wie Az26337342 (20)

Network Surveillance Based Data Transference in Cognitive Radio Network with ...
Network Surveillance Based Data Transference in Cognitive Radio Network with ...Network Surveillance Based Data Transference in Cognitive Radio Network with ...
Network Surveillance Based Data Transference in Cognitive Radio Network with ...
 
H01115155
H01115155H01115155
H01115155
 
Review paper on performance analysis of AODV, DSDV, OLSR on the basis of pack...
Review paper on performance analysis of AODV, DSDV, OLSR on the basis of pack...Review paper on performance analysis of AODV, DSDV, OLSR on the basis of pack...
Review paper on performance analysis of AODV, DSDV, OLSR on the basis of pack...
 
Jb2516071610
Jb2516071610Jb2516071610
Jb2516071610
 
Jb2516071610
Jb2516071610Jb2516071610
Jb2516071610
 
Hybrid networking and distribution
Hybrid networking and distribution Hybrid networking and distribution
Hybrid networking and distribution
 
A Simulation Based Performance Comparison of Routing Protocols (Reactive and ...
A Simulation Based Performance Comparison of Routing Protocols (Reactive and ...A Simulation Based Performance Comparison of Routing Protocols (Reactive and ...
A Simulation Based Performance Comparison of Routing Protocols (Reactive and ...
 
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...
 
Ab25144148
Ab25144148Ab25144148
Ab25144148
 
Fo35991995
Fo35991995Fo35991995
Fo35991995
 
IRJET- Survey on Enhancement of Manet Routing Protocol
IRJET- Survey on Enhancement of Manet Routing ProtocolIRJET- Survey on Enhancement of Manet Routing Protocol
IRJET- Survey on Enhancement of Manet Routing Protocol
 
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...
 
ENHANCING STUDENTS’ LEARNING AND SATISFACTION THROUGH THE USE OF SOCIAL MEDIA
ENHANCING STUDENTS’ LEARNING AND SATISFACTION THROUGH THE USE OF SOCIAL MEDIAENHANCING STUDENTS’ LEARNING AND SATISFACTION THROUGH THE USE OF SOCIAL MEDIA
ENHANCING STUDENTS’ LEARNING AND SATISFACTION THROUGH THE USE OF SOCIAL MEDIA
 
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...
 
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...
 
Progressive Routing Protocol using Hybrid Analysis for MANETs
Progressive Routing Protocol using Hybrid Analysis for MANETsProgressive Routing Protocol using Hybrid Analysis for MANETs
Progressive Routing Protocol using Hybrid Analysis for MANETs
 
Ft3410671073
Ft3410671073Ft3410671073
Ft3410671073
 
Welcome to International Journal of Engineering Research and Development (IJERD)
Welcome to International Journal of Engineering Research and Development (IJERD)Welcome to International Journal of Engineering Research and Development (IJERD)
Welcome to International Journal of Engineering Research and Development (IJERD)
 
A41040105
A41040105A41040105
A41040105
 
Bh4103368374
Bh4103368374Bh4103368374
Bh4103368374
 

Az26337342

  • 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