\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={Secure and Economical Cost Aware Routing Protocol for 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{2017-01-15 (revised: 15 January 2017)}
\def\TheID{\makeatother }
\def\TheDate{2017-01-15}
\title{Secure and Economical Cost Aware Routing Protocol for 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]{Machha Narender  }

             \author[2]{Dr  .R.P.Singh}

             \affil[1]{  Sri Satya Sai University of Technology and Medical Sciences}

\renewcommand\Authands{ and }

\date{\small \em Received: 16 December 2016 Accepted: 31 December 2016 Published: 15 January 2017}

\maketitle


\begin{abstract}
        


The main objective of the paper is to supply security and to expand the network lifetime. The energy management domain is selected to reinforce the security system in wireless sensor networks. A typical wireless sensor network consists of many trivial and low-power sensors that sense radio frequencies to perform disseminate sensing tasks. These nodes typically have really restri \cted and non-replenish prepared energy resources, that produces energy and an important vogue issue for these networks. Routing is another really troublesome vogue issue for WSNs. Properly designed routing protocol not absolutely guarantees high message delivery relation and low energy consumption for message delivery, but in addition it should balance the full sensor network energy consumption, and thereby extend the sensor network fundamental measure. Throughout this paper, the tendency to confer Secure and Economical value Aware Secure Routing protocol for WSNs to balance the energy consumption and enhance the network fundamental measure. Further the tendency to reinforce very cheap work to avoid the fake energy indicator nodes by victimizing the house parameters.

\end{abstract}


\keywords{wireless sensor network, security, energy efficiency, geo routing.}

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

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


\let\tabcellsep& 	 	 		 
\section[{Introduction}]{Introduction}\par
uture sensor networks area unit is composed of Associate in nursing oversize category of closely packed sensor nodes. Each node inside the sensor network may embody one or further sensors, occasionally radio power, movable power gives presumptively localization hardware, sort of GPS (Global Positioning System) unit or a travel device. A key feature of such networks is that their nodes area unit unattended. Consequently, they have restricted and non-replicable energy resources. Therefore, energy efficiency could be a crucial vogue thought for these networks. Throughout this paper the tendency to review energy economical geographic packet forwarding techniques. Distributive knowledge in an area would be a really useful antique in many location aware systems, and notably detector networks. The region could also be expressed, as an example, by a tetragon in 2-space, therefore it satisfies the on prime of communication task, this question should be disseminated to the sensors inside the region, cost-effective because of publicize the geographic question to such a region is to leverage the position info inside the question and to route the question on to the region instead of flooding it everywhere. Previous survey had done to route a packet geographically to a target area in Associate in assist adhoc networks. Detector networks believe wireless communication, that's naturally a medium and is further vulnerable to security attacks than its wired counterpart due to lack of a physical boundary. Inside the wireless detector domain, anyone with a suitable wireless receiver can oversee and interrupt the detector network communications. The adversaries may use valuable radio transceivers, powerful workstations, and move with the network from a distance since they don't seem to be restricted to exploitation detector network hardware, it's accomplishable for the adversaries confirm to spot, the message provide or maybe determine the availability location, though durable secret writing is employed. Source-location Privacy (SLP) could be a crucial security issue. Lack of SLP can reveal very important perception concerning the queue carried on the network and additionally the physical world entities. Whereas confidentiality of the message could also be ensured through content secret writing but it miles a lot of difficult to adequately address the SLP and protecting the SLP is toughest job in WSNs since the detector nodes embody exclusively cheap and low-power radio devices, and area unit designed to regulate unattended for long periods of some time. Battery recharging or replacement is additionally unfeasible or unacceptable. Computationally intensive crypto graphical algorithms, like public-key cryptosystems, and large scale broadcasting based protocols, are not acceptable for WSNs. To optimize the detector nodes, restrict the node capabilities and additionally applying specific nature of the WSNs. Traditionally, security desires for the foremost half overlooked, this leads to WSNs vulnerable from network security attacks. Considering the worst case, opponents are able to undiscovered and lead some wireless detector nodes, compromise the cryptographically keys, and reprogram the wireless detector nodes. Throughout this paper, the tendency to initial proposes some criteria to quantitatively live source-location knowledge discharge for routing-based SLP schemes. Through the projected live criteria, the tendency to area unit able to establish security vulnerabilities of some exiting SLP schemes. We tend to propose a subject matter which is able to provide every content confidentiality and SLP through a two-phase routing. Inside the initial routing section, the messages provide randomly selects Associate in nursing intermediate node inside the detector domain therefore transmits the message to the Randomly Selected Intermediate Node (RSIN), this section provides SLP with a high native degree. Inside the second routing section, the messages area unit routed to a hoop node where the messages area unit homogenized through a Network Mixing Ring (NMR). By integration of the nuclear magnetic resonance, we tend to area unit able to dramatically decrease the native degree and increase the SLP. Our simulation results demonstrate that the projected theme is improbably economical and may return through a high message delivery relation. We believe it is going to be used in many smart applications. 
\section[{II.}]{II.} 
\section[{Related Work}]{Related Work}\par
The main idea of \hyperref[b0]{[1]} authors approach was to eliminate the unidirectional link at the network layer and magnificence novel shake and channel reservation mechanisms at the medium-access management layer using topological knowledge collected inside the network layer. This paper absolute to get the unidirectional links and to avoid the transmissions supported unlike links but they have not considered dynamic nodes benefits. In \hyperref[b1]{[2]} paper, author designed a cross layer framework that constructively improves the performance of the raincoat layer in power heterogeneous extempore networks. In addition, our approach seamlessly supports the identification and usage of unidirectional links at the routing layer. In \hyperref[b2]{[3]} paper author thought of the periodic salutation sharing is to hunt out the unidirectional link. But this periodic sharing may even causes to overhead inside the network. In \hyperref[b3]{[4]} paper, author planned to distribute the answer supported reducing the density of the network exploitation with a pair of mechanisms: bunch and adjustable transmission vary. By exploitation adjustable transmission varies; author in addition achieved another objective, energy economical vogue, as a by-product. In \hyperref[b4]{[5]} paper, author's thought is bunch mechanism. The result of tightly coupled technique may increase the delay in information transmission and author presents ad-hoc on demand distance vector routing (AODV), a totally distinctive rule for the operation of such ad-hoc networks. Each mobile host operates as a specialized router, and routes unit obtained professional re natal (i.e., on-demand) with little or no reliance on periodic advertisements. AODV is on demand routing protocol that routes unit established on demand and destination sequence numbers unit accustomed notice the latest route to the destination. The affiliation setup delay could be a smaller quantity. The salutation messages supporting the routes maintenance and unit range-limited, so those causes superfluous overhead inside the network but the intermediate nodes can lead to inconsistent routes if the availability sequence selection is very precious and additionally the intermediate nodes are stronger but not the latest destination sequence selection, thereby having stale entries. In \hyperref[b5]{[6]} paper, authors present a mathematical framework for quantifying the overhead of proactive routing protocols in mobile ad hoc networks. They specialize in things where the nodes unit indiscriminately but the wireless transmissions could also be decoded faithfully and communication among nodes unit vary completely different. In \hyperref[b6]{[7]} paper, authors present a general preview on different sources of energy consumption in wireless sensor networks, not on the routing. In \hyperref[b7]{[8]} paper, authors concentrated on distance between nodes only not on security. 
\section[{a) Overview of Existing System}]{a) Overview of Existing System}\par
Several geographical routing protocols were planned in recent years for wireless detector networks. In geographical routing each node forwards messages to its neighboring nodes by supported computable value and learning value. The computable value considers every house to the destination and additionally remaining energy of the detector nodes. Location privacy is provided through broadcasting that mixes the valid messages with dummy messages, but exclusively consumes the detector energy but in addition can increase the network collisions and scale back the packet delivery relation. 
\section[{b) Proposed System}]{b) Proposed System}\par
The energy consumption is severely disproportionate to the uniform energy preparation for the given configuration that greatly reduces the period of time of the detector networks. To resolve this drawback, we have an inclination to propose a secure and economical Cost-Aware Routing protocol which is able to address the energy balance and routing security at constant time in WSNs. In the proposed protocol each detector node needs to maintain the energy levels of its adjacent neighboring grids in addition to their relative locations, throughout this paper we'll specialize in a pair of routing strategies for message forwarding: shortest path message forwarding, and secure message forwarding through random walking to create routing path unpredictability for provide privacy and jam hindrance.\par
Initially all nodes assortment contains data regarding neighbor nodes, the network monitors having the detailed data of neighbor nodes like routing table, It provides the nodes data to the route manager.\par
The mobile devices periodically share their unused energy to all the nodes per unit area Year 2017 ( ) E i. Route Discovery ii. Energy Updating participating inside the network, this energy nodes will select the route i.e., reliable.\par
When supply node sends a request, nodes can check the energy of all its one hop neighbor nodes. Then the node chooses succeeding node that one has high energy price. All the nodes do constant method. This module is split into 2 sub modules named as 1. Poll method and information method 2. Poll method-By exploitation this module the node will verify the neighbors. 
\section[{c) Data Process}]{c) Data Process}\par
In this sub module, the node ought to cross check the knowledge. A node must verify the other node, and then the champion checks the knowledge (which is collected from the neighbor). Throughout the checking methodology verifiers compares the house b/w each neighbor and the other. The distance is calculated in a pair of ways, i.e. during which  
\section[{Results}]{Results}\par
Fig. \hyperref[fig_0]{2} shows the network placement. The nodes are randomly deployed in the network with initial energy of 100 Joules.       
\section[{Conclusion}]{Conclusion}\par
In this paper, the proposed routing protocol provides the security in message forwarding and also enhances the packet delivery rate and network lifetime.\par
The non uniform energy deployment scheme is implemented to extend the network lifetime and the fake energy sharing tracing technique is also introduced to find the malicious node present in the sensor network. The simulation results show that the lifetime of the ( )E\par
network and packet delivery rate is enhanced while increasing the secure routing.\begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Fig. 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Fig. 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{45}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Fig. 4 :EFig. 5 a}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5}\includegraphics[]{image-5.png}
\caption{\label{fig_3}Fig. 5 a}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{7}\includegraphics[]{image-6.png}
\caption{\label{fig_4}Fig. 7 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{89}\includegraphics[]{image-7.png}
\caption{\label{fig_5}Fig. 8 :Fig. 9 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-8.png}
\caption{\label{fig_6}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.506549815498155\textwidth}P{0.09723247232472325\textwidth}P{0.09723247232472325\textwidth}P{0.14898523985239853\textwidth}}
III.\tabcellsep \tabcellsep \\
iii. Calculating Hop-By-Hop Energy\tabcellsep \tabcellsep \\
iv. Neighbor Node Processing\tabcellsep \multicolumn{2}{l}{? Location based comparison}\\
\tabcellsep \multicolumn{2}{l}{? Data transmitted speed comparison}\\
\tabcellsep \tabcellsep \tabcellsep Year 2017\\
source node\tabcellsep \tabcellsep \tabcellsep 87\\
\multicolumn{2}{l}{Yes Collect neighbour node info Route discovery Process energy info Is}\tabcellsep Update routing table\tabcellsep Volume XVII Issue II Version I\\
malicious\tabcellsep \tabcellsep Ignore the\tabcellsep )\\
\multicolumn{3}{l}{Fig.1: Activity of proposed model Yes forward data sink node Need security? Shortest path No Forward data Random walking To the node closer to sink node No node packet}\tabcellsep Global Journal of Computer Science and Technology ( E\\
\tabcellsep \tabcellsep © 2017 Global Journals Inc. (US)\end{longtable} \par
 
\caption{\label{tab_0}}\end{figure}
 			\footnote{© 20 7 Global Journa ls Inc. (US) 1} 			\footnote{© 2017 Global Journals Inc. (US)} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Huang et al. (2011)]{b0}\label{b0} 	 		\textit{crosslayer approach asymmetry for wireless mesh access networks},  		 			Y Huang 		,  		 			Yang 		,  		 			Yang 		,  		 			X Yu 		,  		 			Fu 		.  		March, 2011.  	 
\bibitem[Fissaoui]{b6}\label{b6} 	 		 			Mohamed El Fissaoui 		.  	 	 		\textit{Said Benkirane, Abderrahim Beni-Hssane},  				 	 
\bibitem[Shah et al. (2007)]{b1}\label{b1} 	 		\textit{Handling asymmetry in power heterogeneous ad hoc networks: a cross layer approach},  		 			V Shah 		,  		 			P Gelal 		,  		 			Krishnamurthy 		.  		July, 2007.  	 
\bibitem[Lee and Gerla]{b5}\label{b5} 	 		 			Kevin C Lee 		,  		 			Mario Gerla 		.  		\textit{Survey of routing protocols in mobile ad-hoc network},  				 	 
\bibitem[Pages:424431,IJECE (2017)]{b7}\label{b7} 	 	 	 		\textit{Pages:424431,IJECE},  				February,2017. 7.  	 
\bibitem[Shivan Qasim Ameen]{b8}\label{b8} 	 		\textit{Ravie Chandren Muniyandi, Improvement at Network Planning using Heuristic Algorithm to Minimize Cost of Distance between Nodes in Wireless Mesh Networks},  		 			Shivan Qasim Ameen 		.  		7.  	 
\bibitem[Perkins]{b3}\label{b3} 	 		\textit{Royer Ad-hoc ondemand distance vector routin},  		 			Charles E Perkins 		,  		 			ElizabethM 		.  		 	 
\bibitem[Wu]{b4}\label{b4} 	 		\textit{Sadjadpour and j.j.garcia-lunaaceves, Routing overhead as a function of node mobility: modeling framework and implications on proactive routing},  		 			Xiamen Wu 		.  		 	 
\bibitem[Wu and Dai (2006)]{b2}\label{b2} 	 		\textit{virtual backbone construction in MANET's using adjustable transmission ranges},  		 			J Wu 		,  		 			F Dai 		.  		September. 2006.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
