\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={Node Disjoint Multipath Routing Approach for Controlling Congestion 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{2012-01-15 (revised: 15 January 2012)}
\def\TheID{\makeatother }
\def\TheDate{2012-01-15}
\title{Node Disjoint Multipath Routing Approach for Controlling Congestion 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]{Mr. Gaurav  Deshmukh}

             \author[2]{Dr. Abhishek  Bande}

             \affil[1]{  University of Pune, Pune, Maharashtra India.}

\renewcommand\Authands{ and }

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

\maketitle


\begin{abstract}
        


Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Nodedisjoint routing becomes inessential technique in communication of packets among various nodes in networks. Meanwhile AODV (Ad Hoc On-demand Multipath Distance Vector) creates single-path route between a pair of source and destination nodes. Some researches has done so far to make multipath node-disjoint routing based on AODV protocol. But however their overhead and end-to-end delay are relatively high, while the detail of their code is not available too. In an ad hoc network, identification of all node-disjoint paths between a given pair of nodes is a challenging task. The phenomena that a protocol is not able to identify all node-disjoint paths that exist between a given pair of nodes is called path diminution. In this paper, we discuss that path diminution is unavoidable when a protocol discovers multiple node-disjoint paths in a single route discovery and working of node disjoint multipath protocol.

\end{abstract}


\keywords{routing; ad hoc networks; path diminution; node-disjoint multipath routing; single route discovery, node disjoint routing.}

\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
obile ad hoc network is a type of wireless that is composed of wireless mobile nodes. Each mobile node dynamically changes the network topology without relying on a wired backbone network or a fixed base station. Mobile nodes in MANETs are constrained by their limited power, processing, memory resources and high degree of mobility. In such networks, the wireless mobile nodes may dynamically join or leave the network topology. In MANETs, many routing protocols have been suggested to communicate between mobile nodes. And pertinent routing protocols are used in various network environment and application.\par
Multipath routing protocols search nodedisjoint, link disjoint or non-disjoint routes during the rout discovery Process. Node-disjoint routes have completely disjoint routes where there are no nodes or links in common. Link-disjoint routes have no links in common but may have nodes in common. Non-disjoint routes may use nodes or links in common. Following are the figures which explains the what are the node disjoint paths and link disjoint paths. If a node or link fails (and it is used by the main and backup route) in non-disjoint and link-disjoint routes, then main and backup routes will be disconnected at the same time. However in nodedisjoint routes, main routes and backup routes use completely different nodes or links. Therefore, even though main route will be disconnected, data transmission may be available through the backup route.\par
In single-path routing protocols, route maintenance may be Performed after route fail. Therefore, data transmission will be stopped while the new route is established, causing data transmission delay. On the other hand, multipath routing protocols perform the route maintenance process even if only one route fails among the multiple routes. To perform the route maintenance process before all routes fail, the network must always maintain multiple routes. This can reduce data transmission delays caused by link failure.\par
Other than the source and the destination, node-disjoint paths have no node in common, while link-( D D D D )\par
disjoint paths do not share any link. Clearly, nodedisjoint paths are also link-disjoint paths. Node-disjoint paths are desirable where node resources are Scarce or when nodes are susceptible to failure. On the other hand, link-disjoint paths are preferred where link resources are scarce or when only links are susceptible to failure. Using link-disjoint paths, one can address the issue of fault-tolerance. However, link-disjoint paths cannot be used for simultaneous data transfer because doing so will overload the nodes that are common in more than one path. Using node-disjoint paths, one can address fault-tolerance as well as load sharing. 
\section[{II.}]{II.} 
\section[{Related work}]{Related work}\par
Multipath routing establishes multiple routes between source and destination nodes. For fault tolerance, even if one route failure occurs, source nodes can maintain connections by using other routes. So multiple routing protocols can reduce data transmission failures and delay times that are caused by route disconnection. Multipath routing protocols search nodedisjoint, link disjoint or non-disjoint routes during the route discovery process. Node-disjoint routes have completely disjoint routes where there are no nodes or links in common. Link-disjoint routes have no links in common but may have nodes in common. Non-disjoint routes may use nodes or links in common. If a node or link fails (and it is used by the main and backup route) in non-disjoint and link-disjoint routes, then main and backup routes will be disconnected at the same time. However in node-disjoint routes, main routes and backup routes use completely different nodes or links. Therefore, even though main route will be disconnected, data transmission may be available through the backup route. In single-path routing protocols, route maintenance may be performed after route fail. Therefore, data transmission will be stopped while the new route is established, causing data transmission delay. On the other hand, multipath routing protocols perform the route maintenance process even if only one route fails among the multiple routes. To perform the route maintenance process before all routes fail, the network must always maintain multiple routes. This can reduce data transmission delays caused by link failure.\par
Several implementation of multipath routing are based on AODV; typical examples are AOMDV, AODVM, AODV-BR and MP-AODV protocols. The AOMDV \hyperref[b1]{[2]} protocol establishes loop-free link-disjoint paths in the network. When intermediate nodes receive the RREQ packet from the source node, AOMDV stores all RREQ packets, unlike conventional AODV, which discards duplicates. So, each node maintains a firsthop-list where information from additional field called firsthop in RREQ packet to indicate the neighbor node of the source nodes. If firsthop of received RREQ packet is duplicated from its own firsthop-list, the RREQ packet is discarded.\par
On the other hand, the RREQ packet is not duplicated from previous RREQ packets. Then the node updates the nexthop, hopcount and advertised-hopcount in routing table. At the destination, RREP packets are sent from each received RREQ packet. The multiple routes are made by RREP packets that are follow the reverse routes that have been setup already in intermediate nodes \hyperref[b5]{[6]}.\par
For For the AODV-BR protocol, neighbor nodes overhear the RREP packets for establishing and maintaining the backup routes during the route initiation process. If part of the main route is broken, nodes broadcast error packets to neighbor nodes. When neighbor nodes receive the error packet, they establish an alternate route using information about the overheard RREP packets previously. AOMDV has the overhead of storing multiple next hops and hop counts and the first hop list for each destination. By overhearing the neighbor's packets, AODVM may not establish alternate routes depending on the path along which the RREP packets are sent. Moreover, to speak strictly, AODV-BR is not a multipath routing protocol, because it only maintains bypass routes when the main route is broken by using the neighbor nodes around the main routes. MP-AODV protocol uses the modified RREQ and RREP packet that has additional 1bit flag 'F'. This flag distinguishes the packet into the main route (RREQ, RREP) or backup route (RREQ\textunderscore 2, RREP\textunderscore 2) route discovery processes. Unlike a conventional AODV, intermediate nodes that receive the RREP packet increment the RREQ ID value in the seen table. By incrementing the RREQ ID value, the protocol ensures that a backup route will not use any nodes that belong to the main route. When a source node receives the RREP packet, the main route is established, and the source node starts data transmission and broadcasts the RREQ\textunderscore 2 packet (a packet with a RREQ ID value of two) for simultaneously searching a backup route. RREQ\textunderscore 2 is a packet for establishing a backup route, and its flag bit F is set to one. When the RREQ\textunderscore 2 packets are delivered to the intermediate nodes, the RREQ ID values in the seen table are compared with the RREQ ID values in the RREQ\textunderscore 2 packets. If they are identical, the nodes discard the RREQ\textunderscore 2 packet. If not, the nodes forward the RREQ\textunderscore 2 packet continuously.\par
When nodes belonging to the main route receive the RREP packet, the RREQ ID value in the RREQ\textunderscore 2 packet and the RREQ ID value in the seen table are identical because the protocol has already increased the RREQ ID value in the seen table during the previous route discovery process. After this process, the intermediate nodes belonging to the main route do not join in the backup routes.\par
MP-AODV has high control overhead and endto-end delay, because it uses at last five control packets to establish two node-disjoint route. 
\section[{III.}]{III.} 
\section[{Multipath routing protocol}]{Multipath routing protocol}\par
We call the proposed protocol Vertex Disjoint Multipath Routing (VDMR). Like other on-demand protocols, VDMR is also based on the request-reply paradigm. We describe the protocol in two phases: route discovery and route maintenance. 
\section[{a) Route discovery}]{a) Route discovery}\par
If a source node, S, wishes to communicate with a destination node, D, and it does not have a route to the destination, it initiates a route discovery. To initiate a route discovery, node S broadcasts a route request (RREQ). The transmitted RREQ is heard by all nodes which are in the transmission range of the source. The RREQ carries the following information in its header: the RREP to the next node along the path. When node S receives an RREP, it stores the path to node D in its Route Cache. 
\section[{b) Route maintenance}]{b) Route maintenance}\par
If a link failure occurs while transmitting data packets, then a node sensing link failure generates a route error (RERR) message. An RERR contains the route to node S. The RERR message informs upstream nodes about the link failure. All the nodes update their routing tables by deleting the entry of the path along which a link failure occurred. When an RERR reaches node S, it also updates its routing table by deleting the entry of the path that has failed. Then, it looks up its routing table for a path. If it finds a path, it starts sending data packets along the path. Otherwise node S initiates a new route discovery. In what follows, we discuss that a protocol may or may not be able to discover all nodedisjoint paths that exist in the network between a given pair of nodes. c) Path diminution By 'path diminution'4 we mean that the number of node-disjoint paths discovered by a protocol is less than the number of node-disjoint paths that exist in the network between a given pair of nodes. There are two reasons of path diminution: RREQ forwarding policy and computation of disjointness at the destination. We are, here, concerned with the occurrence of path diminution due to an RREQ forwarding policy A policy which is generally adopted in single path routing protocols such as Dynamic Source Routing (DSR) \hyperref[b2]{(Johnson and Maltz, 1996)} and Ad hoc On-demand Distance Vector Routing (AODV)  {\ref (Perkins and Royer, 1999}) is that only the first copy of an RREQ is forwarded at an intermediate node, while other copies are discarded. This policy works well for finding a path from a given source to a destination. However, if one wishes to use it in a protocol to discover multiple node-disjoint paths, the protocol may or may not be able to discover all node-disjoint paths that exist between a given pair of nodes. Although, there exist two node-disjoint paths between s and d, the protocol is not able to find them. 
\section[{e) An expensive solution}]{e) An expensive solution}\par
One method for mitigating path diminution can be described as follows. An intermediate node discards only those copies of an RREQ that cause loops. The node forwards all other copies of an RREQ after appending its own address to the Path Traversed of the copy of the RREQ. The destination collects all copies of the RREQ before computing disjointness. Assuming that an algorithm for computing the maximum set of nodedisjoint paths is available, one will be able to discover all node-disjoint paths. The number of RREQs that an intermediate node has to transmit can be as large as (n ? 3)! 5 Further, the number of copies of an RREQ that may reach the destination can be as large as (n ? 2)! 6\par
As a result, this scheme requires an exponential amount of computational and communication overheads. Clearly, this solution is not acceptable in an ad hoc network where resources of nodes are limited. 
\section[{f) Mitigating path diminution}]{f) Mitigating path diminution}\par
We propose three schemes to mitigate path diminution. In a fundamental sense, these schemes play upon the number of RREQs that each intermediate node forwards and the manner in which it selects the RREQs that are forwarded. However, the features that are common among all proposed schemes are as follows.\par
? To prevent loops, an intermediate node checks whether its own address is already present in Path Traversed of the RREQ. If that is so, it discards the RREQ. Otherwise, it forwards the RREQ according to a stated policy.\par
? Before forwarding a copy of an RREQ, an intermediate node appends its own address to Path Traversed of the RREQ.\par
? To keep a record of the RREQs forwarded, a node maintains a RREQ Cache. Before forwarding a copy of the RREQ, a node stores the RREQ in its RREQ Cache.\par
We now discuss the features of the proposed schemes that are different.  along each node disjoint paths. In other words, if 2DC is used as RREQ forwarding policy, the protocol will be able to find both node-disjoint paths in the example network. There is no guarantee that any of these schemes will always discover all nodedisjoint paths between a given pair of nodes. However, these schemes are adopted to introduce a diversity in the Path Traversed of the copies of an RREQ that reach the destination. In other words, adoption of the policies discussed above can enhance the chances of forwarding those copies of ii. Node Disjoint Multipath Routing Considering Link and Node Stability\par
The main aim of the proposed work is to find the multiple node disjoint routes from source to a given destination Also it keeps track of the route bandwidth which can be further used by the source to select the optimal routes. From the factors Link Expiration Time (LET)  {\ref [19]} and Drain Rate (DR)  {\ref [22]} it is inferred that the Link Stability: a) Depends directly on Mobility factor b) Depends inversely on the energy factor Hence, Link Stability Degree (LSD) is defined as: LSD = Mobility factor / Energy factor\par
It defines the degree of the stability of the link. Higher the value of LSD, higher is the stability of the link and greater is the duration of its existence. Thus, a route having all the links with LSD > LSDthr is the feasible. We choose the Dynamic Source Routing (DSR) \hyperref[b4]{[5]} protocol as a candidate protocol. Modifications are made to the Route Request (RREQ) and Route Reply (RREP) packets to enable the discovery of link stable node disjoint paths. The proposed scheme has three phases: Route Discovery, Route Selection and Route Maintenance. The various phases are described as follows:\par
a. Route Discovery\par
The source node when needs to send packet to some destination node, starts the route discovery procedure by sending the Route Request packet to all its neighbors .In this strategy , the source is not allowed to maintain route cache for a long time, as network conditions change very frequently in terms of position and energy levels of the nodes. Thus, when a node needs route to the destination, it initiates a Route Request packet, which is broadcasted to all the neighbors which satisfy the broadcasting condition. Route Request packet of NDMLNR is shown in figure. Time to Live (TTL) field: It is used to limit the life time of packet, initially, by default it contains zero.\par
Hop field: It carries the hop count; the value of hop count is incremented by one for each node through which packet passes. Initially, by default this field contains zero value.\par
LSD field: when packet passes through a node, its LSD value with the node from which it has received this packet is updated in the LSD field. Initially, by default this field contains zero value.\par
Bandwidth field: carries the cumulative bandwidth of the links through which it passes; initially, by default this field contains zero value.\par
Path field: It carries the path accumulations, when packet passes through a node; its address is appended at end of this field.\par
The node's current velocity, direction and position are updated at each node in the respective fields before forwarding the RREQ packet.\par
Every node maintains a Neighbor Information As RREQ reaches a node it enters its information in the NIT. It makes all the entries for the requests till Wait Period. At the end of the Wait Period, it accepts the request with the highest value in LSD field. It adds the value of the link bandwidth to the Bandwidth field of the RREQ packet. If two RREQs have same LSD values, the one with lesser value of hop count is selected. In case, hops are also same, one with higher bandwidth is selected. In the worst case, RREQ is selected on First-come-first -serve basis. This prevents loops and unnecessary flooding of RREQ packets. None of the intermediate nodes is allowed to send RREP if it has the current route to the destination. As doing this may lead to those paths which do not fulfill current QoS requirements. 
\section[{b. Route Maintenance}]{b. Route Maintenance}\par
In case, LSD of a node falls below LSDthr, it informs its predecessor node of the node failure by sending the NODEOFF message. Once a node receives such a message, it sends the ROUTEDISABLE message to the source node. Source can then reroute the packets to the backup routes. If no backup route exists, the source then starts the route discovery procedure again.  \hyperref[b11]{13)}. At this moment it selects the one from node 1 with higher LSD value, 20. It updates the path field of the RREQ packet as 1-4 and the bandwidth field to 7. It forwards the packet to both its neighbors, 5 and 8, with LSD values 16 and 18 respectively. Node 3 has only one neighbor, 6 which satisfies the LSD value and hence, it updates RREQ path field as 1-2-3 and the bandwidth field to 14 and forwards the packet to node 6. Node 6 now receives a path from source node 1. It appends its own ID to it. Thus, first path is 1-2-3-6 and bandwidth of this path is 17. Node 5 after receiving the RREQ packet with path 1-4, checks for its neighbors and forwards RREQ with updated path field to 1-4-5 and bandwidth field to14 to nodes 9 and 6 Node 6 now receives another path,1-4-5.It appends its ID to it, to get the path, 1-4-5-6 with bandwidth 19. Node 8 after receiving the RREQ packet forwards it to its neighbor, 9, after updating path field to 1-4-8 and bandwidth field to 15 Node 9 can receive two packets in its wait time, one from node 5 and the other from node 8. It updates its NIT as \hyperref[b0]{(1,}\hyperref[b5]{6,}\hyperref[b0]{1,}\hyperref[b2]{3,} {\ref 16,} {\ref 22)} and (1,6,1,3,18,21). To select from the one, it chooses one from node 8 as its LSD value is higher, 18. It then forwards the request after updating the path field as 1-4-8-9 and bandwidth field to 21. Node 6 again receives another path 1-4-8-9.It appends its ID to this path to get 1-4-8-9-6 with bandwidth 28.Now node 6 receives two paths 1-4-5-6 and 1-4-8-9-6 with node 4 as common node. It selects the one with higher bandwidth i.e. Path, 1-4-8-9-6 with bandwidth 28.\par
IV. 
\section[{Conclusion}]{Conclusion}\par
In this paper, we proposed a routing protocol that establishes two node-disjoint routes between source and destination nodes based on AODV protocol for MANETs. NMN-AODV uses three control packets for establishes two routes, but MP-AODV uses five control packets. Thus NMNAODV has law overhead to MP-AODV. In addition, two routes will not break at the same time because the protocol uses node-disjoint multiple routes that are not duplicated between main and backup routes. NMN-AODV establishes two nodedisjoint faster than MP-AODV because NMNAODV starts to establish backup route faster than MP-AODV. Thus nd-to-end delay is lawyer than MP-AODV. Also this protocol sends the data immediately after the main route is found by separating the main route and backup route discovery process to reduce the data transmission delay. In the future work, we will compare NMN-AODV with other multipath routing protocols based on AODV such as AOMDV, AODVM and AODV-BR.\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Fig (}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_1}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{fig_2}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-5.png}
\caption{\label{fig_3}3 .}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-6.png}
\caption{\label{fig_4}}\end{figure}
   \begin{figure}[htbp]
\noindent\textbf{(} \par 
\begin{longtable}{P{0.6146153846153846\textwidth}P{0.026153846153846156\textwidth}P{0.05230769230769231\textwidth}P{0.03923076923076923\textwidth}P{0.1176923076923077\textwidth}}
SA DA\tabcellsep ID\tabcellsep Hops\tabcellsep LSD\tabcellsep Bandwidth\\
\multicolumn{5}{l}{Fig (e) : Neighbor Information Table (NIT)}\end{longtable} \par
 
\caption{\label{tab_2}Table (}\end{figure}
 			\footnote{© 2012 Global Journals Inc. (US)Global Journal of Computer Science and Technology} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Chang-Woo Ahn et al. ()]{b13}\label{b13} 	 		‘A Node-Disjoint Multipath Routing Protocol Based on AODV in Mobile Ad-hoc Networks’.  		 			Sang-Hwa Chang-Woo Ahn 		,  		 			Tae-Hun Chung 		,  		 			Su-Young Kim 		,  		 			Kang 		.  	 	 		\textit{International Conference on Information Technology},  				2010. IEEE.  	 
\bibitem[Perkins and Royer ()]{b5}\label{b5} 	 		‘Ad hoc On-Demand Distance Vector Routing (AODV)’.  		 			C E Perkins 		,  		 			E M Royer 		.  	 	 		\textit{IETF RFC}  		2003. 3561.  	 
\bibitem[Chen and Nahrstedt ()]{b7}\label{b7} 	 		‘An Overview of Quality-of-Service Routing for the next Generation High -Speed Networks: Problems and Solutions’.  		 			S Chen 		,  		 			K Nahrstedt 		.  	 	 		\textit{IEEE Network Magazine}  		1998. 12 p. .  	 
\bibitem[Johnson and Maltz ()]{b2}\label{b2} 	 		\textit{Dynamic source routing in ad hoc wireless networks. Mobile Computing},  		 			D B Johnson 		,  		 			D A Maltz 		.  		1996. p. .  	 
\bibitem[Toussaint]{b12}\label{b12} 	 		\textit{Multipath Routing in Mobile Ad Hoc Networks},  		 			M T Toussaint 		.  		 	 	 (TUDelft/ TNO Traineeship Report) 
\bibitem[Ge et al. (2009)]{b11}\label{b11} 	 		‘Multipath Routing with Reliable Nodes in Large-Scale Mobile Ad-Hoc Networks’.  		 			Y Ge 		,  		 			G Wang 		,  		 			Q Zhang 		,  		 			M Guo 		.  	 	 		\textit{IEICE Transactions on Information and Systems}  		Sept. 2009.  (9)  p. .  	 
\bibitem[Goldenberg et al. ()]{b1}\label{b1} 	 		‘Network localization in partially localizable networks’.  		 			D Goldenberg 		,  		 			A Krishnamurthy 		,  		 			W Maness 		,  		 			Y R Yang 		,  		 			A Young 		,  		 			A S Morse 		,  		 			A Savvides 		,  		 			B Anderson 		.  	 	 		\textit{IEEE INFOCOM},  				2005.  	 
\bibitem[Li and Wu ()]{b4}\label{b4} 	 		‘Node-disjoint parallel multipath routing in wireless sensor networks’.  		 			S Li 		,  		 			Z Wu 		.  	 	 		\textit{ICESS},  				2005.  	 
\bibitem[Marina and Das ()]{b8}\label{b8} 	 		‘On-Demand MultiPath Distance Vector Routing in Ad hoc Networks’.  		 			M K Marina 		,  		 			S R Das 		.  	 	 		\textit{Proceedings of the Ninth International Conference on Network Protocols (ICNP\}},  				 (the Ninth International Conference on Network Protocols (ICNP\})  		2001. IEEE Computer Society Press. p. .  	 
\bibitem[Hong et al. ()]{b9}\label{b9} 	 		‘Scalable Routing Protocols for Mobile Ad Hoc Networks’.  		 			X Hong 		,  		 			K Xu 		,  		 			M Gerla 		.  	 	 		\textit{IEEE Network}  		2002. 16  (4)  p. .  	 
\bibitem[Blazevic et al. ()]{b10}\label{b10} 	 		‘Self Organized Terminode Routing’.  		 			L Blazevic 		,  		 			S Giordano 		,  		 			J Le Boudec 		.  	 	 		\textit{Cluster Computing},  				2002. Springer Science Business Media. p. .  	 
\bibitem[Lee and Gerla ()]{b3}\label{b3} 	 		‘Split multipath routing with maximally disjoint paths in ad hoc networks’.  		 			S.-J Lee 		,  		 			M Gerla 		.  	 	 		\textit{ICC},  				2001.  	 
\bibitem[Cheng et al. ()]{b0}\label{b0} 	 		‘Underwater localization in sparse 3d acoustic sensor networks’.  		 			W Cheng 		,  		 			A Y Teymorian 		,  		 			L Ma 		,  		 			X Cheng 		,  		 			X Lu 		,  		 			Z Lu 		.  	 	 		\textit{IEEE INFOCOM},  				2008.  	 
\bibitem[Hass and Pearlmann ()]{b6}\label{b6} 	 		‘Zone routing Protocol’.  		 			Z Hass 		,  		 			R Pearlmann 		.  	 	 		\textit{IETF Internet Draft}  		1999.  	 
\end{bibitemlist}
 			 		 	 
\end{document}