\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={Performance Evaluation of AODV and DSDV Routing Protocols for Ad-hoc Networks},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2012-01-15 (revised: 15 January 2012)}
\def\TheID{\makeatother }
\def\TheDate{2012-01-15}
\title{Performance Evaluation of AODV and DSDV Routing Protocols for Ad-hoc Networks}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Er. Abhishek  Sengar}

             \affil[1]{  Electronics and Communication College Of Science and Engineering Jhansi, India.}

\renewcommand\Authands{ and }

\date{\small \em Received: 14 December 2011 Accepted: 2 January 2012 Published: 15 January 2012}

\maketitle


\begin{abstract}
        


Ad-hoc networks are basically self organizing and self configuring multi-hop mobile wireless network in which the information packets are transmitted in a store and forward manner from a source to an arbitrary destination via intermediate nodes. The main objective of this paper is to performance evaluation of AODV (Ad-hoc on demand distance vector) and DSDV (Destination sequence distance vector) routing protocols on the basis of different performance metrics. In this paper, an attempt has been made to evaluate the performance of two well known routing protocols AODV, DSDV by using three performance metrics such as throughput, packet delivery ratio and Routing overheads. The Performance evaluation has been done by using simulation tool NS2 (Network Simulator) which is the main simulator.

\end{abstract}


\keywords{AODV, DSDV, dsr, ns2.}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{INTRODUCTION}]{INTRODUCTION}\par
ireless networking is an emerging technology that allows user to access information and services electronically, regardless of their geographic position. Wireless network can be classified in two types-Infrastructure networks and Infrastructure Less networks or Ad-hoc Networks \hyperref[b5]{[6]}.\par
Infrastructure Networks:-Infrastructure network consist of fixed and wired gateways. A mobile host communicates with a bridge in the network (called base station) within its Communicate radius. The mobile unit can move geographically while it is communicating. When it goes out of Range of one base station, it connects with new base station and start communicating through it. This is called handoff. In this approach the base station are fixed \hyperref[b6]{[7]}.\par
Infrastructure Less (Ad-hoc) Networks:-Ad-hoc networks are collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or stand-alone infrastructure \hyperref[b0]{[1]}. Ad-hoc network are basically peer-to-peer self organizing and self configuring multi-hop mobile wireless network where the structure of the network changes dynamically \hyperref[b1]{[2]}. This is mainly due to the mobility of nodes \hyperref[b2]{[3]}. Nodes in this network utilize the same random access wireless channel, cooperating in friendly manner to engaging themselves in multi-hop Forwarding. The nodes in the network not only act as hosts but also as routers that route data to/from other nodes in the network \hyperref[b1]{[2]}.\par
Routing is used to decide best suitable path for packet transmission from one place to another place. In this paper an attempt has been made to evaluate the performance of proactive and reactive routing protocols. Ad-hoc network flat routing protocols may classify as:-Proactive routing (Table-driven) protocols:-Proactive routing or table-driven routing protocols attempt to maintain consistent, up-to date routing information from each node to every other node in the network. These protocols require each node to maintain one or more tables to store routing information, and they respond to change in network topology by propagating route update throughout the network to Maintain consistent network view.\par
Reactive (On-demand) routing protocols:-In reactive or on demand routing protocols, the routes are created as when required. When a source wants to send to a destination, it invokes the route discovery mechanism to find the path to the destination. This process is completed when once a source is found or all possible route permutation has been examined. Once a route has been discovered and established, it is maintained by some form of route maintenance procedure until either the destination becomes inaccessible along every path from the source or route is no longer desired.\par
With the increase of portable of devices as well as progress in wireless communication, Ad-hoc network gaining importance with the increasing number of widespread application. The following point shows the importance of ad hoc networks:\par
Instant Infrastructure: Unplanned meetings, spontaneous interpersonal communications etc., cannot rely on any infrastructure, it needs planning and administration. It would take too long to set up this kind of infrastructure; therefore ad-hoc connectivity has to setup \hyperref[b5]{[6]}.\par
Disaster Relief: Infrastructure typically breakdown in disaster areas. Hurricanes cut phone and power lines, floods destroy Base stations, fires burn servers. No forward planning can be done, and the setup must be externally fast and reliable. The same applies to many military activities, which are, to be honest, one of the major driving forces behind mobile ad-hoc networking research \hyperref[b8]{[9]}.\par
Effectiveness: Service provided by existing infrastructure might be too expensive for certain applications. If, for example only connection oriented cellular network exist, but an application sends only small status information every other minute, cheaper ad-hoc packet-oriented network might be a better solution.\par
Registration procedure might take too long and communication overheads might be too high with existing networks. Tailored ad-hoc networks can offer a better solution \hyperref[b4]{[5]}.\par
Remote Areas: Even if infrastructure could be planned ahead, it is sometimes too expensive to set up an infrastructure in sparsely populated areas. Depending on the communication pattern, so ad-hoc networks or satellite infrastructure can be a solution \hyperref[b8]{[9]}.\par
Other applications of wireless ad-hoc networking are Due to their quick and economically less demanding deployment, this network finds applications in several areas. Some of these include: military applications, collaborative and distributed computing, emergency operations, wireless mesh networks, wireless sensor networks, and hybrid wireless network \hyperref[b5]{[6]}.\par
II. 
\section[{CHALANGES OF MANET}]{CHALANGES OF MANET}\par
The major issues that affect the design, deployment, performance of an ad-hoc network wireless system are as follows:\par
Packet losses due to transmission errors:-Mobile ad hoc network experiences a much higher packet losses due to some factors such as high bit error rate (BER) in the wireless channel, increased collision due to the hidden terminal problem, presence of interference, location dependent contention, unidirectional links, frequent path break due to node mobility and the inherent fading property of wires medium \hyperref[b5]{[6]}.\par
Route changes due to mobility: The network topology in an ad-hoc wireless network is highly dynamic due to mobility of nodes; hence an on-going session may suffer from frequently path breaking. This session often leads to frequent route changes therefore mobility management itself is very vast research topic in ad-hoc networking \hyperref[b6]{[7]}. Security issues: The radio channel is used for ad-hoc wireless network is broadcast in nature and is shared by all the nodes in the network. Data transmitted by a node is received by all the nodes within its direct transmission range. So attacker can easily snoops the data being transmitted by a node in the network. Here the Requirement for confidentiality can be violated if an adversary is able to interpret the data gathered through snooping \hyperref[b5]{[6]}.\par
Limited wireless transmission range: In wireless network the radio band will be limited and hence data rates it can offer are much lesser than what a wired network can offer. This requires an optimal manner by keeping the overhead as low as possible \hyperref[b5]{[6]}.\par
Routing overhead: In wireless ad hoc networks, nodes often change their location within the network. So stales route are generated in the routing tables which lead to unnecessary routing overhead.\par
Potentially frequent network partition:-The randomly moving nodes in an ad-hoc can lead to network partition. In major cases the intermediate nodes are the one which are highly affected by this partitioning \hyperref[b6]{[7]}.\par
Asymmetric links: Most of the wired networks rely on the symmetric links which are always fixed. But this is not a case with ad hoc networks as the nodes are mobile and constantly changing their position within network. Consider a MANET where node c sends a signal to node B but does not tell anything about the quality connection in the reverse direction \hyperref[b7]{[8]}. 
\section[{III.}]{III.} 
\section[{CLASSIFICATION OF ROUTING PROTOCOLS}]{CLASSIFICATION OF ROUTING PROTOCOLS}\par
Ad-hoc network routing protocols may be classified in many ways depending on their routing algorithm, network structure communication model, and state of information etc, but most of the protocols depending on their routing algorithm, and network structure \hyperref[b2]{[3]} \hyperref[b9]{[10]}.\par
Based on the network structure ad-hoc network classify as Flat routing, hierarchical routing, geographical position assisted routing. Flat routing covers two types of routing protocols based on routing algorithm.\par
Based on the Routing algorithms, routing protocols are classified as Proactive routing protocols and Reactive Routing protocols.  Battery constraints: This is one of the limited resources that form a major constraint for the node in an ad hoc network. Devices used in these networks have restriction on the power source in order to maintain portability, size, and weight of the device. \hyperref[b6]{[7]}.\par
Large amount of network traffic, route updates can employ in two types of packets they are first is the "Full Dump" and second is the "Incremental routing". A full dump sends the full routing table to the neighbors and could cover many packets whereas, in an incremental update only those entries from the routing table are sent that has a metric change since the last update and it must fit in a packet. When the network is relatively stable, incremental updates are sent to avoid extra Traffic and full dump are relatively infrequent. In a fast changing network, incremental packets can grow big, so full dumps will be more frequent \hyperref[b12]{[13]}.\par
AODV: The AODV is a Reactive on demand ad-hoc distance vector routing algorithm. AODV is an improvement on DSDV because it typically minimizes the number of required broadcasts by creating routes on demand basis as opposed to maintaining a complete list of routes, as in the DSDV algorithm. When a source node desires to send a message to some destination node and does not already have a valid route to that destination, it initiates a path discovery process to locate the destination. In AODV each router maintains route table entries with the destination IP address, destination sequence number, hop count, next hop ID and lifetime \hyperref[b10]{[11]}.\par
RREQs route requests and RREPs route replies are the two message types defined by the AODV. When a route to a new destination is needed, the node uses a broadcast RREQ to find a route to destination. A route can be determined when the request reaches either the destination itself or an intermediate node with a fresh route to the destination. The route is made available by unicasting a RREP back to the source of RREQ. Each node maintains its own broadcast id, sequence number. The broadcast ID is incremented for every RREQ packet. Since each node receiving the request keeps track of a route back to the source of the request, the RREP reply can be unicast back from the destination to the source, or from any intermediate node that is able to satisfy the request back to the source \hyperref[b9]{[10]}.\par
IV. 
\section[{SIMULATION BASED ANALYSIS}]{SIMULATION BASED ANALYSIS}\par
This section described the simulation tool, network setup, Simulation parameters and simulation results. The performances of proactive and reactive routing protocols are evaluated on the basis of three performance metrics: Throughput, Packet delivery ratio, Routing overhead. 
\section[{a) Simulation Tool}]{a) Simulation Tool}\par
In this paper simulation of proactive and reactive routing protocols is done by using network simulator (NS2) software due to its simplicity and availability. NS is a discrete event Simulator targeted at networking research. NS provides substantial support for simulation of TCP, routing, and multicast routing protocols over a wired and wireless network. NS2 is written in C++ and OTCL. C++ for data per event packets and OTCL are used for periodic and triggered event. NS2 include a network animator called network animator which provides visual view of simulation. NS2 preprocessing provides traffic and topology generation and post processing provide simple trace analysis. AWK programming is used for trace file analysis. 
\section[{b) Network Setup and Simulation Parameters}]{b) Network Setup and Simulation Parameters}\par
The following network setup and simulation parameters are used in this paper to analyze the performance of proactive and reactive routing protocols.   The following metrics are used in this paper for the performance analysis of AODV, DSDV Routing protocols. These are: i. Throughout: It is the amount of data transferred over the period of time expressed in bits per second. ii.\par
Packet delivery ratio: It is the ratio of the number of data packets received by the destination node to the number of data packets sent by the source mobile node. iii.\par
Routing Overhead: The number of control packets generated by each routing protocol. iv.\par
Average end to end delay:d) Simulation Results\par
The simulation results are shown in the following section in the form of graphs and charts. In this paper an attempt has been made to evaluate the performance of two well known routing protocol DSDV, AODV according to his simulation results. The simulation results are genrated through the Excel graphs according to above mentioned criteria shown in table. According to above all 'Throughput graphs' and 'network topology' the 6 nodes are sender and remaining are receivers. First node start traffic at 1.5 second and utilize the full channel bandwidth. So the throughput of first node is gretter than others nodes.\par
After Second node start the traffic at 15 second and this node shares the channel banwidth with first node. So the throughput of second node is lower than first node because of late starting of traffic and throughput of first node is also decresed because of sharing bandwidth.\par
Similerly third node start traffic at the 25 second then the three nodes share the channel bandwidth. so the throughput of first two nodes are gretter, and third node's throughput is lower because of late starting of traffic and sharing of bandwidth.\par
Similerly fourth node, fifth node, and sixth node start traffic at 30 second, 35 second, and 40 second. if we increase the no. of senders and receivers and increse the traffic between sender and receivers, the throughput is decreses of all the senders and receivers.\par
On the basis of above graph, it is observed that the throughput of AODV is better than DSDV.    According to above packet delivery ratio graph, the packet delivery ratio of DSDV is minimum, and AODV is maximum.\par
V. 
\section[{CONCLUSIONS}]{CONCLUSIONS}\par
In this paper, the performance evaluation of AODV and DSDV routing protocols is done in the above mentioned criteria. The simulation results of all Excel graphs provide the information that if the number of nodes increases in the transmission then the throughput decreases. First graph shows that AODV throughput is better than DSDV because of his consistent performance. Second graph shows that AODV has minimum routing overhead and DSDV has maximum routing overhead. Third graph shows that AODV provides highest packet delivery ratio and DSDV provides lowest packet delivery ratio. In the analyzed scenario, it is found that the overall performance of AODV is better than 'DSDV'. \begin{figure}[htbp]
\noindent\textbf{2012}\includegraphics[]{image-2.png}
\caption{\label{fig_0}W © 2012}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_1}©}\end{figure}
     \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.85\textwidth}}
? Proactive Routing: DSDV (Destination Sequence\\
Distance Vector Routing)\\
? Reactive Routing: AODV (Ad-hoc on-demand\\
distance vector routing protocol), DSR (Dynamic\\
source routing)\\
DSDV:-DSDV destination sequenced distance\\
vector routing protocol is a table driven algorithm\\
based on the classical Bellman -Ford routing\\
mechanism.\end{longtable} \par
 
\caption{\label{tab_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_1}Table 1 :}\end{figure}
 			\footnote{© 2012 Global Journals Inc. (US) Global Journal of Computer Science and Technology} 		 		\backmatter  			 
\subsection[{Year}]{Year}\par
Routing Protocol in Grid Environment" Nor Surayati Mohamad, Usop Azizol Abdullah, Ahmad Faisal Amri Abidin. 16. Tutorial for Simulation-based Performance Analysis of MANET Routing Protocols in ns-2By Karthik sadasivam.			 			  				\begin{bibitemlist}{1}
\bibitem[ Mobile Ad Hoc Networking Working Group -AODV]{b10}\label{b10} 	 		\textit{},  		 \url{http://www.ietf.org/rfc/rfc3561.txt}  	 	 		\textit{Mobile Ad Hoc Networking Working Group -AODV}  		 	 
\bibitem[ Jochen Schiller. Mobile Communications ()]{b7}\label{b7} 	 		\textit{},  	 	 		\textit{Jochen Schiller. Mobile Communications}  		2000. Addison-Wesley.  	 
\bibitem[ IJCSNS International Journal of Computer Science and Network Security (July 2009 261)]{b13}\label{b13} 	 		\textit{},  		 \url{http://www.isi.edu/nsnam/ns/15}  	 	 		\textit{IJCSNS International Journal of Computer Science and Network Security}  		July 2009 261. 9  (7) .  	 	 (Nsnam. PerformanceEvaluation of AODV, DSDV \& DSR) 
\bibitem[Royer and Toh ()]{b9}\label{b9} 	 		\textit{A review of current routing protocols for adhoc mobile wireless networks},  		 			Elizabeth M Royer 		,  		 			Chai-Keong Toh 		.  		1999.  		 			University of California and Georgia Institute of Technology, USA 		 	 	 (Technical report) 
\bibitem[Abolhasan et al.]{b1}\label{b1} 	 		\textit{A review of routing protocols for mobile ad hoc networks},  		 			Mehran Abolhasan 		,  		 			Tadeusz Wysocki 		,  		 			Eryk Dutkiewicz 		.  		Wollong, NSW.  		 			Telecommunication and Information Research Institute, University of Wollongong 		 	 	 (Technical report) 
\bibitem[Siva Ram Murthy and Manoj ()]{b5}\label{b5} 	 		\textit{Ad Hoc Wireless Networks, Architectures and Protocols},  		 			C Siva Ram Murthy 		,  		 			B S Manoj 		.  		2007. Pearson Education.  	 	 (Second Edition,Low price Edition) 
\bibitem[G. S. Mamatha1 and Dr. S. C. Sharma (2010)]{b6}\label{b6} 	 		‘ANALYZING THE MANET VARIATIONS, CHALLENGES, CAPACITY AND PROTOCOL ISSUES’.  	 	 		\textit{International Journal of Computer Science \& Engineering Survey (IJCSES)}  		G. S. Mamatha1 and Dr. S. C. Sharma (ed.)  		August 2010. 1  (1) .  	 
\bibitem[David et al. ()]{b0}\label{b0} 	 		\textit{Dynamic source routing in ad hoc wireless networks},  		 			B David 		,  		 			David A Johnson 		,  		 			Maltz 		.  		1996.  		 			Carnegie Mellon University 		 	 	 (Technical report) 
\bibitem[Integration of mobile ad-hoc networks]{b3}\label{b3} 	 		\textit{Integration of mobile ad-hoc networks},  		 		 			EU project DAIDALOS, Susana Sargento, Institute of Telecommunications 		 	 
\bibitem[Mobile Ad Hoc Networking Working Group -DSR]{b11}\label{b11} 	 		 \url{http://www.ietf.org/rfc/rfc4728.txt}  		\textit{Mobile Ad Hoc Networking Working Group -DSR},  				 	 
\bibitem[Mobile Ad Hoc Networking: An Essential Technology for Pervasive Computing Jun-Zhao Sun MediaTeam,Machine Vision and Media Processing Unit]{b4}\label{b4} 	 		\textit{Mobile Ad Hoc Networking: An Essential Technology for Pervasive Computing Jun-Zhao Sun MediaTeam,Machine Vision and Media Processing Unit},  		 	 
\bibitem[Hong et al. ()]{b2}\label{b2} 	 		\textit{Scalable routing protocols for mobile ad hoc networks},  		 			Xiaoyan Hong 		,  		 			Kaixin Xu 		,  		 			Mario Gerla 		.  		2002.  	 
\bibitem[Sivalingam ()]{b8}\label{b8} 	 		 			Krishna Moorthy Sivalingam 		.  		\textit{Tutorial on Mobile Ad Hoc Networks},  				2003.  	 
\bibitem[Zygmunt et al.]{b12}\label{b12} 	 		\textit{Wireless Ad Hoc Networks},  		 			J Zygmunt 		,  		 			Jing Haas 		,  		 			Ben Deng 		,  		 			Liang 		.  		 		 			Panagiotis Papadimitratos, and S. SajamaCornell University School of Electrical and Computer Engineering 		 	 
\end{bibitemlist}
 			 		 	 
\end{document}