\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={A Survey on Fault Tolerant Multipath Routing Protocols in Wireless Sensor Networks},
 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{2015-05-15 (revised: 15 May 2015)}
\def\TheID{\makeatother }
\def\TheDate{2015-05-15}
\title{A Survey on Fault Tolerant Multipath Routing Protocols in Wireless Sensor Networks}
\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]{Ms. Balwinder Kaur  Dhir}

             \affil[1]{  Punjab Institute of Technology Kapurthala}

\renewcommand\Authands{ and }

\date{\small \em Received: 10 April 2015 Accepted: 2 May 2015 Published: 15 May 2015}

\maketitle


\begin{abstract}
        


Wireless Sensor Networks (WSNs) consists of large number of energy constrained sensor nodes that are randomly deployed. Sensor nodes have the ability to sense and send data towards the base station (BS). Sensor nodes require large amount of energy for data transmission. So while transmission, some nodes die because of energy depletion. In this case, chance of data loss increases. In order to reduce the data loss fault tolerance technique are used. To provide fault tolerance some Multipath Routing Protocol (MRP) are proposed, which can be classified in two ways i.e. alternative path routing or retransmission and concurrent routing protocol or replication. In MRP, multiple paths are used to send data from source to destination, where if one node fails during data transmission, another node can be used to transmit the same data to the destination by following other optimal path. In this paper we survey various multipath routing protocols along with their fault tolerance schemes and compare each protocol with various parameters.

\end{abstract}


\keywords{WSN, fault tolerance, multipath routing protocol, retransmission, replication}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{Introduction}]{Introduction}\par
ireless sensor networks have currently research attention due to its large area of significance that are not under the human control. It is a wireless network comprising of huge amount of static or mobile sensors. Inside a WSN, the sensors autonomously associate to sense, collect, process data and transmit those sensed data to some specific data processing centers. These characteristics along with self-organization and self-configuration capabilities of sensor nodes make WSNs very promising for applications in many different fields. WSNs are interesting from an engineer perspective, because they present serious key design challenges. Sensor nodes are battery driven and hence operate with a limited energy resource. In large and dense sensor networks it is not feasible to replace batteries when a sensor node is down. In practice, it will be necessary in many applications to provide guarantee that a network with unattended wireless sensors can remain operational without any replacements for several years. For instance, in forest and unreachable areas, such as the Antarctica or the deepest zones of the Atlantic Ocean, sensors can be easily deployed in order to form a large-Author: Department of Computer Science and Engineering Punjab Institute of Technology Kapurthala, PTU Main Campus Kapurthala (Punjab), India. e-mail: dhir.balwinder@gmail.com dense sensor network and sense seismic waves, temperature or other parameters as well. In these scenarios, the replacement of the battery of a sensor node would be highly expensive.\par
Nodes in a wireless sensor network has to be able to configure their own network topology; localize, synchronize, and calibrate themselves; coordinate internode communication; and determine other important operating parameters. They also must be able to adapt themselves to the environmental conditions and unexpected situations in order to keep the performance negotiated and have a robust network. After deployment it is common in wireless sensor networks having topological changes due to changes in position of sensor nodes, ability to reach, available energy, and device failure or energy depletion.\par
The routing protocol cannot be directly applied due to existing design challenges in WSN like energy consumption, node deployment, Quality of services (QoS) data aggregation and node mobility in the ad hoc network or cellular network. For example if we want to deployed the large number of sensor nodes in WSN, then it will not possible to build a global addressing scheme as the overhead of ID maintenance is high. We have already discussed about the sensor nodes that sensor nodes depends upon energy for its activities, thus if one node fails or link breaks due to its limited battery lifetime, then it will affect the entire network, hence a careful resource management is required. To provide fault tolerance the routing protocol should be designed. Due to fault tolerance mechanism the data loss should be reduced, and it will also increase the reliability of the network which is most important. It is essential to specify the contrast between faults, errors, and failures. Various definitions are used about these terms. From survey "A fault is any kind of imperfection that leads to an error." "An error refers to mistaken (undefined) system state. Such a state may lead to a failure". "A failure is the disclosure of an error, which occurs when the system drifts from its statement and cannot deliver its purposive functionality".\par
In this paper also focused on the metrics to enhance the reliability of WSN by using multipath routing. Here in this paper the existing technique of fault recovery also classified in to retransmission and replication. In our survey we also describe the Year ( ) G advantages of using multipath routing protocol along with their fault tolerant mechanism to increase the WSN reliability issues. The rest of the paper is organized as follows. Section II. Focus on different mechanisms to provide fault tolerance. Further, section III provides the work related to fault tolerant routing techniques. Finally section IV concludes this paper. 
\section[{II.}]{II.} 
\section[{Mechanism to Provide Fault Tolerance}]{Mechanism to Provide Fault Tolerance}\par
Fault tolerance ensures that a system must be work in the presence of fault without any interruption. Fault tolerance increases the availability, reliability and consequent dependability of the system. Here are many approaches for fault tolerance is there but the most popular approach is multipath routing. In multipath routing there are multipath between source nodes and the sink have the highest energy to consume and traffic generation. There are some additional benefits of multipath routing i.e. bandwidth aggregation and load balancing.\par
We can classify the routing protocol for WSN \hyperref[b0]{[1,}\hyperref[b1]{2]} in to groups on the basis of find the path, proactive routing where computing and maintenance of path should be done in advance and store in the routing table, reactive routing where path paths are created and demanded.. There are two mechanisms \hyperref[b5]{[6]} used to create multiple paths:? Disjoint multipath ? Braided multipath\par
In Disjoint multipath a number of additional multipaths are created which are joined to primary path by node/link disjoint and with other additional path. Thus if failure arise at any instant of time that does not affect he additional path. The additional path consumes more energy than primary path because they have longer latency. So if this multipath scheme is used in the network with K node/link disjoint routes from node to sink that can tolerate at least K-1 network failure.\par
In Braided multipath an additional path is created for each node, in primary path that doesn't include that node. This additional path are not much more expensive then the primary path, In case of latency and overhead. Here if all of the nodes on primary path fails then additional path can e used. 
\section[{Multipath Routing in WSN}]{Multipath Routing in WSN}\par
Due to the high potent of wireless links and limited capacity of a multi-hop path \hyperref[b4]{[5]} and the \hyperref[b2]{[3,}\hyperref[b8]{9]}, single-path routing approach is impossible to provide remarkable high data rate transmission in WSN. At present, the multipath routing approach is employ at high level as one of the possible solution with limited sources.\par
Multipath routing can be divided in two ways:\par
? Alternate path routing or Retransmission ? Concurrent path routing or Replication 
\section[{a) Alternate path routing or Retransmission}]{a) Alternate path routing or Retransmission}\par
Alternate path routing or Retransmission is one of the most popular mechanism, if the data packet is not transmit to sink successfully, then the source node retransmit the data packet on multiple path by using the minimum hope count and minimum energy consumption depending upon the requirement of network. In the process a source node send data packet to sink and if the data packet successfully received by the sink then the sink send the acknowledgement back to source node as reply. If sink node does not send the acknowledgement and sender does not receive the acknowledgement before time out, it means that data packet is not reached at the sink, and sender retransmit the data packet. In WSN packet loss rate is high then other networks. So the retransmission is very popular mechanism.\par
But there are some drawbacks of this method i.e. It increases the traffic on network. Delivery delay is due to acknowledgement message. Large memory space is needed to buffer the data packet until the sensor does not receive the acknowledgement. Objectives: 1. To provide fault tolerant routing. 2. To reduce the frequency of route rediscovery process. 
\section[{b) Concurrent path routing or Replication}]{b) Concurrent path routing or Replication}\par
Concurrent path routing or Replication means the redundancy. To introduce the redundancy into delivery of the data packet \hyperref[b7]{[8]} is another mechanism that s used in fault tolerance routing protocol in WSN. By this mechanism to ensure the delivery of original data packet to sink, transmit multiple copies of the original data packet at the multiple path in order to recover from the path failure this mechanism have major drawbacks, i.e. it introduce  
\section[{Related Works}]{Related Works}\par
The main idea of this paper is to study about the current state of fault tolerant routing techniques. 
\section[{a) Alternate path routing or Retransmission based schemes}]{a) Alternate path routing or Retransmission based schemes}\par
In this section, retransmission based routing protocols are described and culminate the key ideas. Directed Diffusion (DD) \hyperref[b3]{[4]} is supposed to be as one of the important routing protocol. There are many other routing protocol that that are act as directed diffusion protocol or use the same concept. The main idea of this protocol is that interest message is broadcast by sink that cyclically refresh along the network, a query is contained in this packet called information that the sink wants to request from the sensor nodes. When interest packet is received by the nodes, all nodes existing in the network catch the packet and store it to the memory then flood to their neighbor nodes to ensure that they get the packet or not. Each node in the network generates the Gradient which includes the direction in which the data will be send and the values of data rate. When a node found data then it compared with the information that it store in the cache, if it matches the node is supposed to be the source node and it cyclically broadcast a message at low rate to ensure sense the data. When the sink receive many detection events, which means there are multiple paths that are going to source, it broadcast a reinforcement message to one path which have the least delay by enhance the data rate in the interest packet.\par
Fault tolerance: if the reinforced path fails then the sink will not sense or detect any data. For rerouting the lost data it reinitiates the reinforcement message. Here to provide a fast recovery from the path failure the sink must be cyclically broadcast the reinforcement message to hurriedly found the additional path that created on the demand of this case. Since this protocol is based upon the query driven data delivery concept, so it can works for such application that are based upon environment monitoring and requiring the continuous data delivery to the sink. This protocol is not be supposed as the energy efficient protocol. Sensor nodes may also introduce the overhead by the matching data and queries.\par
Informer homed routing protocol (IHR) \hyperref[b22]{[21]} for WSN. This protocol is to prevent from the data loss, and to increase the data reliability. There are two cluster heads are choose based upon the energy called primary cluster head and the backup cluster head. The backup cluster head is used when the failure occur and have less energy than the primary cluster head. Sensor nodes send the data to the primary cluster head then primary cluster head send it to the sink. Backup cluster head receive the beacon message it means that the primary cluster head is alive. If beacon messages stops received to backup cluster head it means that primary cluster head is fail. 
\section[{Highly Resilient, Energy Efficient Multipath}]{Highly Resilient, Energy Efficient Multipath}\par
Routing Protocol (HREEMRP) \hyperref[b6]{[7]} for is based upon he directed diffusion concept. There are some multipath routing schemes that finds several moderately disjoint paths, these are not the disjoint path, alternatively they are braided multipath for maintain the multipath to keep the low cost, and to rapidly recover from the path failure. The periodic flooding avoided by this protocol. Fault tolerance: When a path failure occur, the beacon message stop received that are send by the primary cluster head to backup cluster head. Backup cluster head wait for particular time period after then it again retransmit the data packet which are interrupted due to the failure. Finally the traffic move to the backup cluster head. If the service path set up again, then the traffic back move on it. 
\section[{Year ( )}]{Year ( )}G\par
Fault tolerance: Multipath between source node and sink set up by network, one path is known as the primary b) Concurrent path routing or Replication based schemes Now a days the research provide us such protocols by which we can send the data packet over multipath to get reliability. In this section, retransmission based routing protocols are described and culminate the key ideas.   \hyperref[b20]{[20,}\hyperref[b9]{10]}. In the functioning of this protocol the sink cyclically broadcast a routing update packet in the network by this each node become to know its neighbor node and the hop count to the sink. When the source node wants to send the data, it generates a packet with dynamic packet state (DSP) fields in the header that have the network condition (local channel error, hop distance to the sink, desired reliability).Multiple copies of the data packet are created to be sent on multipath to the sink (the number of these multipath is therefore a function of the reliability) depending on the desired reliability identified by the source node. To forward the packet each intermediate node uses the information in the DSP and decides how much number of copies of the data packet is sent over the multipath. Mostly, the intermediate nodes take decision of which neighbors to forward the packet to (usually the node which is closer to the sink are chosen, otherwise random nodes are chosen). This process continues until the data packet reaches the sink.\par
N to 1 multipath routing protocol \hyperref[b10]{[11]} is proposed to converge cast the traffic at different path. The main purpose of these protocols finds multiple node disjoint path from all sensor nodes to sink simultaneously. Here it improves the data transmission reliability. N to 1 multipath routing protocol performed by a single flooding strategy in two phases called branch aware flooding and multipath extension flooding.\par
In branch aware flooding the all source nodes find the several paths to the single sink and update a route table. In addition, if an intermediate node overhears a route update message then this path will also add to routing table. In multipath extension flooding more paths are discover from source to sink. path from where the data route from source to sink and the additional path is maintained by the sending keepalive data continuously. Thus if primary path failed then nodes can recover quickly by reinforcing the other path to retransmit the data packets. In this case energy is consumed because all the paths from source to sink are created in advance and additional path maintained by sending the keep-alive data continuously. Fault Tolerance: Fault tolerance provided in the Rein Form by sending multiple copies of the same packet to the sink over randomly chosen paths. This duplication occurs at the source node or at every intermediate node in the network. Thus in this scheme a higher delivery ratio or overhead is reached. But the advantage is that if some data packet is lost by any reason then original packet can still be recovered from the other duplicated packets.\par
Fault tolerance: here the traffic can be introduced by data transmission from single path. To avoid this N to 1 discover an additional approach. By this each link between two individual nodes that belongs to different branches of spanning tree also establish an additional path. Hence the traffic split in to several segments.\par
H-SPREAD multipath routing protocol \hyperref[b11]{[12]} is a combination of N to 1 multipath routing protocol and hybrid data transmission technique. H-SPREAD improves the reliability and secures the data transmission in WSN. It uses the threshold secret sharing scheme, and path discovery. H-SPREAD only improves the reliability and secure data delivery but it cannot secure individual nodes. \hyperref[b12]{[13]} is based upon cross layer design between Mac layer and network to provide timeliness and reliability. From Here the reliability demand also be achieved. The delay requirements are satisfied through various applications. MMSPEED provides the different speed layer over a single network. The data packets are assigned to different speed layer and placed in the suitable queue by the speed category. The FCFS policy is applied here. This technique also ensures that data serviced according to their priority i.e. high priority packet are serviced before low priority packets. Because it is cross layer design between Mac layer and network so contention based Mac protocol utilize the CSMA/CA mechanism \hyperref[b18]{[18,}\hyperref[b19]{19]} to perform channel access, that employee the local priority data transmission at network layer not at the link layer. 
\section[{Multipath multispeed protocol (MMSPEED)}]{Multipath multispeed protocol (MMSPEED)}\par
Geographic progress when we send data packet through node B  
\section[{Multi}]{Multi}\par
constrained QoS multipath routing(MCMP) \hyperref[b13]{[14]} is mainly designed to provide QoS in terms of reliability and delay. MCMP develop according to linear programming approach which defined end to end soft QoS problem by deterministic approximation. Using following equation MCMP maps the delay and reliability along different path to the sink node. (1)? ? ? = ?? ? ? ?\textbf{(2)}\par
Here L i d and ?????? represent delay and reliability requirements at node i. ?? ?? is delay by packet at node i.\par
?? ?? is fraction of reliability requirements assigned to path passing by node i. ? ?? is hop count from node I to sink. MCMP utilize the two strategies i.e. delay and reliability. The delay requirement of the intended application fulfilled when all intermediate node used equation 1. To choose the neighbor node during route discovery. To achieve reliability each node selects one or set of neighbor nodes which provide reliability toward the sink. Therefore, at route discovery each source node discovered the set of partially disjoint path that satisfy the delay and reliability demands.  Energy constrained multipath routing protocol (ECMP) \hyperref[b15]{[15]} is the enhanced version of MCMP. It provides energy efficient communication. As MCMP it also satisfies the QOS in terms of delay and reliability requirements of intended application.  Fault tolerance: It clearly seen that node A have two neighbor node B and node E and distance between node A and node B is shorter then node A to node E \hyperref[b16]{[16]}. So energy consumed by data transmission from link A to B is lower than link A to E. so node B is selected as the intermediate nose to send the data. In MCMP, node randomly chooses their next-hop neighbor node without checking its energy consumption. But in the ECMP it refines the set of next hop nodes, and chooses that node which considers the energy efficiency of the link toward the neighbor node.\par
IV. 
\section[{Conclusion}]{Conclusion}\par
There are various routing protocols that have been proposed in the literature to support fault tolerance in WSNs. This paper focuses on the various multipath routing protocols, in which the technique of the protocol is described along with their fault tolerant mechanisms. Table  {\ref I} and II are the summery tables which are drawn on the basis of some important parameters like reliability mechanism, route maintenance, path chooser and performance parameter.\begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Figure 1 :}\end{figure}
      \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.85\textwidth}}
Year\\
Volume XV Issue III Version I\\
( ) G\\
Global Journal of C omp uter S cience and T echnology\end{longtable} \par
 
\caption{\label{tab_0}Table 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_1}Table 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3} \par 
\begin{longtable}{P{0.85\textwidth}}
Reliable Information Forwarding (ReInForm)\\
using Multiple Paths in Sensor Networks\end{longtable} \par
 
\caption{\label{tab_4}Table 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.85\textwidth}}
Fault tolerance:\\
Fault tolerance: As mentioned above MMSPEED provide\\
different QoS guarantee in two domains by combine the\\
geographic forwarding technique with a multipath\\
routing approach. The results show that it provide us the\\
successful data transmission over low power wireless\\
link that highly depend upon the interference power of\\
receiver distance but it cannot support long life\\
application because it required extra energy for data\\
transmission.\end{longtable} \par
 
\caption{\label{tab_5}}\end{figure}
 			\footnote{© 2015 Global Journals Inc. (US) 1} 			\footnote{© 2015 Global Journals Inc. (US)} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[ Wireless Sensor Networks. IEEE Trans. Veh Tech ()]{b14}\label{b14} 	 		\textit{},  	 	 		\textit{Wireless Sensor Networks. IEEE Trans. Veh Tech}  		2006. 55 p. .  	 
\bibitem[Dezfouli et al. (2011)]{b19}\label{b19} 	 		‘A Medium Access Control Protocolwith Adaptive Parent Selection Mechanism for Large-Scale Sensor Networks’.  		 			B Dezfouli 		,  		 			M Radi 		,  		 			M A Nematbakhsh 		,  		 			S A Razak 		.  	 	 		\textit{Proceedings ofthe 2011 IEEE Workshops of International Conference on Advanced Information Networking andApplications (WAINA '11)},  				 (the 2011 IEEE Workshops of International Conference on Advanced Information Networking andApplications (WAINA '11)Singapore)  		March 2011. p. .  	 
\bibitem[Li and Cassandras (2005)]{b16}\label{b16} 	 		‘A Minimum-Power Wireless Sensor Network Self-Deployment Scheme’.  		 			W Li 		,  		 			C G Cassandras 		.  	 	 		\textit{Proceedings of IEEE Wireless Communications and Networking Conference},  				 (IEEE Wireless Communications and Networking ConferenceNew Orleans, LA,USA)  		March 2005. p. .  	 
\bibitem[Akkaya and Younis ()]{b1}\label{b1} 	 		‘A survey on routing protocols for wireless Sensor network’.  		 			K Akkaya 		,  		 			M Younis 		.  	 	 		\textit{Network Journal}  		2005. Elsevier Ad Hoc. 3  (3)  p. .  	 
\bibitem[Dezfouli and Radi ()]{b18}\label{b18} 	 		‘Abd Razak, S. A Cross-Layer Approach for Minimizing Interference andLatency of Medium Access in Wireless Sensor Networks’.  		 			B Dezfouli 		,  		 			M Radi 		.  	 	 		\textit{Int. J. Comput. Netw. Commun}  		2010. 2 p. .  	 
\bibitem[Lou (2005)]{b10}\label{b10} 	 		‘An Efficient N-to-1 Multipath Routing Protocol in Wireless Sensor Networks’.  		 			W Lou 		.  	 	 		\textit{InProceedings of the 2nd IEEE International Conference on Mobile Ad-hoc and Sensor System(MASS '05)},  				 (Washington, DC, USA, 7-10)  		November 2005. p. .  	 
\bibitem[Conf. on LocalComputer Networks (2003)]{b21}\label{b21} 	 		\textit{Conf. on LocalComputer Networks},  				 (Bonn, Germany)  		Oct. 2003. p. .  	 
\bibitem[Intanagonwiwat et al. ()]{b3}\label{b3} 	 		‘DirectedDiffusion: A Scalable and Robust Communication Paradigm forSensor Networks’.  		 			C Intanagonwiwat 		,  		 			R Govindan 		,  		 			D Estrin 		.  	 	 		\textit{ACM Intl. Conf. on Mobile Computing andNetworking}  		2000. p. .  	 
\bibitem[Hoang and Son (2005)]{b5}\label{b5} 	 		‘disjoint and braided MultipathRouting for Wireless Sensor Networks’.  		 			N Hoang 		,  		 			V Son 		.  	 	 		\textit{HCM city},  				 (Vietnam)  		Oct. 11-12, 2005.  	 
\bibitem[Bagula and Mazandu (2008)]{b15}\label{b15} 	 		‘Energy Constrained Multipath Routing in Wireless Sensor Networks’.  		 			A Bagula 		,  		 			K Mazandu 		.  	 	 		\textit{InProceeding of the 5th International Conference on Ubiquitous Intelligence and Computing},  				 (Oslo,Norway)  		June 2008. p. .  	 
\bibitem[Son et al.]{b4}\label{b4} 	 		‘Experimental Study of Concurrent Transmission in Wireless Sensor Networks’.  		 			D Son 		,  		 			B Krishnamachari 		,  		 			J Heidemann 		.  	 	 		\textit{Proceedings of the 4th International Conference on Embedded Networked Sensor Systems (SenSys '06)},  				 (the 4th International Conference on Embedded Networked Sensor Systems (SenSys '06)Boulder, CO, USA)  		p. 31.  	 
\bibitem[Ganesan et al. (2001)]{b6}\label{b6} 	 		‘Highlyresilient,energy-efficient multipath routing in wireless sensornetworks’.  		 			D Ganesan 		,  		 			R Govindan 		,  		 			S Shenker 		,  		 			D Estrin 		.  	 	 		\textit{Proc. of ACM MobiHoc'01},  				 (of ACM MobiHoc'01Long Beach, CA,USA)  		Oct. 2001.  	 
\bibitem[Qiu et al. ()]{b22}\label{b22} 	 		‘Informer homed routing fault tolerance mechanism for wireless sensor networks’.  		 			Meikang Qiu 		,  		 			Zhong Ming 		,  		 			Jiayin Li 		,  		 			Jianning Liu 		,  		 			Gang Quan 		,  		 			Yongxin Zhu 		.  	 	 		\textit{ElsevierJournal of Systems Architecture}  		2013. 59 p. .  	 
\bibitem[Lou et al.]{b11}\label{b11} 	 		 			W Lou 		,  		 			Y Kwon 		,  		 			H-Spread 		.  		\textit{Hybrid Multipath Scheme for Secure and Reliable DataCollection},  				 	 
\bibitem[Huang and Fang ()]{b13}\label{b13} 	 		‘Multiconstrained QoS Multipath Routing in Wireless Sensor Networks’.  		 			X Huang 		,  		 			Y Fang 		.  	 	 		\textit{J.Wirel. Netw}  		2007. 14 p. .  	 
\bibitem[Felemban et al. ()]{b12}\label{b12} 	 		‘Multipath Multi-SPEED Protocol for QoSGuarantee of Reliability and Timeliness in Wireless Sensor Networks’.  		 			E Felemban 		,  		 			C G Lee 		,  		 			E Ekici 		,  		 			Mmspeed 		.  	 	 		\textit{IEEE Trans. MobileComput}  		2006. 5 p. .  	 
\bibitem[Deb et al. (2003)]{b9}\label{b9} 	 		‘ReInForM: Reliable Information Forwarding Using MultiplePaths in Sensor Networks’.  		 			B Deb 		,  		 			S Bhatnagar 		,  		 			B Nath 		.  	 	 		\textit{Proceedings of the 28th Annual IEEE International Conference onLocal Computer Networks (LCN'03)},  				 (the 28th Annual IEEE International Conference onLocal Computer Networks (LCN'03)Bonn, Germany)  		20-24 October 2003. p. .  	 
\bibitem[Deb et al.]{b20}\label{b20} 	 		‘ReInForm: ReliableInformation Forwarding Using Multiple Paths in SensorNetworks’.  		 			B Deb 		,  		 			S Bhatnagar 		,  		 			B Nath 		.  	 	 		\textit{Proceed of the 28 th IEEE},  				 (eed of the 28 th IEEE)  		 	 
\bibitem[Kim et al. (2004)]{b7}\label{b7} 	 		‘Reliable Transfer onWireless Sensor Networks’.  		 			S Kim 		,  		 			R Fonseca 		,  		 			D Culler 		.  	 	 		\textit{The First IEEE InternationalConference on Sensor and Ad hoc Communications andNetworks},  				Oct. 2004. p. .  	 
\bibitem[Karaki and Kamal ()]{b0}\label{b0} 	 		\textit{Routing techniques in wireless sensornetworks: A survey},  		 			J N Karaki 		,  		 			A E Kamal 		.  		2004. Egypt: IEEE Wireless Communications. 11 p. .  	 
\bibitem[Tian et al. (2003)]{b17}\label{b17} 	 		‘SPEED: A Stateless Protocol forReal-Time Communication in Sensor Networks’.  		 			H Tian 		,  		 			J A Stankovic 		,  		 			L Chenyang 		,  		 			T Abdelzaher 		.  	 	 		\textit{Proceedings of the 23rd InternationalConference on Distributed Computing Systems},  				 (the 23rd InternationalConference on Distributed Computing SystemsProvidence, RI, USA)  		19-22 May 2003. p. .  	 
\bibitem[Woo et al. (2003)]{b8}\label{b8} 	 		‘Taming the Underlying Challenges of Reliable Multihop Routing in Sensor Networks’.  		 			A Woo 		,  		 			T Tong 		,  		 			D Culler 		.  	 	 		\textit{Proceedings of the 1st International Conference on Embedded Networked Sensor Systems},  				 (the 1st International Conference on Embedded Networked Sensor SystemsLos Angeles, CA, USA)  		November 2003. p. .  	 
\bibitem[Couto et al. ()]{b2}\label{b2} 	 		‘Throughput Path Metric forMulti-Hop Wireless Routing’.  		 			D S J D Couto 		,  		 			D Aguayo 		,  		 			J Bicket 		,  		 			R Morris 		,  		 			High 		.  	 	 		\textit{Wirel. Netw}  		2005. 11 p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
