\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={Energy Efficient Cluster based Multipath Routing 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{2016-01-15 (revised: 15 January 2016)}
\def\TheID{\makeatother }
\def\TheDate{2016-01-15}
\title{Energy Efficient Cluster based Multipath Routing 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]{Shruti  Karva}

             \author[2]{Naveen  Choudhary}

             \affil[1]{  College of Technology and Engineering, Udaipur}

\renewcommand\Authands{ and }

\date{\small \em Received: 8 December 2015 Accepted: 2 January 2016 Published: 15 January 2016}

\maketitle


\begin{abstract}
        


Wireless sensor network can be defined as a network of densely deployed sensor nodes. These sensor nodes have limited energy and have low processing and storage capabilities. Due to this, we require energy efficient routing protocols so that much of the energy of the nodes is not wasted in routing of data packets.In this paper, we present and energy efficient routing scheme. This routing protocol is a combination of cluster-based routing and multipath routing. We arrange all the sensor nodes in the network in the form of small clusters. Each of these clusters has a cluster head. Nodes which lie within a cluster send its data to its respective cluster head. The transfer of data from nodes to cluster head is through direct communication. All the cluster heads transfer their data to the sink or base station. This transfer of data is through multipath routing.

\end{abstract}


\keywords{wireless sensor networks; cluster based routing; multipath routing; energy efficient.}

\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[{I. INTRODUCTION}]{I. INTRODUCTION}\par
he recent technological advances in wireless communication, electro-mechanical systems and digital electronics have led to the development of small, low power and low cost sensor nodes which communicate within short range of distances. Sensor nodes are active nodes which perform the sensing task to sense their environment. These nodes then communicate the sensed data among each other or directly to the sink or base station. A sensor network is described as a large network of such sensor nodes which are densely deployed either inside a phenomenon or very close to it \hyperref[b0]{[1]}. Wireless sensor networks differ from other wireless networks in numerous ways. Sensor nodes within a sensor network are highly constrained in terms of energy, processing and storage capabilities. The data flow in sensor networks is from various sensor nodes to a single base station called sink. Since, there is large number of sensor nodes; the data collected might be redundant. Due to this, the traditional routing protocols cannot be used for wireless sensor networks \hyperref[b1]{[2]}.\par
The routing techniques in wireless sensor networks can be classified on the basis of network structure and protocol operation. On the basis of network structure, we have flat, hierarchical and location based routing. Routing on the basis of protocol operation can be classified as multipath, query based, QOS based, negotiation based and coherent based. In order to develop an energy efficient routing algorithm, we combine the advantages of multipath routing and hierarchical cluster based routing.\par
Wireless sensor network consists of large number of sensor nodes. Applications that require scalability and efficient data aggregation can make use of clustering. In clustering, the whole sensor network is divided into small clusters where each cluster is headed by a cluster head. The major role in sensor node clustering is to select a set of cluster heads among the nodes in the network, and group the rest of the nodes with these heads.\par
Multipath routing protocol makes use of multiple paths for routing the data rather than using a single path. This helps in load sharing and load balancing. By using multipath routing, we can increase the reliability of the network but at the same time the overhead of maintaining alternate paths is increased. 
\section[{II. RELATED WORK}]{II. RELATED WORK}\par
Yahya and Ben-Othman \hyperref[b2]{[3]} proposed a multipath routing protocol called REER (Robust and Energy Efficient Routing). This energy efficient multipath routing protocol makes use of residual energy, buffer space and signal to noise ratio to find out the next hop. In this way, the best preferred path and alternate path is calculated. In the first version(REER-I) Data is transmitted over a single path until the path cost falls below some threshold.\par
Younis and Fahmy \hyperref[b3]{[4]} gave a model in which each sensor node can act either as a source or a server (cluster head).The major challenge is to find appropriate servers to satisfy the system goals. In this paper, the selection of cluster head from all the nodes is done probabilistically based on the residual energy of the nodes. The remaining nodes join the clusters such that the communication cost is minimized.\par
LEACH (Low Energy Adaptive Clustering Hierarchy) \hyperref[b1]{[2]}  \hyperref[b6]{[7]} was the first sub-cluster-style routing protocols in WSN. LEACH is an energy efficient algorithm because it uses data compression techniques and subcluster dynamic routing technology. In this, the cluster heads are chosen randomly and therefore the network load is balanced and also rapid death of cluster heads is prevented.\par
Khedoand Subramanian \hyperref[b4]{[5]} proposed the MiSense hierarchical cluster based routing algorithm (MiCRA) to extend the lifetime of sensor networks and to maintain a balanced energy consumption of nodes. MiCRA is an extension of the HEED algorithm with two levels of cluster heads. In this, cluster heads are selected randomly based on their residual energy and nodes join clusters such that communication cost is minimized.\par
Multihop-LEACH \hyperref[b8]{[8]} is a cluster based routing algorithm in which self-elected cluster heads collect data from all the sensor nodes in their cluster, aggregate the collected data by data fusion methods and transmit the data through an optimal path between the cluster head (CH) and the base station (BS) through other intermediate CHs and use these CHs as a relay station to transmit data through them.\par
W. Lou \hyperref[b5]{[6]} proposed an N-to-1 multipath routing protocol that finds different node-disjoint paths between a sink and a source node. Nodes are arranged in a spanning tree structure with the sink as the root. The protocol finds multipaths by traversing the tree. Multipaths are used to distribute the traffic in order to improve the reliability and security of the data transmission. 
\section[{III. PROPOSED METHOD FOR ENERGY EFFICIENT ROUTING IN WIRELESS SENSOR NETWORKS}]{III. PROPOSED METHOD FOR ENERGY EFFICIENT ROUTING IN WIRELESS SENSOR NETWORKS}\par
Our proposed routing algorithm is a combination of both cluster based routing and multipath routing. We combine the advantages of hierarchical cluster based routing and multipath routing in order to get a reliable, energy efficient routing algorithm. We modify LEACH (Low Energy Adaptive Clustering Hierarchy) routing protocol by introducing multiple hops for inter cluster communication. The routing protocol used for this inter cluster communication is based on REER (Robust and Energy Efficient Multipath Routing), an energy efficient multipath routing protocol.\par
In this paper, we first explain LEACH and REER routing protocols and then give our proposed method of energy efficient routing in wireless sensor networks. 
\section[{a) LEACH (Low Energy Adaptive Clustering Hierarchy)}]{a) LEACH (Low Energy Adaptive Clustering Hierarchy)}\par
LEACH \hyperref[b6]{[7]} is one of the first hierarchical routing protocols for wireless sensor networks. The major aim of this protocol is to increase the lifetime of the network. In this protocol, the whole network is divided into small clusters and each of these clusters has a cluster head. The non cluster-head nodes are known as the member nodes of that cluster. Only the cluster heads can communicate directly with the sink. The member nodes send their data to their respective cluster heads which then send it to the sink.\par
The cluster head is responsible of performing all the important functions like collecting the data from its member nodes, aggregating the data and sending the aggregated data to the sink. Due to these additional functions, the cluster head dissipates more energy as compared to rest of the nodes. If the same node is used as cluster head, it will drain all its energy and die quickly. Therefore, LEACH introduces randomized rotation of cluster heads to save the battery of individual node.\par
The whole of LEACH operation is broken down into a number of rounds. Each of these rounds has 2 phases: setup phase and steady state phase. The setup phase is meant for the organization of clusters and in the steady state phase, data transfer to the base station takes place.\par
The working of setup phase is briefly described as below.\par
Each node in the network generates a random number between 0 and 1. The value of generated random number is compared to a threshold value T(n). If the number is less than T(n), that node is selected as cluster head. The value of threshold T(n) is calculated as follows:??(??) = ? ?? 1 ? ?? * (?? ?????? 1 ?? 0 ) ???? ?? ? ?? ?????????????????\par
Where, n is the node id in the current wireless sensor network, p is the predefined percentage of cluster heads, r is the current round number and G is the set of nodes which have not been selected as cluster heads since the last 1/P rounds. By using this function, there is a randomized rotation of cluster heads and so the same node does not continually drain its energy.\par
After the cluster heads have been determined, all the cluster heads send a broadcast message in the network to announce themselves. Each normal node decides on which cluster to join on the basis of the received signal strength. It then sends a request message to the corresponding cluster head. After receiving the request messages from the nodes, the cluster head confirms them as members of that particular cluster, adds them in the routing table and allocates TDMA table of slots for the cluster members telling each member when it can transmit data.\par
After the selection of cluster heads and clustering of member nodes, the steady state phase starts. In this phase, transfer of data takes place. All the member nodes send their data to their respective cluster heads by single hop communication during the allocated slot according to the TDMA table. After receiving the data from each member node, the cluster head fuses it into a single signal and transmits it to the base station. After the completion of data transfer, the entire network comes into the next round. 
\section[{b) REER(Robust and Energy Efficient Multipath Routing)}]{b) REER(Robust and Energy Efficient Multipath Routing)}\par
Bashir Yahya and Jalel Ben-Othman \hyperref[b2]{[3]} have proposed a robust and energy efficient multipath routing protocol (REER).REER calculates multiple paths for communication between source and destination. These paths are calculated on the basis of residual energy, buffer space and interference (signal to noise ratio).After the discovery of multiple paths, the data is transferred through the best preferred path. When the cost of the best preferred path falls below some threshold, next alternative path is used.\par
A function called link cost function is used to calculate the next hop in the path discovery phase. The link cost function depends on the residual energy of the node, available buffer space and signal to noise ratio. Let N x be the set of neighbors of the node x. We can get the next hop by the given formula Next hop = max y?Nx \{ ?E resd , y + ? B buffer,y + ?I interference,xy \} Where, E resd, y is the current residual energy of node y, where y?N x , B buffer, y is the available buffer size of node y, andI interference, xy is the SNR for the link between nodes x and y.\par
The total cost of the path is calculated from the individual link costs. The total cost C total for the path P which consists of a set of K nodes can be given as the the sum of the individual link costs l (xy)i , i? K along the path. This means:?? ?????????? ,?? = ? ?? (???? ) ?? ???1 ??=1\par
The whole operation of REER is explained as follow. The first phase is the initialization phase in which each sensor node broadcasts a HELLO message. The purpose of this HELLO message is to get information about the neighbors. During this phase, each sensor node maintains and updates its neighboring table. After this, every sensor node has all the information about its neighboring nodes. With this information, they calculate the link cost using the link cost function. Now, the sink begins to calculate its preferred next hop and sends a route request message to the most preferred next hop. The same procedure continues from hop to hop until the source node is reached. The sink sends an alternate path route request to its next most preferred path for finding the alternate path.\par
The multiple alternate paths are kept alive by flooding KEEPALIVE messages through those paths. The flooding of these messages is done by the source node periodically.\par
After the paths and multipaths have been discovered, transfer of data takes place. Upon receiving a query packet, the source nodes begin collecting all the relevant data and send it to the sink via the best preferred path. Each node consults its neighboring table and finds out the ID of the next hop, and then forwards the data to its next hop. This process continues until the data reaches the sink node. Transmission of data continues over the primary path until a certain threshold is reached, then the next best alternative path is being used, and so on. 
\section[{c) Proposed method}]{c) Proposed method}\par
After the brief overview of the LEACH and REER routing protocols, we give our proposed method of energy efficient routing. LEACH is a very efficient clustering protocol with randomized rotation of cluster heads. But since the communication from cluster head to sink is single hop, it is a very high energy transmission. Energy consumption of the inter-cluster is much more than the intra-cluster. Therefore, it is obviously important how to set the reasonable intercluster communication mechanism to decrease cluster heads' energy consumption \hyperref[b9]{[9]}.This can be rectified by introducing multiple hops for cluster head to sink communication since the smaller the distance to transmit the lower the consumption is \hyperref[b10]{[10]}. This means, that each cluster head will send its data to the sink by sending it to the intermediate cluster heads. Now, since the cluster head to sink communication is multihop, we need some routing scheme. We introduce a routing similar to REER for this multihop communication between cluster head and sink. 
\section[{The whole algorithm is divided into a number of phases. These phases are described as follows:}]{The whole algorithm is divided into a number of phases. These phases are described as follows:}\par
Cluster Formation phase: In this phase, clustering of the network takes place. Clustering is usually used to speed up route discovery by structuring the overall network nodes hierarchically \hyperref[b11]{[11]}. The procedure for the selection of cluster heads and cluster formation is similar to that of LEACH. Each sensor node in the network generates a random number to decide whether it will become a cluster head or not. The random number generated by the node is compared to the threshold T(n) and if the value is less than T(n), it is selected as the cluster head. This threshold value is calculated on the basis of percentage of cluster heads to be elected and the number of times the node has been elected as a cluster head.??(??) = ? ?? 1 ? ?? * (?? ?????? 1 ?? 0 ) ???? ?? ? ?? ?????????????????\par
In this way, each node gets a chance to be the cluster head. After the selection process, each node that has been elected as cluster head broadcast an advertisement message. When the nodes receive the advertisement message, they decide on which cluster to join on the basis of received signal strength from the cluster head. These nodes inform the cluster head that they will join the cluster by sending a message to that cluster head. 
\section[{Multipath inter cluster communication:}]{Multipath inter cluster communication:}\par
In the LEACH protocol, the cluster heads send their data directly to the sink irrespective of the energy being utilized for this transmission. In order to minimize this energy usage, we introduce multiple hops between cluster head and sink. The cluster heads send their data to the sink via other cluster heads. Now, a HELLO message is broadcasted by the cluster heads to other cluster heads and the sink. In this way, all the cluster heads have all the necessary information about the other cluster heads in the network. Each head maintains a neighboring table. The base station or the sink will now calculate the preferred next hop using the link cost function as proposed by REER. It sends a RREQ message to the calculated next hop. The preferred next hop again computes its next hop and sends the RREQ message. This continues until the source node is reached. The base station then sends the alternate path RREQ. The primary and alternate paths are node disjoint. Due to this, in case of failure of a path, the alternate path will not be affected. Route maintenance: Now, for keeping the multiple paths alive, a KEEPALIVE message is flooded through the alternate paths. Through this, all the paths are maintained Data transferring phase: After the grouping of nodes and discovery of multiple paths, transfer of data takes place. We assume that each node has data to send. The member nodes send their data to their cluster head. This is a single hop communication. Since the nodes within the cluster are within small transmission range with the cluster head, therefore, energy used is low. Also, due to single hop communication, the data delivery ratio is high. Transmission of data from the cluster head to the base station takes place through the discovered multipaths. The data is transferred through the primary path. In case of node failure, i.e. when the data packet cannot be forwarded to the next hop in the current path, the current link is considered to be disconnected. So, an error message is sent to the source node. When the source node receives this error message, it removes the current path from its routing table and selects the next preferred path from its routing table. After this, the transmission process is resumed. The use of alternate paths makes the communication more reliable. Node failure does not affect the reliability of the network.\par
After a single round is completed, the cluster reconstruction takes place. New cluster heads are elected and again the whole process continues. 
\section[{IV. SIMULATION AND RESULTS}]{IV. SIMULATION AND RESULTS}\par
We simulate and analyze LEACH \hyperref[b6]{[7]}, REER \hyperref[b2]{[3]} and our proposed method on NS2 [12] simulator. We evaluate the results on the basis of lifetime of the network and average delivery ratio. Our simulation environment consists of a 100m x 100m network consisting of 200 randomly deployed nodes. All the nodes are assumed to have same initial energy. The simulation runs for 100secs.  
\section[{a) Energy Efficiency}]{a) Energy Efficiency}\par
We evaluate the energy efficiency with the lifetime of the network. Fig. \hyperref[fig_0]{1} shows a graph between the number of dead nodes and the simulation time. The graph clearly shows that the lifetime of proposed algorithm is better than LEACH and REER. This is due to the energy aware clustering used in the proposed algorithm. We use multihop inter cluster communication, thereby avoiding high energy transmission. Also the multipath routing used, considers the residual energy of the nodes while selecting their next hop. Due to this, a single node does not continually drain its energy, thereby increasing the lifetime of the network.  
\section[{) Average delivery ratio}]{) Average delivery ratio}\par
It is the ratio of number of packets successfully received to the number of packets sent. Fig. \hyperref[fig_1]{2} shows the graph between the average delivery ratio of nodes and time. The average delivery ratio of LEACH is best among all the three routings because LEACH is a single hop routing algorithm. The data does not need to travel via intermediate nodes. The average delivery ratio of REER is the lowest. Our proposed algorithm lies between LEACH and REER since it has fewer hops as compared to REER.  
\section[{CONCLUSION AND FUTURE WORK}]{CONCLUSION AND FUTURE WORK}\par
We have successfully implemented our proposed routing algorithm. In our protocol, cluster formation is same as in LEACH. Nodes within a cluster transfer data to the cluster head through single hop. For the transfer of data from cluster heads to the base station, we introduce multihop communication. The path used for this multihop data transfer is decided by using the link cost function. The link cost function uses the residual energy, buffer space and signal to noise ratio to determine the next hop.\par
We find that the proposed routing is more energy efficient as compared to LEACH and REER. This is because the proposed routing uses the benefits of both multipath and cluster based routing. Our algorithm is more reliable and has a higher average delivery ratio than LEACH. This is due to the use of multipaths. In case of failure of a single path, alternate path is used.\par
As our future work, we will analyze the protocol more deeply by evaluating other performance metrics such as control overhead and average delay. We will also work on sensor networks with mobile nodes.\begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Figure 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.571388888888889\textwidth}P{0.2786111111111111\textwidth}}
Parameters\tabcellsep Value\\
No. of nodes\tabcellsep 200\\
Network field\tabcellsep 100m x 100m\\
MAC layer\tabcellsep IEEE802.11\\
Percentage of cluster heads\tabcellsep 20\\
Initial Energy\tabcellsep 10joules\\
Simulation time\tabcellsep 1000 seconds\\
Base station position\tabcellsep (25,100)\end{longtable} \par
 
\caption{\label{tab_0}Table 1 :}\end{figure}
 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Lou (2005)]{b5}\label{b5} 	 		‘An efficient N-to-1 mutlipath routing protocol in wireless sensor networks’.  		 			W Lou 		.  	 	 		\textit{Proceedings of IEEE international Conference on Mobile Ad-hoc and Sensor Systems (MASS)},  				 (IEEE international Conference on Mobile Ad-hoc and Sensor Systems (MASS)Washington, DC)  		November 2005.  	 
\bibitem[Annual Hawaii International Conference on ()]{b7}\label{b7} 	 		\textit{Annual Hawaii International Conference on},  				2000. IEEE. p. 10.  	 
\bibitem[Heinzelman et al. ()]{b6}\label{b6} 	 		‘Energyefficient communication protocol for wireless microsensor networks’.  		 			W R Heinzelman 		,  		 			A Chandrakasan 		,  		 			H Balakrishnan 		.  	 	 		\textit{Proceedings of the 33rd},  				 (the 33rd)  		2000.  	 	 (Proc. System Sciences) 
\bibitem[Younis ()]{b3}\label{b3} 	 		‘HEED: A hybrid, Energyefficient, Distributed Clustering Approach for Ad-hoc Networks’.  		 			Fahmy Younis 		.  	 	 		\textit{IEEE Transactions on Mobile Computing}  		2004. 3 p. .  	 
\bibitem[Niu et al. ()]{b11}\label{b11} 	 		‘Hybrid Cluster Routing: An Efficient Routing Protocol for Mobile Ad Hoc Networks’.  		 			Xiaoguang Niu 		,  		 			Zhihua Tao 		,  		 			Gongyi Wu 		,  		 			Changcheng Huang 		,  		 			Li Cui 		.  	 	 		\textit{IEEE International Conference},  				2006. 8 p. .  	 
\bibitem[Gu et al. ()]{b9}\label{b9} 	 		‘Maximum Lifetime Routing Strategies for Wireless Sensor Networks in Coal Mine’.  		 			X Gu 		,  		 			Y Jin 		,  		 			Y Sun 		,  		 			J Yan 		.  	 	 		\textit{IEEE 2nd International Conference on Computer Engineering and Technology},  				2010.  	 
\bibitem[Brandao et al. ()]{b10}\label{b10} 	 		‘MH-LEACH: ADistributedAlgorithmforMulti-HopCo mmunication inWirelessSensorNetworks’.  		 			H Brandao 		,  		 			A Rego 		,  		 			A Cardoso 		,  		 			J Celestino 		.  	 	 		\textit{ICN: The Thirteenth International Conference on Networks},  				2014.  	 
\bibitem[Kavi et al. ()]{b4}\label{b4} 	 		\textit{MiSense Hierarchical Cluster-Based Routing Algorithm Academy of Science, Engineering and Technology},  		 			K Kavi 		,  		 			R K Khedo 		,  		 			Subramanian 		.  		2009.  	 
\bibitem[Biradar et al. (2011)]{b8}\label{b8} 	 		‘Multi -hoprouting in self-organizing wireless sensor networks’.  		 			R V Biradar 		,  		 			D Sawant 		,  		 			D Mudholkar 		.  	 	 		\textit{IJCSI International Journal of Computer Science}  		January 2011. 8  (1)  p. .  	 
\bibitem[Yahya and Ben-Othman ()]{b2}\label{b2} 	 		\textit{REER: Robust and Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks},  		 			Bashir Yahya 		,  		 			Jalel Ben-Othman 		.  		2009.  	 	 (proceedings) 
\bibitem[Al-Karaki and Kamal (2004)]{b1}\label{b1} 	 		‘Routing techniques in wireless sensor networks: a survey’.  		 			J N Al-Karaki 		,  		 			A E Kamal 		.  	 	 		\textit{IEEE Wireless Communications}  		Dec. 2004. 11  (6)  p. .  	 
\bibitem[Wireless sensor networks: a survey Published by]{b0}\label{b0} 	 		\textit{Wireless sensor networks: a survey Published by},  		Elsevier Science B.V.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
