\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={Designing the E-AODV (E as Enhanced) Routing Protocol to Improvise it During the Nodes or Links Fails},
 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{Designing the E-AODV (E as Enhanced) Routing Protocol to Improvise it During the Nodes or Links Fails}
\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]{Mr. Brijesh  Soni}

             \author[2]{Dr. Bhupesh  Gour}

             \author[3]{Mr. Arjun  Rajput}

             \affil[1]{  T.I.T. Bhopal / R.G.P.V. Bhopal}

\renewcommand\Authands{ and }

\date{\small \em Received: 7 December 2012 Accepted: 5 January 2013 Published: 15 January 2013}

\maketitle


\begin{abstract}
        


Networks are being used in various areas and the demand of user?s nowadays has motivate the emergence of the mobile adhoc network (MANET). In this age of network, most challenging task is to deliver the packet successfully with dynamic network, delay, node and links fails restraint. And to fulfill the above required task, protocol should be used effectively and efficiently .In this paper, we had successfully design the Enhanced-AODV routing protocol which had improvised the performance of AODV and its other several factors like throughput, number of packets delivered, load delay,overhead, packet delivery even in case of frequent path breaks due to nodes or links failure ,dynamic nature etc.

\end{abstract}


\keywords{reactive, proactive, hybrid protocol, adhoc on demand distance vector (aodv) routing, enhanced ad hoc on demand distance vector (e-aodv), mobile adho}

\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 networks can be broadly classified into infrastructure based wireless network and infrastructure wireless networks or Ad-hoc networks. In Ad-hoc networks, the nodes are mobile and routing between source and destination node is achieved by intermediate nodes acting as routers if it not in radio range. As Ad-hoc networks are highly dynamic, routing protocols plays a crucial role to achieve quality of service. Other important factors to be considered in Ad-Hoc networks are dynamic networks topology, frequently of network updates, scalability, security and energy required. Basically MANET \hyperref[b0]{[1]} is a group of wireless computing devices like Laptop, Mobile phone, Personal Digital Assistant (PDA) or similar devices. In Ad-hoc networks routing protocols are broadly classified into proactive (table driven) routing protocol, reactive (On-demand) routing protocols and hybrid protocols.\par
In proactive routing each node in the Ad-hoc network maintains a table or tables containing routing information of the network. Any node that needs to transmit data can start transmitting data using routes already present in the routing table enabling immediate data transmission. Popular proactive routing protocols include Destination sequence distance vector (DSDV) \hyperref[b1]{[2]} routing protocol ,Wireless routing protocol (WRP) \hyperref[b2]{[3]} and Optimized link state routing protocol (OLSR) \hyperref[b2]{[3]} .The advantages of proactive routing protocols is it update its routing table irrespective of data traffic.\par
Unlike table driven routing protocols, Reactive protocols update routing information only when a route is required by a source node to transmit data. Reactive routing protocols reduce the control overhead which is advantageous in high mobility networks whereas periodic updates in routing information leads to significant increase in networks overheads even when there is no data transmission between nodes in the networks. Some of the popular Ad-hoc routing protocols falling in this category are Dynamic Source Routing (DSR) \hyperref[b3]{[4]}, Ad-hoc On demand Distance Vector (AODV) \hyperref[b3]{[4]} \hyperref[b4]{[5]}routing and Temporarily Ordered Routing Protocols (TORA) \hyperref[b3]{[4]}.\par
AODV is considered to be the best out of many Reactive protocols but its performance degrades when nodes or link fails as with the dynamic mobility of nodes, damaging of nodes etc.\par
In this paper we had successfully upgrades several factors like performance, throughput, load delay etc. even at time of nodes or links fails in AODV routing protocol by enhancing in its algorithm. 
\section[{II.}]{II.} 
\section[{Aodv Routing Protocol}]{Aodv Routing Protocol}\par
AODV is an adaptation of Destination Sequenced Distance Vector (DSDV) protocol used in wired networks and overcomes the shortcomings of DSDV in wireless environment. AODV eliminates the counting to infinity problem faced in other distance vector protocols by implementing a sequence number. Unlike DSR which carries the entire route between the source and destination in the packet, the nodes in AODV carry only the next hop information corresponding to each data flow. Being a reactive routing protocol route is discovered as and when needed and the Author ?: e-mail: asifullahkhan@gmail.com A route discovery is initiated \hyperref[b5]{[6]} when one of the nodes in the network wants to send a data packet to another node. If an active route is not available AODV initiates the route discovery process with the source node broadcasting a route request message (RREQ) to find a route to the destination. The route is found either with the RREQ reaching the destination or an intermediate node in the network which has "fresh enough" route to the destination with the sequence number equal to or greater than the sequence number contained in the RREQ. Once a valid route is found it is made available by a route reply (RREP) message back to the originator of the RREQ. Once the route is established the nodes monitor the state of the links continuously. If a link breaks in an active route, a route error message (RERR) is sent to the other nodes of the link breakage. This initiates a new route discovery process. The advantages of AODV routing protocol is the selection of the least congested route instead of the shortest path. AODV supports both uncast and multicast data transmission. Performance is not drastically affected even if the topology changes continuously. Since source routing is not used, there are no additional overheads in the data. 
\section[{III. The Previous Algorithm And their Problem}]{III. The Previous Algorithm And their Problem}\par
From the recent up gradations in the AODV routing protocol its had been cleared that they are using the shortest path to start the transmission \hyperref[b6]{[7]} and also consider or selection of the path on a factor like weak node \hyperref[b7]{[8]} , delay function \hyperref[b8]{[9]} .and at the time of path breaks, due to node or link fails, several handling procedure or algorithm had been developed so far from traditional [10] to improvising the local repair procedure \hyperref[b10]{[11]} ,selecting \hyperref[b11]{[12]}and performance evaluation \hyperref[b12]{[13]} node disjoint path identifying the performance [14] , Security \hyperref[b13]{[15]} \hyperref[b14]{[16]} ,and also modifying \hyperref[b15]{[17]}[18]the traditional and improvising local repair algorithm which will increase packet delivery ,delay, and other several factors.\par
By considering all the recent updating in AODV, they didn't provide result satisfactory or they provide but under certain constraints. So it is needed to improve AODV with all recent updates to achieve better performance, throughput and packet deliver and several other factors which can be achieve under any situation or constraints and also even frequent path breaks due to node or links broken.\par
IV. 
\section[{The Proposed Algorithm}]{The Proposed Algorithm}\par
The proposed algorithm will be as followsa) Send hello packet from source (RREQ) to discover all path available from source to destination. b) During discovery phase, i. Every nodes must updates its cell in its routing table (named as delay factor) ii. Every node must update its cell from its routing table (name as short distance to destination) by calculating the minimum number of hops to reach to destinations. e) As grades reaches to 0, enhanced path search operation will start on the basis of following steps -Assigning the grade equivalent to 10 to all nodes to a selected path whose 'ng' (nodes grades) is smaller or equivalent to threshold value 'th' and ng is calculated as specified in formula 1 ng= Shortest path distance to destination In order to evaluate or compare several factors between proposed and previous algorithm, both the algorithm is implemented in Network simulator in Windows by creating as Linux environment .After executing both the algorithm, several factors had been compared in Table \hyperref[tab_0]{1} specified below by considering 50 nodes and for 100 seconds.\par
--formula 1 Delay functions  basis of the above table many compared graphs can be draw which really proves that it is better than previous. In graph Fig. \hyperref[fig_4]{2}, shows that proposed send more number of packet as compare to old .And also ensure that as time is increase its packet delivery ration will increase. 
\section[{Figure 3 : Overhead Analysis}]{Figure 3 : Overhead Analysis}\par
In graph Fig.  {\ref 3} ,shows that overhead packets is higher in old as compared to proposed algorithm which can degrades the performance .And also ensure that less number overhead as time is increase.  The above graph Fig.  {\ref 4} and Fig.  {\ref 5}, shows that proposed algorithm shows that lost of UDP packet is less than old algorithm and received packet received is high than old. Now we compared on the basis of TCP connection in a graph Fig. \hyperref[fig_7]{7} and Fig. \hyperref[fig_9]{8} which may have impact on the network. In graph Fig.  {\ref 4}, shows that throughput of proposed algorithm will be increase as time than old algorithm and thus its efficiency will increase.   
\section[{Conclusion}]{Conclusion}\par
The above simulation result proves that the proposed algorithm works highly effectively and efficiently as on compared with old algorithm and therefore upgrading the performance, throughput, delay, load factor, packet ratio delivery fraction ,throughput etc and also even at the time of node or links fails or even in case of mobility factor. \begin{figure}[htbp]
\noindent\textbf{2013}\includegraphics[]{image-2.png}
\caption{\label{fig_0}W © 2013}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{fig_2}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-5.png}
\caption{\label{fig_4}Figure 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{45}\includegraphics[]{image-6.png}
\caption{\label{fig_5}Figure 4 :Figure 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{6}\includegraphics[]{image-7.png}
\caption{\label{fig_6}Figure 6 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{7}\includegraphics[]{image-8.png}
\caption{\label{fig_7}Figure 7 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-9.png}
\caption{\label{fig_8}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{8}\includegraphics[]{image-10.png}
\caption{\label{fig_9}Figure 8 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.6579949238578681\textwidth}P{0.11434010152284263\textwidth}P{0.07766497461928934\textwidth}}
Parameter\tabcellsep \multicolumn{2}{l}{Proposed Previous}\\
SEND\tabcellsep 6371\tabcellsep 6142\\
RECV\tabcellsep 6087\tabcellsep 5760\\
ROUTINGPKTS\tabcellsep 4541\tabcellsep 6156\\
Packet Delivery Fraction (PDF )\tabcellsep 95.54\tabcellsep 93.78\\
Normal Routing Load (NRL)\tabcellsep 0.75\tabcellsep 1.07\\
Average e-e delay(ms)\tabcellsep 215.88\tabcellsep 378.98\\
No. of dropped data (packets)\tabcellsep 321\tabcellsep 454\\
No. of dropped data (bytes)\tabcellsep 296384\tabcellsep 425828\\
\multicolumn{3}{l}{By considering the above table its had been}\\
\multicolumn{3}{l}{clear that the proposed algorithm provides better}\\
\multicolumn{3}{l}{aspects as compare to previous algorithm. And on the}\end{longtable} \par
 
\caption{\label{tab_0}Table 1 :}\end{figure}
 			\footnote{EDesigning the E-AODV (E as Enhanced) Routing Protocol to improvise it During the Nodes or Links Fail} 			\footnote{EDesigning the E-AODV (E as Enhanced) Routing Protocol to improvise it During the Nodes or Links Fail} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Zongweizhou and Protocol]{b13}\label{b13} 	 		\textit{},  		 			"security Enhancement Over Ad-Hoc Aodv Routing Zongweizhou 		,  		 			Protocol 		.  		Beijing.  		 			Tsinghua University 		 	 	 (China zhou-zw02@mails.tsing hua.edu.cn) 
\bibitem[Pushpavalli et al. (2013)]{b8}\label{b8} 	 		‘A quality of service based AODV with QoS -Aware routing algorithm for MANET’.  		 			M Pushpavalli 		,  		 			A M Dr 		,  		 			Natarajan 		,  		 			N ; Annitha 		,  		 			H R Hr 		,  		 			V Sharma 		.  		 \url{www.ijaiem.org10}  	 	 		\textit{Asha Ambhaikar}  		February 2013. 2  (2) .  	 
\bibitem[Perkins ()]{b0}\label{b0} 	 		\textit{Ad-hoc Networking},  		 			C Perkins 		.  		2001. Addison-Wesley.  	 
\bibitem[Perkins and Royer ()]{b4}\label{b4} 	 		‘Ad-hoc on-demand distance vector routing’.  		 			C Perkins 		,  		 			E Royer 		.  	 	 		\textit{Proc of. 2nd IEEE Workshop. Mobile Computing. Systems and Applications (WMCSA 00)},  				 (of. 2nd IEEE Workshop. Mobile Computing. Systems and Applications (WMCSA 00))  		1999. p. .  	 
\bibitem[Soni and Rajput (2013)]{b16}\label{b16} 	 		\textit{Biplab Kumar sarkar "An noval approach to ehance the Adhoc on demand distance vector (AODV) routing protocl when nodes or links fails " CSEE'13 (UACEE )},  		 			Brijesh Soni 		,  		 			Arjun Rajput 		.  		Feb 2013. p. 24.  	 
\bibitem[Aghi and Diwaker (2013)]{b14}\label{b14} 	 		\textit{Black hole attack in AODV routing protocol :A Review},  		 			Chanchal Aghi 		,  		 			Chander Diwaker 		.  		 ijarcsse.com.  		Issue4 April 2013 www. 3.  	 
\bibitem[Zuhairi et al. (2012)]{b6}\label{b6} 	 		\textit{Dynamic reverse route for on-demand routing protocol in MANET},  		 			Megat Zuhairi 		,  		 			Haseeb Zafar 		,  		 			David Harle 		.  		 \xref{http://dx.doi.org/10.3837/tiis.2012.02.006}{10.3837/tiis.2012.02.006}.  		 \url{http://dx.doi.org/10.3837/tiis.2012.02.006}  		May 25. 2012.  	 
\bibitem[Mohabey (2012)]{b9}\label{b9} 	 		\textit{Improved AODV protocol for solving link failure in MANET},  		 			Mohabey 		.  		 \url{http://www.ijser.org}  		10 october 2012. 3.  	 
\bibitem[Soni and Rajput ()]{b15}\label{b15} 	 		\textit{Improvising the Adhoc on demand distance vector (AODV) routing protocol when nodes or links fails AISOBE -Nov 4},  		 			Brijesh Soni 		,  		 			Arjun Rajput 		.  		 \url{www.springer.org}  		2012.  	 	 (Biplab Kumar sarkar) 
\bibitem[Zangeneh and Mohammadi]{b11}\label{b11} 	 		‘New multipath nodedisjoint Routing based on ADOV protocol’.  		 			V Zangeneh 		,  		 			S Mohammadi 		.  	 	 		\textit{World Academy of Science, Engineering and Technology}  		52 p. 2011.  	 
\bibitem[Saleem et al. ()]{b2}\label{b2} 	 		\textit{Node Prediction -Routing in Mobile Ad Hoc Networks},  		 			Saleem 		,  		 			T. Arulldoss Albert Sheik Aalam 		,  		 			Victorie 		.  		 \url{http://www.europeanjournalofscientificresearch.com}  		2011. © EuroJournals Publishing, Inc.  	 
\bibitem[Jain et al. (2011)]{b10}\label{b10} 	 		‘On Demand Local Link Repair Algorithm for AODV Protocol’.  		 			Jyoti Jain 		,  		 			Roopam Gupta 		,  		 			T K Bandhopadhyay 		.  	 	 		\textit{International Journal of Computer Applications}  		December 2011. 35  (5)  p. .  	 
\bibitem[Shastri et al.]{b3}\label{b3} 	 		\textit{Performance Analysis of Ad-Hoc Network under Node Failure},  		 			Alankar Shastri 		,  		 			Pallavi Khatri 		,  		 			Shilpi Jain 		.  		1.  	 	 (IJCTEE\textunderscore 0910\textunderscore 32.pdf volume) 
\bibitem[Alankarshastri and Jain]{b5}\label{b5} 	 		\textit{Performance Analysis of Ad-Hoc Network under Node Failure},  		 			Pallavikhatri Alankarshastri 		,  		 			Shilpi Jain 		.  		 	 	 (IJCTEE\textunderscore 0910\textunderscore 32..pdf) 
\bibitem[Vidya Kudachi et al. ()]{b12}\label{b12} 	 		\textit{Performance evaluation Of Node disjoint multipath routing protocol based on AODV for manets},  		 			\& Vidya Kudachi 		,  		 			Vvnod Jadhav ; Alankarshastri 		,  		 			Shilpi Pallavikhatri 		,  		 			Jain 		.  		2013.  	 	 (Performance Analysis of Ad-Hoc Network underNode Failure. IJCTEE\textunderscore 0910\textunderscore 32..pdf) 
\bibitem[Sedrati]{b7}\label{b7} 	 		 			Maamar Sedrati 		.  		\textit{Azeddine Bilami and Mohamed Benmohamed "M-AODV :AODV variant to improve quality of service in MANETs" IJCSI vol},  				8.  	 	 (issue 1January 2011 www.IJCSI.org) 
\bibitem[Zongweizhou and Protocol]{b1}\label{b1} 	 		\textit{zhou-zw02@mails},  		 			"security Enhancement Over Ad-Hoc Aodv Routing Zongweizhou 		,  		 			Protocol 		.  		Beijing, China.  		 			Tsinghua University 		 	 	 (tsingh ua.edu.cn) 
\end{bibitemlist}
 			 		 	 
\end{document}
