\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={An Improvement in Congestion Control Using Multipath Routing in Manet},
 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{An Improvement in Congestion Control Using Multipath Routing in Manet}
\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]{Dr. Abhishek  Bande}

             \author[2]{Mr. Gaurav  Deshmukh}

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

\renewcommand\Authands{ and }

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

\maketitle


\begin{abstract}
        


The ad hoc connections, which opens many opportunities for MANET applications. In ad hoc network nodes are movable and there is no centralised management. Routing is an important factor in mobile ad hoc network which not only works well with a small network, but also it can also work well if network get expanded dynamically. Routing in Manets is a main factor considered among all the issues. Mobile nodes in Manet have limited transmission capacity, they intercommunicate by multi hop relay. Multi hop routing have many challenges such as limited wireless bandwidth, low device power, dynamically changing network topology, and high vulnerability to Failure. To answer those challenges, many routing algorithms in Manets were proposed. But one of the problems in routing algorithm is congestion which decreases the overall performance of the network so in this paper we are trying to identify the best routing algorithm which will improve the congestion control mechanism among all the Multipath routing protocols.

\end{abstract}


\keywords{disjoint multipath, multi hop, reliability, congestion control, optimization.}

\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 self configuring, self organizing and self maintaining dynamic network. A mobile ad hoc network (MANET) is a network consisting of a set of mobile nodes with no centralized administration \hyperref[b0]{[1,}\hyperref[b1]{2]}. In mobile ad hoc network nodes are in movable format means they can form any topology as they change their position so by considering nodes are movable we are currently having many protocols for routing in multipath. The main objective of multipath routing protocols is to provide reliable communication and to ensure load balancing ad to improve quality of service of MANETs. These multipath protocols are broadly classified into five categories to improve delay, provide reliability, reduce overhead, maximize network life and hybrid routing. In multipath routing protocols have issues for multiple paths discovery and maintaining these paths. Issues, objectives, performances, advantages and disadvantages of these protocols are summarized. In MANETs each mobile node has limited resources such as battery, processing power, and on-board memory (i.e., RAM). In MANETs, mobile nodes communicate with each other in a multi-hop fashion. That means a mobile node sends a packet to a destination via intermediate nodes. Hence, the availability of each node is equally important in MANETs. Otherwise, overall performance of the network may be affected by single intermediate node. In order to meet these characteristics and design constraints, an efficient routing protocol is essential for MANET. Designing an efficient routing protocol for MANETs is a very challenging task to achieve. Many routing protocols have been proposed and these protocols can be classified as proactive and reactive. In proactive routing protocols like destination sequence distance vector (DSDV) mobile nodes update their routing tables by periodically exchanging routing information among themselves. Proactive routing protocol generates large number of control messages in the network due to periodic information exchanges. Hence, proactive routing protocols are not considered suitable for MANET. To overcome the limitations of proactive routing protocols \hyperref[b2]{[3]}, reactive routing protocols like dynamic source routing (DSR) and ad hoc on-demand distance vector routing (AODV) protocols have been proposed for MANET. In reactive routing protocol, a route is discovered when it is required. Reactive routing protocol consists of two main mechanisms: (a) route discovery and (b) route maintenance. A source node discovers a route to a destination by using the route discovery mechanism. On the other hand, a source node detects any topology change in the network by using the route maintenance mechanism. In route discover procedure Once all paths have been discovered \hyperref[b3]{[4]}, a source node chooses a path, which is the shortest and stores remaining paths in database. When the shortest path algorithm is used, nodes which is located around the center of a network may carry more traffic compared to other nodes that are located at the other or boundary of the same network. When multiple connections are setup in a network, the wireless links located at the center of the network carry more traffic and can, therefore network gets congested. This type of congestion problem may affect the performance of a network in terms of delay, throughput and reliability. If source node chooses shortest path then it may break due to node movement as nodes are movable. Moreover, communication through a wireless medium is inherently unreliable and is also subjected to link errors like UDP.\par
Multipath routing protocols proposed for MANET can be broadly classified as \hyperref[b4]{[5]} (a) delay aware multipath routing protocols, (b) reliable multipath routing M protocols, (c) minimum overhead multipath routing protocols,(d) energy efficient multipath routing protocols and(e) hybrid multipath routing protocols. In this paper we are covering all the protocols which are for multipath based on congestion control. 
\section[{II.}]{II.} 
\section[{Literacher servey a) Computer Network}]{Literacher servey a) Computer Network}\par
A Network is defined as the group of people or systems or organizations who want to share their information collectively for their business purpose. In Computer terminology the definition for networks is similar as a group of computers logically connected for the sharing of information or services (like print services, multi-tasking etc.). These networks may be fixed (cabled, permanent) or temporary. The wired networks are generally connected with the help of wires and cables means there exist a physical connection between two computers. Generally the cables being used in this type of networks are CAT5 or CAT6 cables. The connection is usually established with the help of physical devices like Switches and Hubs in between to increase the strength of the connection. In wired network there is a reliability of data to be reached at destination. Following are some advantages of wired network. 
\section[{Types of Computer}]{Types of Computer} 
\section[{Advantages:}]{Advantages:}\par
A wired network offer connection speeds of 100Mbps to 1000Mbps. Physical, fixed wired connections are not prone to interference and fluctuations in available bandwidth, which can affect some wireless networking connections. 
\section[{Disadvantages:}]{Disadvantages:}\par
Wired networks are expensive to maintain the network due to many cables between computer systems and even if a failure in the cables occur then it will be very hard to replace that particular cable as it involved more and more costs.\par
When using a laptop which is required to be connected to the network, a wired network will limit the logical reason of purchasing a laptop in the first place.\par
ii. Wireless Network In Wireless networks there is no physical existence of cable between two computers. It use some sort of radio frequencies in air to transmit and receive data instead of using some physical cables. The Wireless network eliminates the disadvantage of wired networks and it also eliminates cable cost. 
\section[{Advantages:}]{Advantages:}\par
Mobile users are provided with access to realtime information even when they are away from their home or office. Network can be extended to places which cannot be wired. Wireless networks offer more flexibility and adapt easily to changes in the configuration of the network. 
\section[{Disadvantages:}]{Disadvantages:}\par
Interference due to weather, other radio frequency devices, or obstructions like walls. The total Throughput is affected when multiple connections exists.\par
In Wireless network there is no guarantee of data to reach at destination. 
\section[{b) Routing}]{b) Routing}\par
Routing is the process of selecting paths in a network along which to send network traffic. It is an act of moving information across an inter-network from a source to destination. The routing table doesn't depend on the state of the network status, i.e. whether the destination is active or not. Static routing doesn't depend on availability of destination node.\par
ii. Dynamic Routing Dynamic routing refers to the routing strategy that is being learnt by an interior or exterior routing protocol. This routing mainly depends on the state of the network i.e. the routing table is affected by the activeness of the destination. 
\section[{c) Mobile Ad-Hoc Network}]{c) Mobile Ad-Hoc Network}\par
A wireless mobile ad hoc network [6] is usually defined as a set of wireless mobile nodes dynamically self-organizing a temporary network without any central administration or existing network infrastructure. Since the nodes in wireless ad hoc networks can serve as routers, they are movable so they can form any type of topology. They forward packets for other nodes if they are on the route from source to the destination (like intermediate node. Besides other issues, routing is an important problem in need of a solution that not only works well with a small network, but also sustains scalability as the network gets expanded and the application data gets transmitted in larger volume. Since mobile nodes have limited transmission capacity, they mostly intercommunicate by multi hop relay. Multi hop routing is challenged by limited wireless bandwidth, low device power, dynamically changing network topology, and high vulnerability to failure, to name just a few. To answer those challenges, many routing algorithms in MANETs [6] were proposed. There are different dimensions to categorize them: proactive routing versus on-demand routing, or single-path routing versus multipath routing. In proactive protocols, routes between every two nodes are established in advance even though no transmission is in Demand and in reactive routing routes between every two nodes are established when needed.\par
Our motivation is that congestion is a cause for packet loss in MANETs [6]; mostly packets will loss cause of congestion only. Our aim is to control congestion in MANETs  {\ref [6]}. Typically, reducing packet loss involves congestion control. Congestion in routing in MANETs [6] may lead to the following problems:\par
1. Long delay: It takes time for a congestion to be detected by the congestion control mechanism. In severe congestion situations, it may be better to use a new route. The problem with an on-demand routing protocol is the delay it takes to search for the new route.\par
2. High overhead: In case a new route is needed, it takes processing and communication effort to discover it. If multipath routing is used, though an alternate route is readily found, it takes effort to maintain multiple paths. resources (bandwidth, buffers, and queues). When number of packets are present in a network is greater than capacity of network then this situation is called as congestion. Congestion in a network may occur when the load on the network i.e. the number of packets sent to the network is greater than the capacity of network. 
\section[{Congestion Control Mechanisms:}]{Congestion Control Mechanisms:}\par
i.\par
End-system flow control: This is not a congestion control mechanism scheme, but it is a way to prevent the sender in network from overflow the buffers of the receiver. ii.\par
Network congestion control: In this scheme, end systems choke back in order to avoid congesting the network. The mechanism is similar to end-toend flow controls, but the main intention is to reduce congestion in the network, not the receiver. iii.\par
Network-based congestion avoidance: In this scheme, a router detects that congestion may occur and attempts to slow down senders before queues become full. iv.\par
Resource allocation: This technique involves scheduling the use of physical circuits or other resources, for a specific time period. A virtual circuit, built across a series switches with a guaranteed bandwidth is a form of resource allocation. This technique is difficult, but can eliminate network congestion by blocking traffic that is in excess of the network capacity. The AODV protocol \hyperref[b0]{[1]} is a reactive routing protocol it is also called as a pure on-demand routing protocol because a mobile node does not have to maintain any routing information if it is not located in an active path. Like DSR, the AODV protocol also consists of two main mechanisms a route discovery and a route maintenance mechanism. But the route request packet (RREQ) structure of the AODV protocol is different from that of the DSR protocol. To detect a fresh or new route from an old route, each node maintains two counters such as node sequence ID and broadcast ID. Each route request (RREQ) packet contains information about the destination sequence number which is used for distinguish from remaining node and the source sequence number in addition to source address and destination address. The sequence numbers are used to indicate the freshness and newness of a route in network. Each neighbor node either sends a reply message called as RREP to a source or it rebroadcasts a request message RREQ to its neighbors depending on whether it is the destination or not. If a node is not the destination, it needs to keep track of a request packet to set up a reverse path as well as a forward path. When a destination replies back to a source, it uses the reverse path. Mobile nodes can determine whether a route is a current one or an old one by comparing the destination sequence number in the RREQ packet with that of the sequence number stored in the route cache. If the route request sequence number is greater than the recorded one, it does not send a reply to the source. Instead, it rebroadcasts that request message. An intermediate node only replies from its route cache if the route request sequence number is less than or equal to the sequence number stored in the route cache. If a node does have a current route, it sends a reply using a unicast route reply packet (RREP). The reply packet travels along the reverse path, which was set up previously. When a reply packet travels back through the reverse path, each intermediate node sets up a forward path to the node from which it receives this reply. When a route reply packet reaches the source, the source starts sending data packets to the destination using the discovered path. If that source learns more routes later on, it updates its route cache accordingly. 
\section[{b. AODV Properties}]{b. AODV Properties}\par
? Floods RREQs with unique IDs so duplicates can be discarded. AODV DSR 1) FZR 1) MSR 2) AODV-PSP 2) E2FT 3) BGR 3 4) RMSR\par
) SMR\par
? No multiple complete routes available.\par
? Alternative route(s) determined in RREP phase.\par
? Alternative route(s) by overhearing RREPs to other nodes. ? No complete route(s) information known at source. 
\section[{ii. Fresnel zone routing (FZR)}]{ii. Fresnel zone routing (FZR)}\par
FZR is a multipath routing protocol which supports congestion control. It classifies intermediate nodes according to their capacity and efficiency in forwarding packets. FZR protocol is a combination of both proactive and reactive routing protocols. FZR \hyperref[b8]{[10]} can lighten congestion at an intermediate node and achieve better transport layer throughput. In FZR path hop count which is nothing but the shorter distance traveled by the packet so the hop count is used for zone construction. In FZR \hyperref[b8]{[10]}, each node maintains a distance table; the table consists of the fields: destination address, sequence number and hop distance. To construct and maintain these tables, a mobile node broadcasts Hello messages. Upon receiving a Hello message, a node updates its own table. When a distance table is propagated throughout the network, each node updates its distance table and the first order paths are discovered. FZR \hyperref[b8]{[10]} discovers alternate second order path with an on-demand approach. A source node or an intermediate node located in the first zone initiates the route discovery process. When a neighbor located in the second zone receives a request packet, it sends a reply message to the originating node via the upstream neighbors. The upstream nodes then record the forward path in the table and forward the reply messages to the originator. Upon receiving a reply massage, the originator records the path in the forward path table and this procedure repeats itself until message packet received at destination. Then data is transferred on this path.\par
iii. Ad hoc On-demand Multipath Distance Vector routing (AOMDV) a. AOMDV description\par
The AOMDV uses the basic AODV route construction process. In this case, some extensions are made to create multiple link-disjoint paths. The main idea in AOMDV is to compute multiple paths during route discovery. It consists of two components: -A route update rule to establish and maintain multiple loop-free paths at each node. -A distributed protocol to find link-disjoint paths.\par
Before describing AOMDV \hyperref[b6]{[8]}, we first discuss AODV, from which it is derived. In AODV, when a source needs a route to a destination, it initiates a route discovery process by flooding a RREQ for destination throughout the network. RREQs should be uniquely identified by a sequence number so that duplicates can be recognized and discarded. Upon receiving a nonduplicate RREQ, an intermediate node records previous hop and checks whether there is a valid and fresh route entry to the destination in routing table. If such entry is found, the node sends back a RREP to the source; if not it rebroadcasts the RREQ message. A node updates its routing information and propagates the RREP upon receiving further RREPs only if a RREP contains either a larger destination sequence number or a shorter route found.\par
In AOMDV \hyperref[b6]{[8]} each RREQ, respectively RREP arriving at a node defines an alternate path to the source or destination. Just accepting all such copies will lead to the formation of routing loops. In order to eliminate any possibility of loops, the "advertised hop count" is introduced. The advertised hopcount of a node i for a destination node d represents the maximum hopcount of the multiple paths for node d available at i. The protocol only accepts alternate routes with hopcount lower than the advertised hop count, alternate routes with higher or the same hopcount are discarded. The advertised hop count mechanism establishes multiple loop-free paths at every node. These paths still need to be disjoint. For this we use the following: When a node S floods a RREQ packet in the network, each RREQ arriving at node I via a different neighbor of S, or S itself, defines a node-disjoint path from I to S .\par
In AOMDV this is used at the intermediate nodes. Duplicate copies of a RREQ are not immediately discarded. Each packet is examined to see if it provides a node-disjoint path to the source. For node-disjoint paths all RREQs need to arrive via different neighbors of the source. This is verified with the first hop field in the RREQ packet and the firsthop\textunderscore list for the RREQ packets at the node.\par
At the destination a slightly different approach is used, the paths determined there are link-disjoint, not node-disjoint. In order to do this, the destination replies up to k copies of the RREQ, regardless of the firsthops. The RREQs only need to arrive via unique neighbors. 
\section[{AOMDV properties}]{AOMDV properties}\par
? Extension of AODV.\par
? RREQs from different neighbors of the source are accepted at intermediate nodes.  The AODVM-PSP protocol is an extension of AODVM protocol discussed earlier. The route discovery mechanism of AODVM-PSP [11] is similar to that of the AODV protocol. The multiple paths are set up in a similar manner as that of the AODVM protocol.\par
The main difference between AODVM-PSP and AODVM  {\ref [11]} is that AODV-PSP considers delays along a path while making a routing decision. When a node sends a packet to a destination, the packet includes information as to what time (concept of timestamp) it was transmitted. An intermediate node or a destination node can estimate the delay based on the information included in the packet. The AODVM-PSP does not especially find link-disjointed paths unlike the AODVM [11] protocol. The AODVM-PSP  {\ref [11]} does not use keep alive packet like the AODVM protocol to avoid the congestion. The RSR protocol is based on a disparity routing scheme. In a disparity routing scheme, a message is partitioned or divided in small parts and sent over different paths. The idea is that if a path fails, there is still a chance for other paths to send a packet successfully to a destination. Disparity routing can be broadly classified into two types:\par
Non-redundant and redundant. In nonredundant disparity routing, a message is divided into sub-messages and these sub-messages are routed through different paths. In redundant disparity routing, a message is also divided into sub-messages, but the number of sub-messages is less than the number of discovered paths that the routing protocol uses. The traffic dispersion on different paths is done in a roundrobin fashion where each path has a constant weight of one packet. If no other alternate path is available, RSR performs similarly as DSR. In the destination node, RSR has an agent named duplicate packet filter (DPF) at the destination r. The function of DPF is to filter out the duplicate packets. Moreover, when there is no intermediate node between a source and a destination, PDA does not duplicate a message. PDA also does not duplicate a packet if there is only one route available between a source and a destination. 
\section[{v. Biased geographical routing (BGR) protocol}]{v. Biased geographical routing (BGR) protocol}\par
The BGR  {\ref [11]} protocol improves the delay performance of a network by using the congestion in formation of a network. The main idea behind the BGR protocol is to insert a bias angle in each packet. This bias angle determines the route of a path towards a destination. The BGR protocol uses two congestion control algorithms, namely in-network packet splitter (IPS) and end-to-end packet scatter (EPS). The IPS splits traffic flows to avoid congestion. Congestion arises when too many connections are set up through a certain section of a network (i.e. hot-spot). In order to avoid a hot-spot, the IPS splits the traffic flow just before the hot-spot. The IPS requires periodic information (congestion information) exchanges among neighbors. If IPS fails to reduce congestion, the EPS algorithm is activated. In the case of EPS algorithm, a source splits traffic flows among multiple paths, therefore, reduces congestion.\par
IV. 
\section[{Conclusion}]{Conclusion}\par
Multipath routing can improve network performance in terms of delay, throughput and reliability. Multi path routing protocols also improve load distribution, reliability, delay and energy efficiency. AODVM-PSP (Ad hoc on demand distance vector routing with path selection probability) considers delays along the path while making routing decision. The ability to forward traffic on multiple paths would be useful for customizing paths for different applications, improving reliability, and balancing load. Due to scalability and economic.\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}Fig}\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}
  			\footnote{© 2012 Global Journals Inc. (US) Global Journal of Computer Science and Technology} 			\footnote{© 2012 Global Journals Inc. (US)} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Lei and Perkins (1997)]{b0}\label{b0} 	 		‘Ad Hoc Networking with Mobile IP’.  		 			H Lei 		,  		 			C E Perkins 		.  	 	 		\textit{Proceedings ofthe (EMC '9},  				 (the (EMC '9Bonn)  		September. 1997.  	 
\bibitem[Das et al. (2003)]{b7}\label{b7} 	 		\textit{Ad Hoc on Demand Distance Vector (AODV) Routing},  		 			S Das 		,  		 			C Perkins 		,  		 			E Royer 		.  		 IETF RFC3561.  		July 2003.  	 
\bibitem[Lee and Gerla (2000)]{b5}\label{b5} 	 		‘AODV-BR: Backup routing in ad hoc networks’.  		 			S Lee 		,  		 			M Gerla 		.  	 	 		\textit{Proceedings of IEEE WCNC},  				 (IEEE WCNCChicago)  		2000. September 2000. p. .  	 
\bibitem[Johnson et al. ()]{b3}\label{b3} 	 		‘Dynamic Source Routing for Multihop wireless ad hoc networks’.  		 			David B Johnson 		,  		 			David A Maltz 		,  		 			Josh Broch 		.  	 	 		\textit{Ad Hoc Networking},  				 			Charles E Perkins 		 (ed.)  		2001. Addison-Wesley. p. .  	 
\bibitem[Jonsson (2000)]{b1}\label{b1} 	 		‘G'MIPMANET-Mobile IP for Mobile Ad Hoc Networks’.  		 			U Jonsson 		.  	 	 		\textit{IEE4EAC annual Workshop on Moblle Ad Hoc Aetworking and Compiuting (MobiHOC '02)},  				 (Boston, Mossachusetts, USA)  		August 2000.  	 
\bibitem[Perkins and Hhagwat ()]{b4}\label{b4} 	 		\textit{Highly Dynamic Destination Sequence Vector Rouiting (DSDV) for mobile computers},  		 			C Perkins 		,  		 			P Hhagwat 		.  		1994. Cnomputer Communication. p. .  	 
\bibitem[Kwan-Wu Chin et al. (2002)]{b2}\label{b2} 	 		‘Implementation Experience with MANET Rouitng Protocols’.  		 			John Kwan-Wu Chin 		,  		 			Aidenvwilliams Judge 		,  		 			Roger Kermenode 		.  	 	 		\textit{AM SIGCOMM communication review},  				November 2002. 32.  	 
\bibitem[Marina and Das (2001)]{b6}\label{b6} 	 		‘On-demand Multipath Distance Vector Routing in Ad Hoc Networks’.  		 			M Marina 		,  		 			S Das 		.  	 	 		\textit{Proceedings of the International Conference for Network Procotols (ICNP)},  				 (the International Conference for Network Procotols (ICNP)Riverside)  		Nov. 2001.  	 
\bibitem[Multipath (ed.)]{b8}\label{b8} 	 		\textit{Survey of multipath routing protocols for mobile adhoc networks},  		 			Multipath 		.  		Mohammed Tarique a KemalE.Tepe b, SasanAdibi c, ShervinErfani b (ed.)  		 	 	 (Routing For wireless ad hoc networks by Yibin Liang 11) 
\end{bibitemlist}
 			 		 	 
\end{document}
