SlideShare a Scribd company logo
Nilesh P. Bobade et al. / (IJCSE) International Journal on Computer Science and Engineering
                                                                                                  Vol. 02, No. 08, 2010, 2731-2735


   Performance Evaluation of Ad Hoc On Demand
      Distance Vector in MANETs with varying
         Network Size using NS-2 Simulation
                                              Nilesh P. Bobade1, Nitiket N. Mhala2
                                 Department of Electronics Engineering, Bapurao Deshmukh COE,
                                                Sevagram (Wardha), M.S., India.


Abstract— A mobile ad hoc network (MANET) is a collection             observation in section V and the conclusion is presented in
of wireless mobile nodes dynamically forming a network                section VI.
topology without the use of any existing network infrastructure
or centralized administration. Routing is the task of directing                           II.   RELATED WORK
data packets from a source node to a given destination. The
                                                                      Several researchers have done the qualitative and
main method for evaluating the performance of MANETs is
simulation. The On-demand protocol performs better than the           quantitative analysis of Ad Hoc Routing Protocols by means
table-driven protocol. This paper is subjected to Adhoc On            of different performance metrics. They have used different
Demand Distance Vector (AODV) routing protocol and                    simulators for this purpose.
evaluated its performance. We investigated the performance            1) J Broch et al. [1] performed experiments for performance
metrics namely Packet Delivery Fraction (PDF), Average end-           comparison of both proactive and reactive routing protocols.
to-end delay, normalized routing load and throughput by               In their Ns-2 simulation, a network size of 50 nodes with
varying network size up to 50 nodes through NS-2 simulation.          varying pause times and various movement patterns were
The performance of protocol is one of the interesting issue.          chosen.
Almost always the network protocols were simulated as a
                                                                      2) Jorg D.O. [3] studied the behavior of different routing
function of mobility, but not as a function of network density.
The main interest of this paper is to test the ability of AODV        protocols on network topology changes resulting from link
routing protocol to react on network topology changes.                breaks, node movement, etc. In his paper performance of
                                                                      routing protocols was evaluated by varying number of nodes
   Keywords- MANET, AODV, Performance Metrics, NS-2.34,               etc. But he did not investigate the performance of protocols
Simulation                                                            under heavy loads (high mobility +large number of traffic
                                                                      sources + larger number of nodes in the network), which
                     I.    INTRODUCTION                               may lead to congestion situations.
    A Mobile Ad hoc Networks (MANETs) represents a                    3)Khan et al. [4] studied and compared the performance of
system of wireless mobile nodes that can freely and                   routing protocols by using NCTUns 4.0 network simulator.
dynamically self-organize in to arbitrary and temporary               In this paper, performance of routing protocols was
network topologies, allowing people and devices to                    evaluated by varying number of nodes in multiples of 5 in
seamlessly communicate without any pre-existing                       the ad hoc network. The simulations were carried out for 70
communication architecture. Each node in the network also             seconds of the simulation time. The packet size was fixed to
acts as a router, forwarding data packets for other nodes. A          1400 bytes.
central challenge in the design of ad hoc networks is the             4) Arunkumar B R et al. [8] in this paper they present their
development of dynamic routing protocols that can
                                                                      observations regarding the performance comparison of the
efficiently find routes between two communicating nodes.
Our goal is to carry out a systematic performance study of on         routing protocols for variable bit rate (VBR) in mobile ad
demand routing protocol AODV [14] for ad hoc networks.                hoc networks (MANETs). They perform extensive
Moreover our performance analysis is based on varying                 simulations, using NS-2 simulator [13]. Their studies have
number of nodes in the Mobile Ad Hoc Network. Generally               shown that reactive protocols perform better than proactive
always the network protocols were simulated as a function of          protocols.
pause time, but not as a function of network size. The rest of        5) S. Gowrishanker et al [9] performed the Analysis of
the paper is organized as follows: The related work is                AODV and OLSR by using NS-2 simulator, the simulation
provided in section II. The AODV routing protocol                     period for each scenario was 900 seconds and the simulated
Description is summarized in section III. The simulation              mobility network area was 800 m x 500 m rectangle. In
environment and performance metrics are described in                  each simulation scenario, the nodes were initially located at
Section IV. We present the simulation results and                     the center of the simulation region. The nodes start moving
                                                                      after the first 10 seconds of simulated time. The application



ISSN : 0975-3397                                                                                                             2731
Nilesh P. Bobade et al. / (IJCSE) International Journal on Computer Science and Engineering
                                                                                                    Vol. 02, No. 08, 2010, 2731-2735

used to generate is CBR traffic and IP is used as Network               10 breaks the upstream node that is affected by the break, in
layer protocol.                                                         this case node 4 generates and broadcasts a RERR message.
6) N Vetrivelan & Dr. A V Reddy [10] analyzed the                       The RERR message eventually ends up in source node 1.
performance differentials using varying network size and                After receiving the RERR message, node 1 will generate a
simulation times. They performed two simulation                         new RREQ message (Fig. 2).
experiments for 10 & 25 nodes for simulation time up to
100 sec.
7) S. P. Setty et.al.[6] evaluated the performance of existing
wireless routing protocol AODV in various nodes placement
models like Grid, Random and Uniform using QualNet 5.0.
       III.   AODV ROUTING PROTOCOL DESCRIPTION
     Ad hoc On Demand Distance Vector (AODV) [14] is a
reactive routing protocol which initiates a route discovery
process only when it has data packets to send and it does not
know any route to the destination node, that is, route
discovery in AODV is “on-demand”. AODV uses sequence
numbers maintained at each destination to determine
freshness of routing information and to avoid the routing
loops that may occur during the routing calculation process.
All routing packets carry these sequence numbers.
        A. Route Discovery Process
    During a route discovery process, the source node                             Figure 2. AODV Route Error message generation
broadcasts a route query packet to its neighbors. If any of the
neighbors has a route to the destination, it replies to the                    C. AODV Route Maintenance Process
query with a route reply packet; otherwise, the neighbors
                                                                           Finally, if node 2 already has a route to node 10, it will
rebroadcast the route query packet. Finally, some query
                                                                        generate a RREP message, as indicated in Figure 3.
packets reach to the destination.
                                                                        Otherwise, it will re-broadcast the RREQ from source node
                                                                        1 to destination node 10 as shown in “Fig. 3”.




                                                                                    Figure 3. AODV Route Maintenance Process
              Figure 1. AODV Route Discovery Process
                                                                                     IV.    SIMULATION ENVIRONMENT
     “Fig. 1” shows the route discovery process from source
node1 to destination node 10. At that time, a reply packet is                  A. Simulation Model
produced and transmitted tracing back the route traversed by                 Here we give the emphasis for the evaluation of
the query packet as shown in “Fig. 1”.
                                                                        performance of Ad Hoc routing protocol AODV with
        B. AODV Route Message Generation                                varying the number of mobile nodes. The simulations have
                                                                        been performed using network simulator NS-2 [13]. The
    The route maintenance process in AODV is very
                                                                        network simulator ns-2 is discrete event simulation software
simple. When the link in the path between node 1 and node
                                                                        for network simulations which means it simulates events




ISSN : 0975-3397                                                                                                                  2732
Nilesh P. Bobade et al. / (IJCSE) International Journal on Computer Science and Engineering
                                                                                                     Vol. 02, No. 08, 2010, 2731-2735

such as sending, receiving, forwarding and dropping                         Average End to end delay: The average time from the
packets. The latest version, ns-allinone-2.34, supports                  beginning of a packet transmission at a source node until
simulation for routing protocols for ad hoc wireless                     packet delivery to a destination. This includes all possible
networks such as AODV, TORA, DSDV, and DSR. Ns-2 is                      delays caused by buffering during route discovery latency,
written in C++ programming language and Object Tool                      queuing at the interface queue, retransmission delays at the
Common Language (OTCL). Although ns-2.34 can be built                    MAC, and propagation and transfer times of data packets.
on various platforms, we chose a Linux platform [FEDORA                  Calculate the send(S) time (t) and receive (R) time (T) and
7] for this paper, as Linux offers a number of programming               average it.
development tools that can be used along with the
simulation process. To run a simulation with ns-2.34, the                    Normalized Routing Load: The normalized routing
user must write the simulation script in OTCL, get the                   load is defined as the fraction of all routing control packets
simulation results in an output trace file and here, we                  sent by all nodes over the number of received data packets
analyzed the experimental results by using the awk                       at the destination nodes.
command (Fig. 5).The performance metrics are graphically
visualized in XGRAPH 12.1(Fig. 6,7,8,9). Ns-2 also offers a                 Throughput: Throughput is the average number of
visual representation of the simulated network by tracing                messages successfully delivered per unit time i.e. average
nodes movements and events and writing them in a network                 number of bits delivered per second.
animator (NAM) file (Fig. 4).                                                    V.    SIMULATION RESULTS & OBESRVATION
       B. Simulation Parameters                                              The simulation results are shown in the following section
   We consider a network of nodes placing within a 1000m                 in the form of line graphs. The performance of AODV based
X 1000m area. The performance of AODV is evaluated by                    on the varying the number of nodes is done on parameters
keeping the network speed and pause time constant and                    like packet delivery fraction and average end-to-end delay,
varying the network size (number of mobile nodes).Table 1                normalized routing load and throughput.
shows the simulation parameters used in this evaluation.
                                                                            “Fig. 4” shows the creation of clusters with 50 mobile
       TABLE 1: PARAMETERS VALUES FOR AODV SIMULATION
                                                                         nodes as it is shown in the NAM console which is a built-in
                                                                         program in NS-2-allinone package after the end of the
                        Simulation Parameters                            simulation process.
            Simulator                           ns-2.34
             Protocol                           AODV
        Simulation duration                200 seconds
         Simulation area                 1000 m x 1000 m
                                          5,10,15,20,25,
         Number of nodes
                                          30,35,40,45,50
        Transmission range                      250 m
         Movement model                 Random Waypoint
       MAC Layer Protocol                  IEEE 802.11
           Pause Time                           100 sec
         Maximum speed                          20 m/s
            Packet rate                   4 packets/sec
           Traffic type                    CBR (UDP)                               Figure 4. AODV with 50 nodes: Route Discovery
           Data payload                    512 bytes/packet
                                                                            “Fig. 5” shows the calculation of send, received packets,
       C. Performance Metrics                                            PDF, average end-to-end delay, normalized routing load and
   While analyzed the AODV protocol, we focused on two                   etc. for AODV simulation with 50 nodes by running AWK
performance metrics which are Packet Delivery Fraction                   script for it.
(PDF), Average End-to-End Delay, Normalized Routing
Load (NRL) and throughput.
   Packet delivery fraction: The fraction of all the
received data packets successfully at the destinations over
the number of data packets sent by the CBR sources is
known as Packet delivery fraction.



ISSN : 0975-3397                                                                                                                   2733
Nilesh P. Bobade et al. / (IJCSE) International Journal on Computer Science and Engineering
                                                                                                        Vol. 02, No. 08, 2010, 2731-2735

                                                                               From “Fig. 8” we can observed that the normalized
                                                                            routing load is initially low for less number of nodes but it
                                                                            increases with , varying the network size because in AODV
                                                                            routing load is dominated by route requests as a part of route
                                                                            discovery process.




        Figure 5. Snapshot of the results of performance metrics

   “Fig. 6” highlights the relative performance of AODV i.e.
it delivers a greater percentage of the originated data (above
99%). From figure it is observed that the performance of
AODV is consistently uniform between 99.5 & 99.7 %.


                                                                                Figure 8. Normalized routing Load Vs Number of Mobile Nodes

                                                                               In case of AODV protocol when number of nodes
                                                                            increases, initially throughput increases as large number of
                                                                            routes are available but after a certain limit throughput
                                                                            becomes stable. Figure shows that the ability of the AODV
                                                                            to deliver packets to their destination degrades as the
                                                                            network size increases (Fig. 9).




    Figure 6. Packet Delivery Fraction Vs Number of Mobile Nodes




                                                                                      Figure 9. Throughput Vs Number of Mobile Nodes

                                                                                                  VI. CONCLUSION
                                                                              In this presented simulation work, the AODV routing
                                                                            protocol is evaluated for the application oriented
                                                                            performance metrics such as packet delivery fraction,
                                                                            average end-to-end delay, normalized routing load and
 Figure 7. Average End-to-End Delay (ms) Vs Number of Mobile Nodes          average throughput with increasing the number of mobile
                                                                            nodes up to 50. As we increase the number of nodes for
   For average end-to-end delay, the performance of AODV
                                                                            performing the simulation of AODV routing protocol,
is almost uniform (below 180 ms) except for 40 nodes (Fig.
7).



ISSN : 0975-3397                                                                                                                          2734
Nilesh P. Bobade et al. / (IJCSE) International Journal on Computer Science and Engineering
                                                                                                        Vol. 02, No. 08, 2010, 2731-2735

number of sent, routing and delivered packets changes,                            Available at http: //www. isi.edu/nsnam/ns/doc.
hence the performance parameters changes.                                      [14] C. E. Perkins, E. M. Royer, and S. R. Das, “Ad Hoc On- Demand
As a result of our studies, we conclude that AODV exhibits                        Distance Vector (AODV) Routing”, Internet Draft, draft-ietf-manet-
a better performance in terms of packet delivery fraction and                    aodv-10.txt, work in progress, 2002.
average end-to-end delay with increasing number of mobile                                            AUTHORS PROFILE
nodes due to its on demand characteristics to determine the                                            Nilesh P. Bobade is persuing M.Tech in
freshness of the routes. It suits where end-to-end delays are                                          Electronics Engineering from RTM Nagpur
very critical. Also it can be said that the AODV has higher                                            University, Nagpur, India. He received his
                                                                                                       B.E. degree in Electronics Engineering from
normalized routing load. Our result also indicates that as the                                         RTM Nagpur University, Nagpur in year
number of nodes in the network increases AODV gives                                                    1996. He is currently working as Assistant
nearly constant throughput. Considering the overall                                                    Professor in the Department of Electronics
performance of AODV it performs well with varying                                                      Engineering, BDCOE, Sevagram, Wardha,
                                                                                                       M.S., India. He is a life member of Indian
network size.                                                                                          Socirty for Technical Education. His research
                                                                                                       interests include computer networks and
                            REFERENCES                                      embedded systems.
[1]   J. Broch, D. A. Maltz, D. B. Johnson, Y. C. Hu, and J. Jetcheva”, A
      Performance Comparison of Multi-Hop Wireless Network Routing
                                                                                                           Mr. Nitiket N. Mhala is persuing PhD
      Protocols,” Proceedings of the Fourth Annual ACM/IEEE
                                                                                                          student and also working as Associatet
      International Conference on Mobile Computing and Networking
                                                                                                          Professor and Head in the Department of
      (MobiCom’98), October 25-30, 1998,Dallas,Texas,USA,pp.25-30.
                                                                                                          Electronic Engineering, Sevagram, India. He
[2] S. R. Das, C. E. Perkins, and E. M. Royer, “Performance Comparison                                    received his ME Degree from RM Institute of
      of Two On-Demand Routing Protocols for Ad Hoc Networks “, IEEE                                      Research     and    Technology,    Badnera,
      Personal Communications Magazine, Special Issue on Mobile Ad                                        Amravati University and B.E. Degree from
      Hoc Networks, Vol. 8, No. 1, February 2001,pp.16-29.                                                Govt. College of Engineering, Amravati,
      [3]     D. O. Jorg, “Performance Comparison of MANET Routing                                        Amravati University. He published a Book
      Protocols In Different Network Sizes”, Computer Networks & Distri-                                  Entitled PC Architecture and Maintenance.
      buted Systems, 2003.                                                  He is a member of Institute of Electronics and Telecommunication
                                                                            Engineer (IETE). His area of interest spans Data communication, Computer
[4] K U Khan, R U Zaman, A. Venugopal Reddy,“Performance                    network and Wireless Ad hoc networks. He published research papers at
      Comparison of On-Demand and Table Driven Ad HocRouting                National and International level.
      Protocols using NCTUns ”, Tenth International Conference on
      Computer Modeling and Simulation, 2008.
[5] Saurabh gupta “ANALYSIS OF SIMULATION OF AD-HOC ON
      DEMAND DISTANCE VECTOR ROUTING PROTOCOL”,
      National Conference on Advanced Computing and Communication
      Technology ACCT-10
[6] S.P. Setty et. al., “PERFORMANCE EVALUATION OF AODV IN
      DIFFERENT ENVIRONMENTS”, International Journal of
      Engineering Science and Technology Vol. 2(7), 2010, 2976-2981
[7] Boukerche A., “Performance comparison and analysis of ad hoc
      routing algorithms”, IEEE International Conference on. Performance,
      Computing, and Communications, 2001, Apr 2001, pp 171-178.
[8] Arun Kumar B. R., Lokanatha C. Reddy, Prakash.S.Hiremath,
      “Performance Comparison of Wireless Mobile Ad-Hoc Network
      Routing Protocols” IJCSNS International Journal of Computer
      Science and Network Security VOL.8 No.6,June 2008.
[9] S. Gowrishankar, T.G. Basavaraju, M.Singh, Subir Kumar Sarkar,
      “Scenario based Performance Analysis of AODV and OLSR in
      Mobile Ad Hoc Networks”, Proceedings of the 24th South East Asia
      Regional Computer Conference, November 18-19, 2007, Bangkok,
      Thailand.
[10] N Vetrivelan, Dr. A V Reddy, “ Performance Analysis of Three
      Routing Protocols for Varying MANET Size”, Proceeding of the
      International MultiConference of Engineers and Computer Scientists
      2008 Vol II, IMECS 2008,19-21 March, 2008, Hong Kong.
11] Abdul Hadi Abd Rahman and Zuriati Ahmad Zukarnain, “Performance
      Comparison of AODV, DSDV and I-DSDV Routing Protocols in
      Mobile Ad Hoc networks”, European Journal of Scientific Research
      ISSN 1450- 216X Vol.31 No.4 (2009).pp.566-576.
 [12] E. M. Royer, and C.K. Toh, “A Review of Current Routing Protocols
      for Ad Hoc Mobile Wireless Networks”, IEEE Personal
      Communications, Vol. 6, Issue 2, pp. 46-55, April 1999.
 [13] NS -2, The ns Manual (formally known as NS Documentation)




ISSN : 0975-3397                                                                                                                               2735

More Related Content

What's hot

Iterative network channel decoding with cooperative space-time transmission
Iterative network channel decoding with cooperative space-time transmissionIterative network channel decoding with cooperative space-time transmission
Iterative network channel decoding with cooperative space-time transmission
ijasuc
 
K017426872
K017426872K017426872
K017426872
IOSR Journals
 
Fpga based low power and high performance address generator for wimax deinter...
Fpga based low power and high performance address generator for wimax deinter...Fpga based low power and high performance address generator for wimax deinter...
Fpga based low power and high performance address generator for wimax deinter...
eSAT Journals
 
Fpga based low power and high performance address
Fpga based low power and high performance addressFpga based low power and high performance address
Fpga based low power and high performance address
eSAT Publishing House
 
IMPROVED EXTENDED XY ON-CHIP ROUTING IN DIAMETRICAL 2D MESH NOC
IMPROVED EXTENDED XY ON-CHIP ROUTING IN DIAMETRICAL 2D MESH NOCIMPROVED EXTENDED XY ON-CHIP ROUTING IN DIAMETRICAL 2D MESH NOC
IMPROVED EXTENDED XY ON-CHIP ROUTING IN DIAMETRICAL 2D MESH NOC
VLSICS Design
 
Joint Fixed Power Allocation and Partial Relay Selection Schemes for Cooperat...
Joint Fixed Power Allocation and Partial Relay Selection Schemes for Cooperat...Joint Fixed Power Allocation and Partial Relay Selection Schemes for Cooperat...
Joint Fixed Power Allocation and Partial Relay Selection Schemes for Cooperat...
TELKOMNIKA JOURNAL
 
Q01742112115
Q01742112115Q01742112115
Q01742112115
IOSR Journals
 
N017428692
N017428692N017428692
N017428692
IOSR Journals
 
DIFFERENTIATED SERVICES ENSURING QOS ON INTERNET
DIFFERENTIATED SERVICES ENSURING QOS ON INTERNETDIFFERENTIATED SERVICES ENSURING QOS ON INTERNET
DIFFERENTIATED SERVICES ENSURING QOS ON INTERNET
ijcseit
 
A Fault-tolerant Switch for Next Generation Computer Networks
A Fault-tolerant Switch for Next Generation Computer NetworksA Fault-tolerant Switch for Next Generation Computer Networks
A Fault-tolerant Switch for Next Generation Computer Networks
IDES Editor
 
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
 
Implementation of Pipelined Architecture for Physical Downlink Channels of 3G...
Implementation of Pipelined Architecture for Physical Downlink Channels of 3G...Implementation of Pipelined Architecture for Physical Downlink Channels of 3G...
Implementation of Pipelined Architecture for Physical Downlink Channels of 3G...
ijngnjournal
 
Towards the Performance Analysis of IEEE 802.11 in Multi-hop Ad-Hoc Networks
Towards the Performance Analysis of IEEE 802.11 in Multi-hop Ad-Hoc NetworksTowards the Performance Analysis of IEEE 802.11 in Multi-hop Ad-Hoc Networks
Towards the Performance Analysis of IEEE 802.11 in Multi-hop Ad-Hoc Networks
ambitlick
 
Quartz crystal microbalance based electronic nose system implemented on Field...
Quartz crystal microbalance based electronic nose system implemented on Field...Quartz crystal microbalance based electronic nose system implemented on Field...
Quartz crystal microbalance based electronic nose system implemented on Field...
TELKOMNIKA JOURNAL
 
A comparative analysis on routing
A comparative analysis on routingA comparative analysis on routing
A comparative analysis on routing
ijcseit
 
Multi carrier equalization by restoration of redundanc y (merry) for adaptive...
Multi carrier equalization by restoration of redundanc y (merry) for adaptive...Multi carrier equalization by restoration of redundanc y (merry) for adaptive...
Multi carrier equalization by restoration of redundanc y (merry) for adaptive...
IJNSA Journal
 
Adaptive Channel Equalization using Multilayer Perceptron Neural Networks wit...
Adaptive Channel Equalization using Multilayer Perceptron Neural Networks wit...Adaptive Channel Equalization using Multilayer Perceptron Neural Networks wit...
Adaptive Channel Equalization using Multilayer Perceptron Neural Networks wit...
IOSRJVSP
 

What's hot (18)

Iterative network channel decoding with cooperative space-time transmission
Iterative network channel decoding with cooperative space-time transmissionIterative network channel decoding with cooperative space-time transmission
Iterative network channel decoding with cooperative space-time transmission
 
K017426872
K017426872K017426872
K017426872
 
04020470
0402047004020470
04020470
 
Fpga based low power and high performance address generator for wimax deinter...
Fpga based low power and high performance address generator for wimax deinter...Fpga based low power and high performance address generator for wimax deinter...
Fpga based low power and high performance address generator for wimax deinter...
 
Fpga based low power and high performance address
Fpga based low power and high performance addressFpga based low power and high performance address
Fpga based low power and high performance address
 
IMPROVED EXTENDED XY ON-CHIP ROUTING IN DIAMETRICAL 2D MESH NOC
IMPROVED EXTENDED XY ON-CHIP ROUTING IN DIAMETRICAL 2D MESH NOCIMPROVED EXTENDED XY ON-CHIP ROUTING IN DIAMETRICAL 2D MESH NOC
IMPROVED EXTENDED XY ON-CHIP ROUTING IN DIAMETRICAL 2D MESH NOC
 
Joint Fixed Power Allocation and Partial Relay Selection Schemes for Cooperat...
Joint Fixed Power Allocation and Partial Relay Selection Schemes for Cooperat...Joint Fixed Power Allocation and Partial Relay Selection Schemes for Cooperat...
Joint Fixed Power Allocation and Partial Relay Selection Schemes for Cooperat...
 
Q01742112115
Q01742112115Q01742112115
Q01742112115
 
N017428692
N017428692N017428692
N017428692
 
DIFFERENTIATED SERVICES ENSURING QOS ON INTERNET
DIFFERENTIATED SERVICES ENSURING QOS ON INTERNETDIFFERENTIATED SERVICES ENSURING QOS ON INTERNET
DIFFERENTIATED SERVICES ENSURING QOS ON INTERNET
 
A Fault-tolerant Switch for Next Generation Computer Networks
A Fault-tolerant Switch for Next Generation Computer NetworksA Fault-tolerant Switch for Next Generation Computer Networks
A Fault-tolerant Switch for Next Generation Computer Networks
 
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...
 
Implementation of Pipelined Architecture for Physical Downlink Channels of 3G...
Implementation of Pipelined Architecture for Physical Downlink Channels of 3G...Implementation of Pipelined Architecture for Physical Downlink Channels of 3G...
Implementation of Pipelined Architecture for Physical Downlink Channels of 3G...
 
Towards the Performance Analysis of IEEE 802.11 in Multi-hop Ad-Hoc Networks
Towards the Performance Analysis of IEEE 802.11 in Multi-hop Ad-Hoc NetworksTowards the Performance Analysis of IEEE 802.11 in Multi-hop Ad-Hoc Networks
Towards the Performance Analysis of IEEE 802.11 in Multi-hop Ad-Hoc Networks
 
Quartz crystal microbalance based electronic nose system implemented on Field...
Quartz crystal microbalance based electronic nose system implemented on Field...Quartz crystal microbalance based electronic nose system implemented on Field...
Quartz crystal microbalance based electronic nose system implemented on Field...
 
A comparative analysis on routing
A comparative analysis on routingA comparative analysis on routing
A comparative analysis on routing
 
Multi carrier equalization by restoration of redundanc y (merry) for adaptive...
Multi carrier equalization by restoration of redundanc y (merry) for adaptive...Multi carrier equalization by restoration of redundanc y (merry) for adaptive...
Multi carrier equalization by restoration of redundanc y (merry) for adaptive...
 
Adaptive Channel Equalization using Multilayer Perceptron Neural Networks wit...
Adaptive Channel Equalization using Multilayer Perceptron Neural Networks wit...Adaptive Channel Equalization using Multilayer Perceptron Neural Networks wit...
Adaptive Channel Equalization using Multilayer Perceptron Neural Networks wit...
 

Similar to Evaluation aodv

COMPARATIVE STUDY FOR PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS IN MOBILITY A...
COMPARATIVE STUDY FOR PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS IN MOBILITY A...COMPARATIVE STUDY FOR PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS IN MOBILITY A...
COMPARATIVE STUDY FOR PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS IN MOBILITY A...
eeiej_journal
 
COMPARATIVE STUDY FOR PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS IN MOBILITY A...
COMPARATIVE STUDY FOR PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS IN MOBILITY A...COMPARATIVE STUDY FOR PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS IN MOBILITY A...
COMPARATIVE STUDY FOR PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS IN MOBILITY A...
ijrap
 
Comparative Study for Performance Analysis of Routing Protocols in Mobility a...
Comparative Study for Performance Analysis of Routing Protocols in Mobility a...Comparative Study for Performance Analysis of Routing Protocols in Mobility a...
Comparative Study for Performance Analysis of Routing Protocols in Mobility a...
eeiej
 
Design Test-bed for assessing load utilising using Multicast Forwarding Appro...
Design Test-bed for assessing load utilising using Multicast Forwarding Appro...Design Test-bed for assessing load utilising using Multicast Forwarding Appro...
Design Test-bed for assessing load utilising using Multicast Forwarding Appro...
IOSR Journals
 
Performance evaluation of different routing protocols in wsn using different ...
Performance evaluation of different routing protocols in wsn using different ...Performance evaluation of different routing protocols in wsn using different ...
Performance evaluation of different routing protocols in wsn using different ...Dr Sandeep Kumar Poonia
 
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
 
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 MEDIA
IJITE
 
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
 
Evaluating feasibility of using wireless sensor networks in a coffee crop thr...
Evaluating feasibility of using wireless sensor networks in a coffee crop thr...Evaluating feasibility of using wireless sensor networks in a coffee crop thr...
Evaluating feasibility of using wireless sensor networks in a coffee crop thr...
IJCNCJournal
 
Performance evaluation of diff routing protocols in wsn using difft network p...
Performance evaluation of diff routing protocols in wsn using difft network p...Performance evaluation of diff routing protocols in wsn using difft network p...
Performance evaluation of diff routing protocols in wsn using difft network p...
Dr Sandeep Kumar Poonia
 
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
 
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
 
Ho2413421346
Ho2413421346Ho2413421346
Ho2413421346
IJERA Editor
 
Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...
Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...
Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...
ijsrd.com
 

Similar to Evaluation aodv (20)

COMPARATIVE STUDY FOR PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS IN MOBILITY A...
COMPARATIVE STUDY FOR PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS IN MOBILITY A...COMPARATIVE STUDY FOR PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS IN MOBILITY A...
COMPARATIVE STUDY FOR PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS IN MOBILITY A...
 
COMPARATIVE STUDY FOR PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS IN MOBILITY A...
COMPARATIVE STUDY FOR PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS IN MOBILITY A...COMPARATIVE STUDY FOR PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS IN MOBILITY A...
COMPARATIVE STUDY FOR PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS IN MOBILITY A...
 
Comparative Study for Performance Analysis of Routing Protocols in Mobility a...
Comparative Study for Performance Analysis of Routing Protocols in Mobility a...Comparative Study for Performance Analysis of Routing Protocols in Mobility a...
Comparative Study for Performance Analysis of Routing Protocols in Mobility a...
 
Ip2515381543
Ip2515381543Ip2515381543
Ip2515381543
 
Ip2515381543
Ip2515381543Ip2515381543
Ip2515381543
 
Ns2 x graphs
Ns2 x graphsNs2 x graphs
Ns2 x graphs
 
Design Test-bed for assessing load utilising using Multicast Forwarding Appro...
Design Test-bed for assessing load utilising using Multicast Forwarding Appro...Design Test-bed for assessing load utilising using Multicast Forwarding Appro...
Design Test-bed for assessing load utilising using Multicast Forwarding Appro...
 
Performance evaluation of different routing protocols in wsn using different ...
Performance evaluation of different routing protocols in wsn using different ...Performance evaluation of different routing protocols in wsn using different ...
Performance evaluation of different routing protocols in wsn using different ...
 
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...
 
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...
 
2 sima singh-6-13
2 sima singh-6-132 sima singh-6-13
2 sima singh-6-13
 
Evaluating feasibility of using wireless sensor networks in a coffee crop thr...
Evaluating feasibility of using wireless sensor networks in a coffee crop thr...Evaluating feasibility of using wireless sensor networks in a coffee crop thr...
Evaluating feasibility of using wireless sensor networks in a coffee crop thr...
 
Performance evaluation of diff routing protocols in wsn using difft network p...
Performance evaluation of diff routing protocols in wsn using difft network p...Performance evaluation of diff routing protocols in wsn using difft network p...
Performance evaluation of diff routing protocols in wsn using difft network p...
 
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...
 
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...
 
Ho2413421346
Ho2413421346Ho2413421346
Ho2413421346
 
Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...
Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...
Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...
 

More from Gilles Samba

Installation et configuration asterisk
Installation et configuration asteriskInstallation et configuration asterisk
Installation et configuration asteriskGilles Samba
 
Architecture reseau mobile
Architecture reseau mobileArchitecture reseau mobile
Architecture reseau mobileGilles Samba
 
Etude des modeles_ns2
Etude des modeles_ns2Etude des modeles_ns2
Etude des modeles_ns2Gilles Samba
 
Mpls foudhaili oussama
Mpls foudhaili oussamaMpls foudhaili oussama
Mpls foudhaili oussamaGilles Samba
 
4 g americas glossary of wireless acronyms 2012
4 g americas glossary of wireless acronyms 20124 g americas glossary of wireless acronyms 2012
4 g americas glossary of wireless acronyms 2012Gilles Samba
 
4 ir be-dimensionnement_interface_radio_2012_v3
4 ir be-dimensionnement_interface_radio_2012_v34 ir be-dimensionnement_interface_radio_2012_v3
4 ir be-dimensionnement_interface_radio_2012_v3Gilles Samba
 
4 ir be-dimensionnement_interface_radio_2012_v3
4 ir be-dimensionnement_interface_radio_2012_v34 ir be-dimensionnement_interface_radio_2012_v3
4 ir be-dimensionnement_interface_radio_2012_v3Gilles Samba
 
Cour simulation ns2
Cour simulation ns2Cour simulation ns2
Cour simulation ns2Gilles Samba
 
Asterisk to ip_rapport
Asterisk to ip_rapportAsterisk to ip_rapport
Asterisk to ip_rapportGilles Samba
 
2 architecture reseau-mobile
2 architecture reseau-mobile2 architecture reseau-mobile
2 architecture reseau-mobileGilles Samba
 

More from Gilles Samba (18)

Asterisk trixbox
Asterisk trixboxAsterisk trixbox
Asterisk trixbox
 
Installation et configuration asterisk
Installation et configuration asteriskInstallation et configuration asterisk
Installation et configuration asterisk
 
Architecture reseau mobile
Architecture reseau mobileArchitecture reseau mobile
Architecture reseau mobile
 
Apport de la_lte
Apport de la_lteApport de la_lte
Apport de la_lte
 
Acces umts efort
Acces umts efortAcces umts efort
Acces umts efort
 
Cours ipv6pdf
Cours ipv6pdfCours ipv6pdf
Cours ipv6pdf
 
Etude des modeles_ns2
Etude des modeles_ns2Etude des modeles_ns2
Etude des modeles_ns2
 
Mpls foudhaili oussama
Mpls foudhaili oussamaMpls foudhaili oussama
Mpls foudhaili oussama
 
4 g evolution
4 g evolution4 g evolution
4 g evolution
 
4 g
4 g4 g
4 g
 
4 g americas glossary of wireless acronyms 2012
4 g americas glossary of wireless acronyms 20124 g americas glossary of wireless acronyms 2012
4 g americas glossary of wireless acronyms 2012
 
4 g lte
4 g lte4 g lte
4 g lte
 
4 ir be-dimensionnement_interface_radio_2012_v3
4 ir be-dimensionnement_interface_radio_2012_v34 ir be-dimensionnement_interface_radio_2012_v3
4 ir be-dimensionnement_interface_radio_2012_v3
 
Umts et wan
Umts et wanUmts et wan
Umts et wan
 
4 ir be-dimensionnement_interface_radio_2012_v3
4 ir be-dimensionnement_interface_radio_2012_v34 ir be-dimensionnement_interface_radio_2012_v3
4 ir be-dimensionnement_interface_radio_2012_v3
 
Cour simulation ns2
Cour simulation ns2Cour simulation ns2
Cour simulation ns2
 
Asterisk to ip_rapport
Asterisk to ip_rapportAsterisk to ip_rapport
Asterisk to ip_rapport
 
2 architecture reseau-mobile
2 architecture reseau-mobile2 architecture reseau-mobile
2 architecture reseau-mobile
 

Evaluation aodv

  • 1. Nilesh P. Bobade et al. / (IJCSE) International Journal on Computer Science and Engineering Vol. 02, No. 08, 2010, 2731-2735 Performance Evaluation of Ad Hoc On Demand Distance Vector in MANETs with varying Network Size using NS-2 Simulation Nilesh P. Bobade1, Nitiket N. Mhala2 Department of Electronics Engineering, Bapurao Deshmukh COE, Sevagram (Wardha), M.S., India. Abstract— A mobile ad hoc network (MANET) is a collection observation in section V and the conclusion is presented in of wireless mobile nodes dynamically forming a network section VI. topology without the use of any existing network infrastructure or centralized administration. Routing is the task of directing II. RELATED WORK data packets from a source node to a given destination. The Several researchers have done the qualitative and main method for evaluating the performance of MANETs is simulation. The On-demand protocol performs better than the quantitative analysis of Ad Hoc Routing Protocols by means table-driven protocol. This paper is subjected to Adhoc On of different performance metrics. They have used different Demand Distance Vector (AODV) routing protocol and simulators for this purpose. evaluated its performance. We investigated the performance 1) J Broch et al. [1] performed experiments for performance metrics namely Packet Delivery Fraction (PDF), Average end- comparison of both proactive and reactive routing protocols. to-end delay, normalized routing load and throughput by In their Ns-2 simulation, a network size of 50 nodes with varying network size up to 50 nodes through NS-2 simulation. varying pause times and various movement patterns were The performance of protocol is one of the interesting issue. chosen. Almost always the network protocols were simulated as a 2) Jorg D.O. [3] studied the behavior of different routing function of mobility, but not as a function of network density. The main interest of this paper is to test the ability of AODV protocols on network topology changes resulting from link routing protocol to react on network topology changes. breaks, node movement, etc. In his paper performance of routing protocols was evaluated by varying number of nodes Keywords- MANET, AODV, Performance Metrics, NS-2.34, etc. But he did not investigate the performance of protocols Simulation under heavy loads (high mobility +large number of traffic sources + larger number of nodes in the network), which I. INTRODUCTION may lead to congestion situations. A Mobile Ad hoc Networks (MANETs) represents a 3)Khan et al. [4] studied and compared the performance of system of wireless mobile nodes that can freely and routing protocols by using NCTUns 4.0 network simulator. dynamically self-organize in to arbitrary and temporary In this paper, performance of routing protocols was network topologies, allowing people and devices to evaluated by varying number of nodes in multiples of 5 in seamlessly communicate without any pre-existing the ad hoc network. The simulations were carried out for 70 communication architecture. Each node in the network also seconds of the simulation time. The packet size was fixed to acts as a router, forwarding data packets for other nodes. A 1400 bytes. central challenge in the design of ad hoc networks is the 4) Arunkumar B R et al. [8] in this paper they present their development of dynamic routing protocols that can observations regarding the performance comparison of the efficiently find routes between two communicating nodes. Our goal is to carry out a systematic performance study of on routing protocols for variable bit rate (VBR) in mobile ad demand routing protocol AODV [14] for ad hoc networks. hoc networks (MANETs). They perform extensive Moreover our performance analysis is based on varying simulations, using NS-2 simulator [13]. Their studies have number of nodes in the Mobile Ad Hoc Network. Generally shown that reactive protocols perform better than proactive always the network protocols were simulated as a function of protocols. pause time, but not as a function of network size. The rest of 5) S. Gowrishanker et al [9] performed the Analysis of the paper is organized as follows: The related work is AODV and OLSR by using NS-2 simulator, the simulation provided in section II. The AODV routing protocol period for each scenario was 900 seconds and the simulated Description is summarized in section III. The simulation mobility network area was 800 m x 500 m rectangle. In environment and performance metrics are described in each simulation scenario, the nodes were initially located at Section IV. We present the simulation results and the center of the simulation region. The nodes start moving after the first 10 seconds of simulated time. The application ISSN : 0975-3397 2731
  • 2. Nilesh P. Bobade et al. / (IJCSE) International Journal on Computer Science and Engineering Vol. 02, No. 08, 2010, 2731-2735 used to generate is CBR traffic and IP is used as Network 10 breaks the upstream node that is affected by the break, in layer protocol. this case node 4 generates and broadcasts a RERR message. 6) N Vetrivelan & Dr. A V Reddy [10] analyzed the The RERR message eventually ends up in source node 1. performance differentials using varying network size and After receiving the RERR message, node 1 will generate a simulation times. They performed two simulation new RREQ message (Fig. 2). experiments for 10 & 25 nodes for simulation time up to 100 sec. 7) S. P. Setty et.al.[6] evaluated the performance of existing wireless routing protocol AODV in various nodes placement models like Grid, Random and Uniform using QualNet 5.0. III. AODV ROUTING PROTOCOL DESCRIPTION Ad hoc On Demand Distance Vector (AODV) [14] is a reactive routing protocol which initiates a route discovery process only when it has data packets to send and it does not know any route to the destination node, that is, route discovery in AODV is “on-demand”. AODV uses sequence numbers maintained at each destination to determine freshness of routing information and to avoid the routing loops that may occur during the routing calculation process. All routing packets carry these sequence numbers. A. Route Discovery Process During a route discovery process, the source node Figure 2. AODV Route Error message generation broadcasts a route query packet to its neighbors. If any of the neighbors has a route to the destination, it replies to the C. AODV Route Maintenance Process query with a route reply packet; otherwise, the neighbors Finally, if node 2 already has a route to node 10, it will rebroadcast the route query packet. Finally, some query generate a RREP message, as indicated in Figure 3. packets reach to the destination. Otherwise, it will re-broadcast the RREQ from source node 1 to destination node 10 as shown in “Fig. 3”. Figure 3. AODV Route Maintenance Process Figure 1. AODV Route Discovery Process IV. SIMULATION ENVIRONMENT “Fig. 1” shows the route discovery process from source node1 to destination node 10. At that time, a reply packet is A. Simulation Model produced and transmitted tracing back the route traversed by Here we give the emphasis for the evaluation of the query packet as shown in “Fig. 1”. performance of Ad Hoc routing protocol AODV with B. AODV Route Message Generation varying the number of mobile nodes. The simulations have been performed using network simulator NS-2 [13]. The The route maintenance process in AODV is very network simulator ns-2 is discrete event simulation software simple. When the link in the path between node 1 and node for network simulations which means it simulates events ISSN : 0975-3397 2732
  • 3. Nilesh P. Bobade et al. / (IJCSE) International Journal on Computer Science and Engineering Vol. 02, No. 08, 2010, 2731-2735 such as sending, receiving, forwarding and dropping  Average End to end delay: The average time from the packets. The latest version, ns-allinone-2.34, supports beginning of a packet transmission at a source node until simulation for routing protocols for ad hoc wireless packet delivery to a destination. This includes all possible networks such as AODV, TORA, DSDV, and DSR. Ns-2 is delays caused by buffering during route discovery latency, written in C++ programming language and Object Tool queuing at the interface queue, retransmission delays at the Common Language (OTCL). Although ns-2.34 can be built MAC, and propagation and transfer times of data packets. on various platforms, we chose a Linux platform [FEDORA Calculate the send(S) time (t) and receive (R) time (T) and 7] for this paper, as Linux offers a number of programming average it. development tools that can be used along with the simulation process. To run a simulation with ns-2.34, the  Normalized Routing Load: The normalized routing user must write the simulation script in OTCL, get the load is defined as the fraction of all routing control packets simulation results in an output trace file and here, we sent by all nodes over the number of received data packets analyzed the experimental results by using the awk at the destination nodes. command (Fig. 5).The performance metrics are graphically visualized in XGRAPH 12.1(Fig. 6,7,8,9). Ns-2 also offers a  Throughput: Throughput is the average number of visual representation of the simulated network by tracing messages successfully delivered per unit time i.e. average nodes movements and events and writing them in a network number of bits delivered per second. animator (NAM) file (Fig. 4). V. SIMULATION RESULTS & OBESRVATION B. Simulation Parameters The simulation results are shown in the following section We consider a network of nodes placing within a 1000m in the form of line graphs. The performance of AODV based X 1000m area. The performance of AODV is evaluated by on the varying the number of nodes is done on parameters keeping the network speed and pause time constant and like packet delivery fraction and average end-to-end delay, varying the network size (number of mobile nodes).Table 1 normalized routing load and throughput. shows the simulation parameters used in this evaluation. “Fig. 4” shows the creation of clusters with 50 mobile TABLE 1: PARAMETERS VALUES FOR AODV SIMULATION nodes as it is shown in the NAM console which is a built-in program in NS-2-allinone package after the end of the Simulation Parameters simulation process. Simulator ns-2.34 Protocol AODV Simulation duration 200 seconds Simulation area 1000 m x 1000 m 5,10,15,20,25, Number of nodes 30,35,40,45,50 Transmission range 250 m Movement model Random Waypoint MAC Layer Protocol IEEE 802.11 Pause Time 100 sec Maximum speed 20 m/s Packet rate 4 packets/sec Traffic type CBR (UDP) Figure 4. AODV with 50 nodes: Route Discovery Data payload 512 bytes/packet “Fig. 5” shows the calculation of send, received packets, C. Performance Metrics PDF, average end-to-end delay, normalized routing load and While analyzed the AODV protocol, we focused on two etc. for AODV simulation with 50 nodes by running AWK performance metrics which are Packet Delivery Fraction script for it. (PDF), Average End-to-End Delay, Normalized Routing Load (NRL) and throughput.  Packet delivery fraction: The fraction of all the received data packets successfully at the destinations over the number of data packets sent by the CBR sources is known as Packet delivery fraction. ISSN : 0975-3397 2733
  • 4. Nilesh P. Bobade et al. / (IJCSE) International Journal on Computer Science and Engineering Vol. 02, No. 08, 2010, 2731-2735 From “Fig. 8” we can observed that the normalized routing load is initially low for less number of nodes but it increases with , varying the network size because in AODV routing load is dominated by route requests as a part of route discovery process. Figure 5. Snapshot of the results of performance metrics “Fig. 6” highlights the relative performance of AODV i.e. it delivers a greater percentage of the originated data (above 99%). From figure it is observed that the performance of AODV is consistently uniform between 99.5 & 99.7 %. Figure 8. Normalized routing Load Vs Number of Mobile Nodes In case of AODV protocol when number of nodes increases, initially throughput increases as large number of routes are available but after a certain limit throughput becomes stable. Figure shows that the ability of the AODV to deliver packets to their destination degrades as the network size increases (Fig. 9). Figure 6. Packet Delivery Fraction Vs Number of Mobile Nodes Figure 9. Throughput Vs Number of Mobile Nodes VI. CONCLUSION In this presented simulation work, the AODV routing protocol is evaluated for the application oriented performance metrics such as packet delivery fraction, average end-to-end delay, normalized routing load and Figure 7. Average End-to-End Delay (ms) Vs Number of Mobile Nodes average throughput with increasing the number of mobile nodes up to 50. As we increase the number of nodes for For average end-to-end delay, the performance of AODV performing the simulation of AODV routing protocol, is almost uniform (below 180 ms) except for 40 nodes (Fig. 7). ISSN : 0975-3397 2734
  • 5. Nilesh P. Bobade et al. / (IJCSE) International Journal on Computer Science and Engineering Vol. 02, No. 08, 2010, 2731-2735 number of sent, routing and delivered packets changes, Available at http: //www. isi.edu/nsnam/ns/doc. hence the performance parameters changes. [14] C. E. Perkins, E. M. Royer, and S. R. Das, “Ad Hoc On- Demand As a result of our studies, we conclude that AODV exhibits Distance Vector (AODV) Routing”, Internet Draft, draft-ietf-manet- a better performance in terms of packet delivery fraction and aodv-10.txt, work in progress, 2002. average end-to-end delay with increasing number of mobile AUTHORS PROFILE nodes due to its on demand characteristics to determine the Nilesh P. Bobade is persuing M.Tech in freshness of the routes. It suits where end-to-end delays are Electronics Engineering from RTM Nagpur very critical. Also it can be said that the AODV has higher University, Nagpur, India. He received his B.E. degree in Electronics Engineering from normalized routing load. Our result also indicates that as the RTM Nagpur University, Nagpur in year number of nodes in the network increases AODV gives 1996. He is currently working as Assistant nearly constant throughput. Considering the overall Professor in the Department of Electronics performance of AODV it performs well with varying Engineering, BDCOE, Sevagram, Wardha, M.S., India. He is a life member of Indian network size. Socirty for Technical Education. His research interests include computer networks and REFERENCES embedded systems. [1] J. Broch, D. A. Maltz, D. B. Johnson, Y. C. Hu, and J. Jetcheva”, A Performance Comparison of Multi-Hop Wireless Network Routing Mr. Nitiket N. Mhala is persuing PhD Protocols,” Proceedings of the Fourth Annual ACM/IEEE student and also working as Associatet International Conference on Mobile Computing and Networking Professor and Head in the Department of (MobiCom’98), October 25-30, 1998,Dallas,Texas,USA,pp.25-30. Electronic Engineering, Sevagram, India. He [2] S. R. Das, C. E. Perkins, and E. M. Royer, “Performance Comparison received his ME Degree from RM Institute of of Two On-Demand Routing Protocols for Ad Hoc Networks “, IEEE Research and Technology, Badnera, Personal Communications Magazine, Special Issue on Mobile Ad Amravati University and B.E. Degree from Hoc Networks, Vol. 8, No. 1, February 2001,pp.16-29. Govt. College of Engineering, Amravati, [3] D. O. Jorg, “Performance Comparison of MANET Routing Amravati University. He published a Book Protocols In Different Network Sizes”, Computer Networks & Distri- Entitled PC Architecture and Maintenance. buted Systems, 2003. He is a member of Institute of Electronics and Telecommunication Engineer (IETE). His area of interest spans Data communication, Computer [4] K U Khan, R U Zaman, A. Venugopal Reddy,“Performance network and Wireless Ad hoc networks. He published research papers at Comparison of On-Demand and Table Driven Ad HocRouting National and International level. Protocols using NCTUns ”, Tenth International Conference on Computer Modeling and Simulation, 2008. [5] Saurabh gupta “ANALYSIS OF SIMULATION OF AD-HOC ON DEMAND DISTANCE VECTOR ROUTING PROTOCOL”, National Conference on Advanced Computing and Communication Technology ACCT-10 [6] S.P. Setty et. al., “PERFORMANCE EVALUATION OF AODV IN DIFFERENT ENVIRONMENTS”, International Journal of Engineering Science and Technology Vol. 2(7), 2010, 2976-2981 [7] Boukerche A., “Performance comparison and analysis of ad hoc routing algorithms”, IEEE International Conference on. Performance, Computing, and Communications, 2001, Apr 2001, pp 171-178. [8] Arun Kumar B. R., Lokanatha C. Reddy, Prakash.S.Hiremath, “Performance Comparison of Wireless Mobile Ad-Hoc Network Routing Protocols” IJCSNS International Journal of Computer Science and Network Security VOL.8 No.6,June 2008. [9] S. Gowrishankar, T.G. Basavaraju, M.Singh, Subir Kumar Sarkar, “Scenario based Performance Analysis of AODV and OLSR in Mobile Ad Hoc Networks”, Proceedings of the 24th South East Asia Regional Computer Conference, November 18-19, 2007, Bangkok, Thailand. [10] N Vetrivelan, Dr. A V Reddy, “ Performance Analysis of Three Routing Protocols for Varying MANET Size”, Proceeding of the International MultiConference of Engineers and Computer Scientists 2008 Vol II, IMECS 2008,19-21 March, 2008, Hong Kong. 11] Abdul Hadi Abd Rahman and Zuriati Ahmad Zukarnain, “Performance Comparison of AODV, DSDV and I-DSDV Routing Protocols in Mobile Ad Hoc networks”, European Journal of Scientific Research ISSN 1450- 216X Vol.31 No.4 (2009).pp.566-576. [12] E. M. Royer, and C.K. Toh, “A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks”, IEEE Personal Communications, Vol. 6, Issue 2, pp. 46-55, April 1999. [13] NS -2, The ns Manual (formally known as NS Documentation) ISSN : 0975-3397 2735