\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 Efficient Multi Path Dynamic Routing Protocol for Computing and Constrained Mobile Ad-hoc Network Environment},
 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{An Efficient Multi Path Dynamic Routing Protocol for Computing and Constrained Mobile Ad-hoc Network Environment}
\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. M.  Giri}

             \author[2]{Zabi Ur Rahaman  K}

             \author[3]{Dr. M S  Shashidhara}

\renewcommand\Authands{ and }

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

\maketitle


\begin{abstract}
        


Wireless mobile ad-hoc networks are classified as ad-hoc networks with logical connections. These types of networks do not have fixed topology (or physical connections) due to the mobility property of nodes, interference, propagation and loss of path. Because of all these problems the path established between sources to destination is not reliable and efficient path. Hence a dynamic source routing protocol is required for these networks to working properly. Data transfer using this protocol based on shorted path, all packets need to be transferred using same path. The researcher on MANET proposed many Routing algorithms to this task. The main idea of this paper is to study, understand, and analyze the problems with existing routing methods. In the proposed multi path dynamic routing, first identify multi paths exist between source to destination and select best shortest path and then data is segmented into packets, each packet is transferred to receiver using selected best shortest path. At receiver end received data need to be rearranged. Finally the performance proposed system is compared with existing methods and proposed method shows better performance when compared with existing methods.

\end{abstract}


\keywords{multi-path, 3D network, dynamic routing, packet segmentation, and reassembly.}

\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
personal computer or desktop computer intended for computing purpose. It is fixed in a single location with modern devices. It is mainly working on 1D (one dimension) of computer science area, i.e., computing. Desk top computers are also called as standalone systems. If the person wants to use this category of system, they must be present at room where the system is located, because personal computer is fixed in a single position. The environment setup of standalone systems are shown in figure1. In this model, Client always request service from server, if the requested service is available immediately it is provided to client. Client system provides an interface to user to request services from the server. Many clients can access information from server simultaneously at the same time; a client computer can execute other tasks, such as sending mails. Both client and server are considering as intelligent systems, the client-server model is completely different from stand alone systems. A client server model working on 2D (two dimensions) of computer science, one is computing and other one is communication. That is, within this model client and server communicate with each other. In this model all the devices are fixed in a standard place. The environment setup of client server model is shown in figure  {\ref 2}. Mobile computing evolves during the most recent years as a need of portable and growing networks called wireless networks. Mobile computing enlarges the usability of systems, but raises many demanding challenges issues. Mobile computing working on 3D (three dimensions) of computer science, they are computing, communication, and mobility. In mobile computing mobile agents are connecting for computing and also communicating by moving its position. This property is called mobility. Mobile computing is also called as location independent computing.\par
Mobile computing provides computing for the users are who work from numerous locations. Seamless mobility of mobile agent "connect" from any of the location, at any time based on their convenience of use (no extra setup is required like "plug and play") same computing environment is sufficient, same services, in spite of location Mobile users may be willing to give up some performance for mobility. The environment setup of mobile computing is shown in figure \hyperref[fig_2]{3}. This section provides a short overview of the different aspects of routing protocols for mobile ad hoc networks. Routing protocols are needed whenever delivered data packets need to be handed over several nodes to arrive at their destinations. Routing protocols have to find routes for packet delivery and make sure the packets are delivered to the correct destinations. The existing routing protocols such as distance vector routing and link-state routing were originally designed for static, wired networks and dynamic topology was not considered.\par
Routing protocols for ad hoc networks can be classified into different categories according to the following criteria: Pro-active, re-active or hybrid Centralized or distributed Dynamic or static\par
The first criterion will be discussed in the next paragraph. As for the second criterion, when a routing protocol is centralized, all decisions are made at a centre node, whereas in a distributed routing protocol, all nodes cooperate, usually in a symmetric way, in order to reach a routing decision. The third criterion is concerned with the nature of the information used for the routing process. A dynamic protocol may change behavior according to the network status, which can be congestion on a link or many other possible factors. A link may fail unexpectedly, or a new link may be added.\par
A dynamic routing protocol must discover these changes, automatically adjust its routing tables, and inform other routers of the changes. The process of rebuilding the routing tables based on new information is called convergence. Static protocols on the other hand do not change when the network status changes, the changes must be added manually. An example of a static protocol is flooding; in which a node always retransmits an incoming packet, unless it already sent the same packet earlier. 
\section[{b) Pro-active, re-active and hybrid protocols}]{b) Pro-active, re-active and hybrid protocols}\par
The routing protocols for ad hoc networks can be classified in three different classes: pro-active protocols, re-active protocols and the hybrid protocols. These three classes differ in a number of ways.\par
Pro-active protocols (or table-driven protocols) work in a way similar to wired networks: they try to maintain an up-to-date map of the network, by continuously evaluating known routes and attempting to discover new ones. This way, when a path to a destination is needed at a node, or a packet needs to be forwarded, the route is already known and there is no extra delay due to route discovery. On the other hand, keeping the information up-to-date this way may require a lot of bandwidth, which is sparse, and battery power, which is limited in mobile ad hoc networks and even then information may still be out-of-date. The Distance-Vector protocols fall in the pro-active class.\par
Unlike pro-active protocols, re-active protocols (on-demand protocols) only start a route discovery procedure when needed. When a route from a source to a destination is needed, some sort of global search procedure is started. This does not require the constant updates being sent through the network, as in pro-active protocols, but it does cause delays, since the routes are not available and need to be found. In some cases the desired route(s) are still in the route cache maintained by nodes. When this is the case there is no additional delay since routes do not have to be discovered. Protocols such as DSR and AODV [1] are members of the re-active protocol class.\par
Pure pro-active protocols are likely not fit for ad hoc networks where nodes move a lot, because of the high traffic overhead caused by continuously updating the network information. On the other hand, pure reactive protocols may also have their problems; extreme( D D D D D D D D )\par
Hybrid protocols combine the advantages of both pro-active and re-active routing, by locally using pro-active routing and inter-locally using re-active routing. This is partly based on the assumption that most communication in mobile ad hoc networks takes place between nodes that are close to each other, and the assumption that changes in topology are only important if they happen in the vicinity of a node. When a link fails or a node disappears on the other side of the network, it has only effect on local neighborhoods; nodes on the other side of the network are not affected. The ZRP is an example of a hybrid routing protocol.\par
Mobile ad hoc networks are deployed currently since they provide some features which are difficult or impossible to be emulated by conventional networks. MENET applications are range from the defense sector to general transportation to providing useful infrastructure during disaster recovery. Because of the significance attached to the applications of Mobile ad-Hoc networks security in ad-hoc networks is a latest research area and already substantial research is done in this field.\par
Routing plays a very important role in mobile ad-hoc networks which has been done by routing protocols and is used to route the packets depending on the path constraints. The design of network routing protocols for mobile ad-hoc networks is a challenging problem. These ad-hoc networks need efficient algorithms to determine network topology, link connectivity, and routing. A best approach is to consider routing algorithms in which network connectivity is determined in the process of establishing routes. Routing in a decentralized environment where network topology fluctuates is not a well-defined problem. The shortest path from a source to a destination in a static network is usually the optimal route this idea is not fit for mobile computing. The network should be able to adaptively alter routing paths to alleviate if any of these problems arises.\par
Most of the wireless ad-hoc networks probably prepare single source shortest path between participating nodes to transfer data. But, with shortest path some problems are occurred due to limited bandwidth. Route overhead is the one of the burning issue in shortest path routing protocols (all packets are transfer using same path, one packet is under transmission rest of the packets are in waiting stage, so the total turnaround time is increased). Hence we propose a new method of multi path dynamic routing protocols to address route overhead problem, where each packet use one of the path from multiple paths exist between participating nodes.\par
The main motivation is to identify the list problems in mobile ad-hoc networks like reducing the The primary goals of this paper are to reduce transmission delay, route overhead between participating nodes in mobile ad-hoc networks using multi path dynamic routing instead of conventional shortest path routing.\par
Wireless mobile ad-hoc networks are classified as networks where nodes are logically connected with each other. These types of networks do not have fixed topology due to the mobility property of nodes, interference, propagation and loss of path. Hence a dynamic source routing protocol is required for these networks to working properly. Data transfer using this protocol based on shorted path, all packets need to be transferred using same path. The researcher on MANET proposed many Routing algorithms to this task. The main idea of this dissertation is to study, understand, and analyze the problems with existing routing methods. In the proposed multi path dynamic routing, first identify multi paths exist between source to destination and select best four paths and then data is segmented into four parts, each part is transferred to receiver using different paths which are already selected. At receiver end received data need to be rearranged. Finally the performance proposed system is compared with existing methods and proposed method shows better performance when compared with existing methods.\par
The remaining sections of the paper are structured as follows. We begin by describing the problem statement and objectives of the paper in section 2. In section 3, we present a new architecture of proposed system. In section 4, we discuss experimental setup of our proposed system. In section 5, discuss related work. Finally, section 6 gives conclusions and direction of future work. 
\section[{II.}]{II.} 
\section[{Problem Description}]{Problem Description}\par
Current Ad-hoc routing protocols inherently trust all participants. Most Ad-hoc routing protocols are cooperative by nature and depend on neighboring nodes to route packets. This naive trust model allows malicious nodes to paralyze an Ad-hoc network by inserting erroneous routing updates, replaying old messages, changing routing updates or advertising incorrect routing information. Mobile ad-hoc network research is extended by using some factors. Factors such as power expended, variable wireless link quality, propagation path loss, fading, multi-user interference, and topological changes, become relevant issues.\par
Unlike their wired counterparts, design of software for mobile devices must consider resource limitation, battery power and display size. Consequently, new hardware and software techniques must be developed. Many Problems are exist with Ad-hoc routing protocols. The previous Researchers proposed many methods for transfer of data from one mobile agent to other. The Research dissertation studies a set of problems that are faced during mobile computing. A mobile user must be able to deal with the problems like slow even though expensive connection lines, frequent interruption of connection to failures, limited mobile host performance. Requirements for mobile agent services are stability, bandwidth or cost considerations, integration into the well-known environment, application transparency, and extendibility. Proposed method for ad-hoc networks maximize total network throughput by using all available nodes for routing and forwarding.\par
There are two major differences between their proposals and existing methods. First, we construct multiple paths for the destination network and with the help of the performance monitoring ours may provide route with better performance. Second ours can get some novel paths that are not obtained by the existing one. Ad-hoc networks maximize total network throughput by using all available nodes for routing and forwarding.\par
However a node may misbehave by agreeing to forward packets and then failing to do so, because it is overloaded, selfish, malicious or broken. Misbehaving nodes can be a significant problem. Although the average loss in throughput due to misbehaving nodes is not too high, in the worst case it is very high.\par
Researchers in mobile computing proposed many methods to transmit data from one mobile agent to other based shortest path and moreover they routes may be static routing or dynamic routing. These methods estimated the network bandwidth before transmit the data, and also select a single path to transmit data. Suppose bandwidth is greater than the data size, data is segmented into packets and packet are numbered with serial numbers and transferred to receiver. At receiver end all the packets are rearranged to restore original data. This research dissertation intended to address some of the problems and limitations of the use of single source shortest path static/dynamic routing. Problem with single source shortest is all packets are travelled using single path, route overhead, traffic, heavy load problems are raised. This method focuses on the following objectives:\par
? Focusing on the role of mobile agent and identifying list problems when a document is transfer from one mobile agent to other. Studying the solutions to these problems. ? Identification of dynamic routing between mobile agents. ? Presenting the method which is used to identify multiple paths from source mobile host to destination mobile host. ? Examining a number of available techniques that can be applied to distribute data from one mobile agent to other by solving these problems to achieve better performance.\par
III. 
\section[{Architecture}]{Architecture}\par
Sender side architecture of proposed system is shown in figure  {\ref 4}. The main idea of proposed system is to use some routes from all pair shortest path between source mobile hosts to destination host. Architecture of proposed model has following components: At the receiver end first receiver receives data from various routes and rearranges the data into an order and final data is displayed to the user. At the receiver end received data size is estimated and it is compared with actual size. If both are equal then there is no loss of information or data during transit.? Job size estimation ? Bandwidth estimation ? Load analyzer ? Job dispatcher ? Route decider\par
The experimental set of the proposed system is shown in figure  {\ref 6}, network is setup with 42 nodes (seven columns and six rows), and all these nodes are wireless nodes.\par
Figure  {\ref 6} : Experimental Setup Connections between these nodes are established dynamically, based on the necessity. Then destination, once file is selected by the mobile user, immediately it is segmented into packets based on size of the file, for instance selected file is segmented into five packets is shown in the packet window. After segmentation process mobile agent select paths, for example source node is ACT0 and destination is ACT41, then multiple paths between source to destination is depicted in figure \hyperref[fig_5]{7}. Then send packets to destination using single or multiple paths.   Existing methods of data transfer using static or dynamic routing algorithm uses a single source shortest path. Let data is divided into N packets. In order to transmit a packet using shortest path requires N units of time. To transfer N packets requires N * N units of time. Therefore total time complexity is O (N2). In our proposed scheme data is divided into packets and each packet is transmitted through a single path from four selected shortest path. Therefore in order to transmit complete data N units of time is required; the time complexity of proposed system is approximately equal to O (N). Proposed method shows better performance when compared with existing methods. 
\section[{Related Work}]{Related Work}\par
Previous works have considered single source shortest path routing approaches to improve path performance and multiplicity. For example, miro \hyperref[b5]{[9]}, rbgp \hyperref[b6]{[10]}, yamr \hyperref[b7]{[11]} and path splicing \hyperref[b8]{[12]} also allow for discovery of additional inter domain routes besides BGP. Path Splicing gives a new routing primitive using splicing bits to accomplish the inter domain routing. Although it can bring up with the flexibility of the route selection, it does not essentially add new routes. RBGP and YAMR, through pre computing a few strategically chosen failover paths, ensure that Internet domains stay connected as long as the underlying network is connected. This method is used to avoid the link failure but cannot provide the path multiplicity and flexibility. Ours can not only avoid the link failure but also can select the routes with the higher performance.\par
In \hyperref[b1]{[5,}\hyperref[b2]{6]}, the structure and components of mobile backbone based on ad hoc wireless networks are defined. A Mobile Backbone Network (MBN) consists of a backbone network (Bnet), access networks (Anets), and regular ad hoc networks. Thick solid lines connecting large solid circles represent the Bnet. Dashed ovals consisting of thin solid lines connecting small solid circles represent the Anets. The small solid circles and the thin dashed lines connecting them to each other represent the regular ad hoc networks. MBN is designed so that it involves a sufficient but not excessive number of backbone nodes, while providing high coverage, so that a high fraction of the low-power nodes can access at least Backbone Node (BN) through one hop.\par
A problem with the use of distance vector routing protocols in networks where hosts are moving, is the likelihood of forming routing loops. In order to eliminate this likelihood, Perkins and Bhagwat have newly proposed adding sequence numbers to routing updates in Destination-Sequenced Distance Vector (DSDV) protocol \hyperref[b12]{[16]}. These sequence numbers are used to match up to the age of information in a routing update, and allow each node to preferentially choose routes based on the fresh information. DSDV also uses trigger routing update to speed route convergence. In order to damp route variation and reduce congestion from large numbers of trigger updates after a route changes, each node in DSDV maintain information about the frequency with which it seems route changes and may delay some routing updates.\par
Dynamic source routing protocol is an approach to few source routing protocols used in wired r wireless networks, such as in the IEEE 802 SRT Bridge \hyperref[b13]{[17]}. Route request packet serves basically the same role in route finding as an "all paths explorer" packet. But, in wired networks, a bridge can copy an all paths explorer from one network interface onto other interfaces and that the explorer will flood the network in a logical and complete way. Some protocol includes optimizations such as caching h sender address, request id i pairs to efficiently overflow explorers through a wireless network. We can also make extensive use of caching and can successfully make use of promiscuous receive mode in the network interface to optimize dynamic route discovery.\par
The previous Researchers proposed many methods to transfer of data from one mobile agent to other. The Research dissertation studies a set of problems that are faced during mobile computing. A mobile user must be able to deal with the problems like slow even though expensive connection lines, frequent interruption of connection to failures, limited mobile host performance. Requirements for mobile agent services are stability, bandwidth or cost considerations, integration into the well-known environment, application transparency, and extendibility. Proposed method for ad-hoc networks maximize total network throughput by using all available nodes for routing and forwarding.\par
The research study reveals that, proactive (DSDV) routing protocol consumes more and more bandwidth, because of the frequent broadcasting of routing updated information. While the Reactive protocol (AODV) is somewhat better than DSDV as it doesn't maintain routing tables at nodes which results in less overhead and more bandwidth. In mobile computing many methods are used to transmit data from one mobile agent to other based shortest path and moreover they routes may be static routing or dynamic routing. These methods estimated the network bandwidth before transmit the data, and also select a single path to transmit data. All the data is transmitted using a single path only. In our proposed method data is segmented into four parts and each part is transmitted to receiver using different paths, which reduces transmission time. Proposed method shows better performance when compared with existing methods. in the proposed method only we consider file size and shortest path, in future we are planning to add \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Figure}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Figure 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-5.png}
\caption{\label{fig_3}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{45}\includegraphics[]{image-6.png}
\caption{\label{fig_4}Figure 4 :Figure 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{7}\includegraphics[]{image-7.png}
\caption{\label{fig_5}Figure 7 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{8}\includegraphics[]{image-8.png}
\caption{\label{fig_6}Figure 8 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{910}\includegraphics[]{image-9.png}
\caption{\label{fig_7}Figure 9 Figure 10 :}\end{figure}
 			\footnote{Edelays and excessive control traffic, may make them unfit for certain applications.} 		 		\backmatter  			 \par
some more parameters like cost to increase the quality of service. 			 			  				\begin{bibitemlist}{1}
\bibitem[ IEEE Journal on Selected Areas in Communications ()]{b0}\label{b0} 	 		\textit{},  	 	 		\textit{IEEE Journal on Selected Areas in Communications}  		2005. 23  (6)  p. .  	 
\bibitem[Douglas et al. ()]{b1}\label{b1} 	 		‘A high-throughput path metric for multi-hop wireless routing’.  		 			S J Douglas 		,  		 			Daniel De Couto 		,  		 			John Aguayo 		,  		 			Robert Bicket 		,  		 			Morris 		.  	 	 		\textit{Wireless Networks}  		2005. 11  (4)  p. .  	 
\bibitem[Akkaya and Younis (2005)]{b2}\label{b2} 	 		‘A survey on routing protocols for wireless sensor networks’.  		 			Kemal Akkaya 		,  		 			Mohamed Younis 		.  	 	 		\textit{Ad hoc Networks}  		May 2005. 3  (3)  p. .  	 
\bibitem[Heissenb¨uttel and Braun ()]{b7}\label{b7} 	 		\textit{BLR: Beacon-less routing algorithm for mobile ad-hoc networks},  		 			Marc Heissenb¨uttel 		,  		 			Torsten Braun 		.  		2003. Elsevier's Computer Communications Journal. p. .  	 
\bibitem[Karimseada et al. ()]{b3}\label{b3} 	 		‘Energy-efficient forwarding strategies for geographic routing in lossy wireless sensor networks’.  		 			Marco Karimseada 		,  		 			Ahmed Zuniga 		,  		 			Bhaskarkrishnamachari Helmy 		.  	 	 		\textit{Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems (SenSys'04)},  				 (the 2nd International Conference on Embedded Networked Sensor Systems (SenSys'04))  		2004. p. .  	 
\bibitem[Rao et al. ()]{b6}\label{b6} 	 		‘Geographic routing without location information’.  		 			A Rao 		,  		 			S Rathasamy 		,  		 			C Papadimitriou 		,  		 			S Shenker 		,  		 			I Stoica 		.  	 	 		\textit{Proceedings of the 9th Annual International Conference on Mobile Computing and Networking (MobiCom'03)},  				 (the 9th Annual International Conference on Mobile Computing and Networking (MobiCom'03))  		2003. p. .  	 
\bibitem[Kuhn et al. (2003)]{b9}\label{b9} 	 		‘Geometric ad-hoc routing: Of theory and practice’.  		 			Fabian Kuhn 		,  		 			Roger Wattenhofer 		,  		 			Yan Zhang 		,  		 			Aaron Zollinger 		.  	 	 		\textit{Proceedings of the 22nd ACM International Symposium on the Principles of Distributed Computing (PODC)},  				 (the 22nd ACM International Symposium on the Principles of Distributed Computing (PODC)Boston, Massachusetts, USA)  		July 2003. p. .  	 
\bibitem[Perkins (1994)]{b13}\label{b13} 	 		‘Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers’.  		 			Charles E Perkins 		,  		 			Pravinbhagwat 		.  	 	 		\textit{Proceedings of the SIGCOMM '94 Conference on Communications Architectures, Protocols and Applications},  				 (the SIGCOMM '94 Conference on Communications Architectures, Protocols and Applications)  		August 1994. p. .  	 
\bibitem[Perlman ()]{b14}\label{b14} 	 		\textit{Interconnections: Bridges and Routers},  		 			Radia Perlman 		.  		1992. Reading, Massachusetts: Addison-Wesley.  	 
\bibitem[Lin and Stojmenovic ()]{b10}\label{b10} 	 		‘Location-based localized alternate, disjoint and multi-path routing algorithms for wireless networks’.  		 			Xu Lin 		,  		 			Ivan Stojmenovic 		.  	 	 		\textit{Journal of Parallel and Distributed Computing}  		2003. 63 p. .  	 
\bibitem[Xu and Rexford (2006)]{b15}\label{b15} 	 		‘Miro: Multi-path Interdomain Routing’.  		 			W Xu 		,  		 			J Rexford 		.  	 	 		\textit{Proc. ACM SIGCOMM},  				 (ACM SIGCOMM)  		Aug. 2006.  	 
\bibitem[De Moraiscordeiro and Gossain (2003)]{b5}\label{b5} 	 		‘Multicast over wireless mobile ad hoc networks: present and future directions’.  		 			C De Moraiscordeiro 		,  		 			H Gossain 		,  		 			DP 		.  	 	 		\textit{IEEE Network}  		January/February 2003. 17  (1) .  	 
\bibitem[Wu et al. (2002)]{b12}\label{b12} 	 		‘On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks’.  		 			Jie Wu 		,  		 			Fei Dai 		,  		 			Ming Gao 		,  		 			Ivan Stojmenovic 		.  	 	 		\textit{Journal of Communications and Networks}  		March 2002. 4  (1) .  	 
\bibitem[Kwon and Fahmy (2002)]{b11}\label{b11} 	 		‘Topology-Aware Overlay Networks for Group Communication’.  		 			M Kwon 		,  		 			S Fahmy 		.  	 	 		\textit{Proc. ACM NOSSDAV'02},  				 (ACM NOSSDAV'02Miami, FL)  		May, 2002.  	 
\bibitem[Stojmenovic and Anandprakashruhil (2003)]{b4}\label{b4} 	 		‘Voronoi diagram and convex hull based geocasting and routing in wireless networks’.  		 			Ivan Stojmenovic 		,  		 			D K Anandprakashruhil 		.  	 	 		\textit{Proceedings of the 8th IEEE Symposium on Computers and Communications ISCC},  				 (the 8th IEEE Symposium on Computers and Communications ISCC)  		July 2003. p. .  	 
\bibitem[Kuhn et al. ()]{b8}\label{b8} 	 		‘Worst-case optimal and average-case efficient geometric ad-hoc routing’.  		 			Fabian Kuhn 		,  		 			Roger Wattenhofer 		,  		 			Aaron Zollinger 		.  	 	 		\textit{Proceedings of the 4th ACM International Symposium on Mobile Computing and Networking},  				 (the 4th ACM International Symposium on Mobile Computing and Networking)  		MobiHoc 2003. 2003. p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
