\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 FSR Routing Protocols in Manets},
 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{2013-01-15 (revised: 15 January 2013)}
\def\TheID{\makeatother }
\def\TheDate{2013-01-15}
\title{Performance Evaluation of AODV and FSR Routing Protocols in Manets}
\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]{M Ravi  Kumar}

             \affil[1]{  Sri Krishnadevaraya University}

\renewcommand\Authands{ and }

\date{\small \em Received: 11 December 2012 Accepted: 31 December 2012 Published: 15 January 2013}

\maketitle


\begin{abstract}
        


A mobilead hoc Network (MANET) is an infrastructure less, decentralized multi-hop network where the mobile nodes are free to move randomly, these making the network topology dynamic. MANET routing protocols show different performance in different mobile network scenarios. In this paper an attempt has been made to understand the characteristics/behavior of ad hoc on demand distance vector (AODV) and Fisheye State Routing (FSR)protocols. The analysis of these protocols has been done using NS-2.

\end{abstract}


\keywords{AODV, FSR, MANETs, NS-2.}

\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 allow user to access information and services electronically. Regardless of their geographic position. Wireless network can be classified in two types-Infrastructure network and Infrastructure Less networks or Ad-hoc Network \hyperref[b0]{[1]}. a) Infrastructure Networks Infrastructure mode wireless networking brides a wireless network to a wired Ethernet network. Infrastructure mode wireless also supports central connection points for WLAN clients. Infrastructure network consist of fixed and wired gateways. A mobile host communicates with a bridge in the network within in communicating radius. The mobile unit can move geographically while it is communicating. When it goes out of rage 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[b1]{[2]}. b) Infrastructure Less (ad-hoc) Networks An Infrastructureless Networks is a collection of mobile nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continual basis. The primary goal of such an infrastructure less networks is correct and efficient route establishment between a pair of nodes so that messages may be delivered in a timely manner.\par
Multicasting is to send single copy of a packet to all of those of clients that requested it, and not to send multiple copies of a packet over the same portion of the network, nor to send packets to clients who don't want it. Ad-hoc network are basically peer-to-peer selforganizing and self-configuring multi-hop mobile wireless network where the structure of the network changes dynamically \hyperref[b2]{[3]}. This is mainly due to the mobility of nodes. 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[b2]{[3]}. Ad-hoc network flat routing protocols may classify as: 
\section[{i. Proactive routing (Table-driven) protocols}]{i. Proactive routing (Table-driven) protocols}\par
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
ii. 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
The following point shows the importance of ad hoc networks. 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. destroy Base stations, fires burn servers. No forward planning can be done, and the set-up 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. 
\section[{c. Effectiveness}]{c. Effectiveness}\par
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. 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[b3]{[4]}. 
\section[{d. Remote Areas}]{d. Remote Areas}\par
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.\par
ii.\par
Overview of the Protocol a) Ad hoc On Demand Distance Vector (AODV) Ad hoc On Demand Distance Vector Routing Protocol (AODV) is a reactive routing protocol designed for Ad hoc wireless network and it is capable of both unicast as well as multicast routing \hyperref[b4]{[5]}. The Route Discovery process in this protocol is performed using control messages Route Request (RREQ) and Route Reply (RREP) whenever a node wishes to send packet to destination. Traditional routing tables is used, one entry per destination \hyperref[b5]{[6]}. During a route discovery process, the source node broadcasts a Route Request packet to its neighbors. This control packet includes the last known sequence number for that destination. If any of the neighbors has a route to the destination, it replies to the query with Route Reply packet; otherwise, the neighbors rebroadcast the Route Request packet. Finally, some of these query control packets reach the destination, or nodes that have a route to the destination. At this point, a reply packet is generated and transmitted tracing back the route traversed by the query control packet. In the event when a valid route is not found or the query or reply packets are lost, the source node rebroadcasts the query packet if no reply is received by the source after a time-out. In order to maintain freshness node list, AODV normally requires that each node periodically transmit a HELLO message, with a default rate of one per second \hyperref[b11]{[13]}. When a node fails to receive three consecutive HELLO messages from its neighbor, the node takes is as an indication that the link to its neighbor is down. If the destination with this neighbor as the next hop is believed not to be far away (from the invalid routing entry), local repair mechanism may be launched to rebuild the route towards the destination; otherwise, a Route Error (RERR) packet is sent to the neighbors in the precursor list associated with the routing entry to inform them of the link failure \hyperref[b12]{[14]}. 
\section[{b) Fisheye State Routing (FSR)}]{b) Fisheye State Routing (FSR)}\par
Fisheye State Routing (FSR) \hyperref[b6]{[9]} protocol is a proactive (table driven) ad hoc routing protocol and its mechanisms are based on the Link State Routing protocol used in wired networks. FSR is an implicit hierarchical routing protocol. It reduces the routing update overhead in large networks by using a fisheye technique. Fisheye has the ability to see objects the better when they are nearer to its focal point that means each node maintains accurate information about near nodes and not so accurate about far-away nodes. The scope of fisheye is defined as the set of nodes that can be reached within a given number of hops. The number of levels and the radius of each scope will depend on the size of the network. Entries corresponding to nodes within the smaller scope are propagated to the neighbors with the highest frequency and the exchanges in smaller scopes are more frequent than in larger. That makes the topology information about near nodes more precise than the information about far away nodes. FSR minimized the consumed bandwidth as the link state update packets that are exchanged only among neighboring nodes and it manages to reduce the message size of the topology information due to removal of topology information concerned far-away nodes. Even if a node doesn't have accurate information about far away nodes, the packets will be routed correctly because the route information becomes more and more accurate as the packet gets closer to the destination. This means that FSR scales well to large mobile ad hoc networks as the overhead is controlled and supports high rates of mobility. 
\section[{III.}]{III.} 
\section[{Simulation Methodology}]{Simulation Methodology}\par
Simulation based study using Network Simulator NS-2 \hyperref[b8]{[10]} has been used to compare two protocols viz. AODV and FSR under varying node density and varying pause time, assuming that the size of network, maximum speed of nodes and transmission rate are fixed. Tables  {\ref 1 and 2} summarize the parameters used in the communication and movement models for simulation. 
\section[{a) Communication Model}]{a) Communication Model}\par
The simulator assumes constant bit rate (CBR) traffic with a transmission rate of 8 packets per second. The number of nodes varies from 25 to 100 in the denomination of 25, 50, 75 and 100. Given on the last line. In line with the realistic mobility pattern of the mobile nodes, the simulation assumes a Random Waypoint Model  {\ref [7]}, where a node is allowed to move in any direction arbitrarily. The nodes select any random destination in the 500 X 500 space and moves to that destination at a speed distributed uniformly between 1 and nodes maximum speed (assumed to be 20 meter per second). Upon reaching the destination, the node pauses for fixed time, selects another destination, and proceeds there as discussed above. After testing all possible connection for a specific scenario, pause time changes to test the next scenario. This behavior repeats throughout the duration of the simulation (500 seconds). Meanwhile, number of nodes and pause time has been varied to compare the performance of the protocols for low as well as high density environment and for low mobility of the nodes to high mobility. Table  {\ref 2} lists the movement parameters of the simulations. 
\section[{Global Journal of Computer Science and Technology}]{Global Journal of Computer Science and Technology} 
\section[{Table 2 : Parameters of movement model c) Performance Metrics}]{Table 2 : Parameters of movement model c) Performance Metrics}\par
Three performance metrics has been measured for the protocols. 
\section[{d) Throughput}]{d) Throughput}\par
Throughput is the number of packet that is passing through the channel in a particular unit of time  {\ref [8]}. This performance metric shows the total number of packets that have been successfully delivered from source node to destination node. Factors that affect throughput include frequent topology changes, unreliable communication, limited bandwidth and limited energy.\par
(1) e) Average End-to-End Delay A specific packet is transmitting from source to destination node and calculates the difference between send times and received times. This metric describes the packet delivery time. Delays due to route discovery, queuing, propagation and transfer time are included metric \hyperref[b11]{[13]}.\par
(2) f) Normalized Routing Load Normalized Routing Load is the ratio of total number of routing packet received and total number of data packets received \hyperref[b10]{[12]}. Normalized\textunderscore Routing\textunderscore Load=   Another characteristic that has come to the notice is that pause time does not have significant bearing on the throughput whereas the performance is dictated only by the density of the network. The possible reason for the same is due to proactive nature of FSR routing protocol, which causes less number of table update in a stable topology, thus producing better throughput. It also has been observed that with an increase in pause time there is a decline in the average end-toend for both the protocols under low node density environment (Fig \hyperref[fig_10]{2a and 2b}). However, this is not true when there is a rise in the network density. The possible reason for such behavior is the presence of more number of nodes between source and destination which effects in increase of hop count thus resulting in increased average end-to-end delay.   that normalized routing load of AODV is always higher than FSR under any scenario. The performance of FSR in terms of normalized routing load is not influenced in any way with respect to change in node density and pause time. The reactive nature of AODV routing protocol causes more number of control overhead than FSR. Therefore, normalized routing load for AODV will always be higher than FSR. 
\section[{Simulation Result and Analysis}]{Simulation Result and Analysis}\par
V. 
\section[{Conclusion}]{Conclusion}\par
The performance evaluation of two routing protocols, AODV and FSR, has been done with respect to metrics viz. throughput, average end-to-end delay and normalized routing load under varying node density and varying pause time. From the result analysis, it has been observed that in high node density the  The increase of node density in the network causes more number of control packets in the network for route establishment between a pair of source and destination nodes. This is the main reason of performance degradation of the routing protocols in high node density \hyperref[b13]{[15]}. On other hand, increase of pause time indicates more stable network. Thus the performance of both routing protocols increases with the increment of pause time. It has been observed that in low node density the performance of AODV is better than FSR in terms of throughput, whereas the performance of DSDV is better in high node density (up to 100 nodes). Another observation has been found from the result that increment of pause time does not affect much in the performance of FSR where the performance of AODV varies significantly with the pause time. In Current work, only three performance metrics have been considered to analyze the performance of AODV and FSR. Inclusion of other performance metrics will provide in depth comparison of these two protocols which may provide an insight on the realistic behavior of the protocols under more challenging environment. The current work has been limited with fixed simulation area (500x500m) with CBR traffic and node density is up to 100 nodes. From previous work \hyperref[b13]{[15]}, it has been observed that in higher node density (200 nodes) AODV performs better than FSR. Varying simulation area and higher node density with different traffic will provide in depth performance analysis of these two protocols.   
\section[{Global}]{Global}\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Volume}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-4.png}
\caption{\label{fig_3}Figures 1 ,}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-5.png}
\caption{\label{fig_4}Figure 1 E}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-6.png}
\caption{\label{fig_5}Figure 1 (}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-7.png}
\caption{\label{fig_6}Figure 2 (E}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-8.png}
\caption{\label{fig_7}Figure 2 (}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-9.png}
\caption{\label{fig_8}Figure 3 (}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-10.png}
\caption{\label{fig_9}E}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-11.png}
\caption{\label{fig_10}Figure 2 (}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-12.png}
\caption{\label{fig_11}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.5046875\textwidth}P{0.0265625\textwidth}P{0.03984375\textwidth}P{0.11953124999999999\textwidth}P{0.053125\textwidth}P{0.10625\textwidth}}
for\tabcellsep Ad\tabcellsep Hoc\tabcellsep Networks,\tabcellsep IEEE\tabcellsep Personal\\
\multicolumn{5}{l}{Communications and February 2001.}\tabcellsep \\
7.\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \end{longtable} \par
 
\caption{\label{tab_0}E}\end{figure}
 			\footnote{© 2013 Global Journals Inc. (US) Year} 			\footnote{© 2013 Global Journals Inc. (US) Year} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Pei]{b6}\label{b6} 	 		\textit{},  		 			Guangyu Pei 		.  		 	 
\bibitem[Abolhasan et al.]{b2}\label{b2} 	 		\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[Perkins ()]{b4}\label{b4} 	 		\textit{Ad Hoc Networking},  		 			Charles E Perkins 		.  		2001. Addison Wesley.  	 
\bibitem[Perkins et al. (2001)]{b12}\label{b12} 	 		\textit{Ad Hoc On Demand Distance Vector (AODV) Routing, IETF Internet Draft, draft-ietf-manet-aodv-08.txt},  		 			C E Perkins 		,  		 			E M Royar 		,  		 			S Das 		.  		March 2001.  	 
\bibitem[Siva Ram Murthy and Manoj ()]{b0}\label{b0} 	 		\textit{Ad Hoc Wireless Networks, Architectures and Protocols, Second Edition},  		 			C Siva Ram Murthy 		,  		 			B S Manoj 		.  		2007. Pearson Education.  	 	 (Low price Edition) 
\bibitem[Mamatha and Sharma ()]{b1}\label{b1} 	 		‘Analyzing the Manet Variations, Challenges, Capacity and Protocol Issues’.  		 			G S Mamatha 		,  		 			S C Sharma 		.  	 	 		\textit{International Journal of Computer Science \& Engineering Survey (IJCSES)}  		2010. 1  (1) .  	 
\bibitem[Comer ()]{b10}\label{b10} 	 		\textit{Computer Networks and Internet},  		 			Douglas E Comer 		.  		2008. Prentice Hall.  	 
\bibitem[Gerla and Tsu Wei Chen ()]{b7}\label{b7} 	 		‘Fisheye state routing: a routing scheme for ad hoc wireless networks’.  		 			M Gerla 		,  		 			Tsu Wei Chen 		.  	 	 		\textit{IEEE International Conference on Communications},  				2000.  	 
\bibitem[Sinha and Sen ()]{b13}\label{b13} 	 		‘Performance Analysis of AODV And DSDV Routing Protocols in Mobile Ad Hoc Networks Under Varying Node Density’.  		 			Sanku Sinha 		,  		 			Biswaraj Sen 		.  	 	 		\textit{the proceedings of international conference RTCMC2012, OITM, Hissar},  				February 25-26. 2012. p. 171174.  	 
\bibitem[Ramesh et al. ()]{b9}\label{b9} 	 		‘Performance Comparison and Analysis of DSDV and AODV for MANET’.  		 			Dr P Ramesh 		,  		 			N Subbaiah 		,  		 			M. Janardhana Rao 		,  		 			Raju 		.  	 	 		\textit{International Journal on Computer Science and Engineering}  		2010.  	 
\bibitem[Perkins et al.]{b5}\label{b5} 	 		\textit{Performance Comparison of Two On-Demand Routing Protocols},  		 			Charles E Perkins 		,  		 			Elizabeth M Royer 		,  		 			R Samir 		,  		 			Mahesh K Das 		,  		 			Marina 		.  		 	 
\bibitem[S H Manjula et al. (2008)]{b11}\label{b11} 	 		\textit{Performance of AODV Routing Protocol using Group and Entity Models in Wireless Sensor Networks},  		 			C N S H Manjula 		,  		 			Abhilash 		,  		 			K Shaila 		,  		 			K R Venugopal 		,  		 			L M Patnaik 		,  		 			; Imecs 		,  		 			Hong Kong 		.  		March 2008.  	 
\bibitem[Hong et al. ()]{b3}\label{b3} 	 		\textit{Scalable routing protocols for mobile ad hoc networks},  		 			Xiaoyan Hong 		,  		 			Kaixin Xu 		,  		 			Mario Gerla 		.  		2002.  	 
\bibitem[Fall and Varadhan (2011)]{b8}\label{b8} 	 		\textit{The ns Manual},  		 			Kevin Fall 		,  		 			Kannan Varadhan 		.  		November 2011.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
