\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 in Wireless Ad Hoc Network Security and Secure Energy Optimization Approaches for Routing},
 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-03-15 (revised: 15 March 2015)}
\def\TheID{\makeatother }
\def\TheDate{2015-03-15}
\title{A Survey in Wireless Ad Hoc Network Security and Secure Energy Optimization Approaches for Routing}
\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]{D V Srihari  Babu}

\renewcommand\Authands{ and }

\date{\small \em Received: 4 February 2015 Accepted: 2 March 2015 Published: 15 March 2015}

\maketitle


\begin{abstract}
        


Wireless ad hoc network nodes together establish a network infrastructure without using any access points or base stations for communicates using multi hop schemes. It has significant characteristics like dynamic topologies, constrained in bandwidth and limited resource a high challenge in implementing security with optimized energy resource utilization which is the key aspects while designing modern ad hoc networks architecture. Ad hoc Networks nodes are limited in broadcast range, and also their capabilities of computation and storage are well limited to their energy resources. This limitation of resources in wireless ad hoc creates high challenges in incorporating security mechanism for routing security and privacy maintenance. This paper investigates the various issues and challenges in secure routing and energy optimization during communication in wireless ad hoc network towards security and secure energy utilization improvisation.

\end{abstract}


\keywords{wireless ad hoc network, routing, security, energy resource optimization.}

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

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


\let\tabcellsep& 	 	 		 
\section[{Introduction}]{Introduction}\par
d hoc networks where all nodes cooperatively maintain network connectivity in multi-hop wireless networks. Networks of this kind useful for disaster relief and emergency needs through a temporary network connectivity which is required to be used in such situation. It enables communication between nodes by forward packets within each other's. Building such ad hoc networks creates many barriers imposed by the environment and significant technical challenge. Ad hoc network suffers due to high mobility and resource constraints in together. The multiple propagations and intervention in wireless transmission effects and provide wireless primarily on the limited primarily to the wireless medium, operating in an ad hoc network routing protocols combined to create significant challenges. Thus, in the field of lightweight equipment should be used. Because they run on battery lifetime and improve the network of battery life as they should be conserving energy resources.\par
Wireless mobile ad hoc network (MANET) due to its extensive features is widely used in many military and civilian applications. Ad networks collect data on many Military and civilian applications. Ad hoc networks collect data on many wireless applications that are designed for a variety of environments. Based on the assessment of the different categories of data in their intended application. The natures of the applications mentioned above are used by governments, and individuals concerned. However, data used in among are confidentiality, authenticity and availability must be maintained in the integrity of certification.\par
Security and resources effect sensors in wireless networks due to its very limited resources of wireless networks and other challenges \hyperref[b2]{[3]} \hyperref[b3]{[4]}. Mobile ad hoc network operate on traditional security networks services due to the limitations of wireless sensor networks and its difficulties to employ traditional security measures. For example, it is inefficient to employ SSL protocol. SSL protocol for wireless sensor networks, inefficient as it requires a high amount of energy  {\ref [5][6]}.\par
This paper provides an in depth investigation in security issues and secure energy optimization approaches in Wireless mobile ad hoc network. It initially discusses the trends and mechanism of mobile ad hoc network communication in Section-2. Security issues and vulnerabilities are being discussed in section-3 and the energy optimization for longer network stability is discussed in Section-3. 
\section[{II.}]{II.} 
\section[{Wireless Mobile ad hoc Network}]{Wireless Mobile ad hoc Network}\par
A mobile ad hoc network (MANET) is dynamic arbitrary and temporary network topology to manage the wireless mobile nodes with self-configuration. People and vehicles using the first wireless communication infrastructure or the infrastructure of such areas without the need for an extension can internetwork \hyperref[b2]{[3]}.\par
All the nodes in Mobile ad-hoc network communicate directly to their range nodes which are in their radio range. Direct communication to communicate with each other within the intermediate node (s), while that of the nodes. In both cases, all nodes are involved in communication with the wireless network automatically, so this can be seen as some kind of mobile ad-hoc network.\par
Mobile ad hoc network are able to communicate directly to all the other titles in the radio range coverage. To communicate with each other in direct communication range, inter-node (s) that do not use the neighbor information. In both cases, all the nodes will automatically participate in the wireless communication network can be seen as a mobile ad hoc network as a wireless form. It shows the following unique characteristics \hyperref[b3]{[4]} as follows:\par
? Wireless links between nodes that are volatile and unpredictable. As well as the mobility of wireless nodes and nodes with limited power supplies, mobile ad-hoc network of wireless communication links between them involved nodes are not stable. ? Topology dynamic behavior is due to the continuous motion of the nodes, the constant changes in the mobile ad-hoc network topology. The other nodes in the network nodes and part-time into constant move out of radio range, and routing information is changing all the time because of the movement of the nodes. ? Statically configured not to the lack of robust security features in the wireless routing protocol is intended for ad-hoc environments. Ad hoc networks are constantly changing the topology of the routing protocol, because statically configured so as to prevent the kind of attacks and potential attacks to try to make use of every pair of adjacent nodes for routing to incorporate the issue for the need.\par
The above mentioned features are the traditional mobile ad hoc networks. Wired trend indicates malicious behavior suffers more than the network. Therefore, we must focus more attention to utilization of energy security and security issues in mobile ad hoc networks.\par
MANETs are of much more risk than the network attack mechanism should proceed  {\ref [2][17]}. This is due to the following reasons. 
\section[{a) Lack of Infrastructure}]{a) Lack of Infrastructure}\par
Ad hoc networks, certification authorities, and the line of servers do not apply to any classical solutions based on any infrastructure to operate independently. 
\section[{b) Inadequate Physical Security}]{b) Inadequate Physical Security}\par
Mobile wireless networks are more vulnerable to physical security threats, fixed wireless networks, more than the average. Theft, spoofing, and DoS attacks should be carefully considered which are likely to increase. Already the most demanding security systems link security threat reduction wireless networks. 
\section[{c) Limited Power Supply}]{c) Limited Power Supply}\par
Due to the temporary movement of network nodes, the node depends on the battery system for their energy supplies. The power supply can be limited because of denial-of-service attacks and selfishness. 
\section[{d) Frequent Varying Network Topology}]{d) Frequent Varying Network Topology}\par
Arbitrary nodes are free to move anywhere. Incidentally network topology change and their distance from other nodes may have no limits. As a result of this spontaneous movement, the reaction gradually makes unidirectional links between nodes as well as to give rise to two directional changes in an unpredictable manner \hyperref[b4]{[5]}. 
\section[{IV. Different Approaches in Manet for Security}]{IV. Different Approaches in Manet for Security}\par
Many different suggestions exist in the literature \hyperref[b16]{[17]} \hyperref[b17]{[18]}[19] \hyperref[b19]{[20]} but how to protect the environment of MANET. Many use cases or the environment can be used only for specific solutions, but protocol of bootstrapping the defense should be able to connect to the network, especially in settings where new issues are arise any time and maintain it is a difficult question. In short, this section will be present to establish securities which are already known. 
\section[{a) Distributed Security Approach}]{a) Distributed Security Approach}\par
With the fully distributed gateway to access any server nodes or MANETs, completely self-organized security solutions \hyperref[b15]{[16]} will be used. Each node in a local public key is to manage the repository. Repositories available can be found using a certificate chain to validate a certificate.\par
The certificate authority using secret sharing method or action can be decentralized. Using this technique makes it possible to distribute several nodes on a common centralized authority. Many nodes distribute a secrete and deals only through cooperation, can the secret reunion. Unfortunately, this method can be a Sybil attack. 
\section[{b) Location Dependable Security Approach}]{b) Location Dependable Security Approach}\par
Taking advantage of the limited mobility or using localized node in a mobile ad hoc network, the security of the communication paths is introduced to the other possibilities. The so-called imprinting of a security in relation to the use of the direct physical contact. This approach is extended by Balfanz et al. \hyperref[b0]{[1]} and they propose that the public key certificates to the exchange location-limited channel. In some applications, such as ad-hoc communication with a printer and the use of the bootstrap method is very simple security policy. Because of the mobility of the nodes, this approach increases the distribution network within the security association. For self-organized networks this method is exclusively appropriate. 
\section[{c) Broadcast Solutions}]{c) Broadcast Solutions}\par
Mobile ad-hoc network is also supported by the existing transmission networks. The distribution networks of the media (audio and video), but also the data for the channels are made. This data is sent over the secure channel, broadcast encryption schemes are very useful. If the receivers had previously applied to be included in the information packets for transmission encryption to decrypt and access the data. Broadcast encryption also allows you to remove or exclude former recipients from future broadcasts and data can be encrypted using a symmetric encryption key. We also know that a valid key is used in many different keys encrypted with the receivers. Nodes in the network are transmitted in encrypted keys to a key management block, are stored in. The key to decrypt the data nodes and the maintenance of a credible process to extract the block. The transmission encryption in the sense of broadcast it is introduced in \hyperref[b5]{[6]}. Displayed little change in the policy of this that allows the user to set up groups \hyperref[b10]{[11]}. Therefore, only a certain number of senders and receivers of messages can be creating as readable. 
\section[{d) Trust and Reward Procedures}]{d) Trust and Reward Procedures}\par
In a wireless network selfish nodes do not support which generally cause the problem for network performance disruption to MANETs. Support and participation are more attractive and a really good way to have been proposed \hyperref[b13]{[14]}. The node can participate in a lot of debt often, than not presented any packet nodes. The recompense scheme also drives like operations, e.g. links can often present path for packet headers which will be expressed in more interest. Therefore, the network will be increased confidence. These can be used to secure many other protocols and mechanisms for the MANETs. 
\section[{V. Security Countermeasure Approaches in Manet}]{V. Security Countermeasure Approaches in Manet}\par
To provide secure communication between the nodes to communicate security is a primary concern in MANET. To provide solutions to the problems involved in the security of mobile networks, we should be able to explain to the two most commonly used methods. Prevention of basic network functions in the early stages of their design is not embedded in the network operation which can be easily threatened. 
\section[{a) Prevention Mechanism}]{a) Prevention Mechanism}\par
Prevention of discontent from malicious attacks, such a solution is described by initiating active nodes. In the absence of infrastructure it is difficult to provide prevention using the policies of authentication, access control, encryption and digital signature policy, and also by using traditional methods one can provide the first line of defense. Such tokens or smart card PIN, phrases or used in addition to verification of biometrics is available through some security modules. 
\section[{b) Reactive Mechanism}]{b) Reactive Mechanism}\par
Identifying malicious activities and taking actions in reactive protocols mechanisms specifies any evidence of malicious that tries to take punitive measures against the reactive approach. MANET intrusion detection system (IDS) is to support schemes such as the use of enforcement mechanisms, etc. These intrusion detection systems are used to detect the manipulation and disorders. Such as Nuglets, confidant, CORE and selfish node behavior to reduce the implementation of cooperation, such as tokenbased. In this category, they will be able to recognize and react to the threat of such applications is the ability to induce all the protocols. 
\section[{c) Security Schemes in Ad hoc Networks}]{c) Security Schemes in Ad hoc Networks}\par
In malicious network activity and specific issues related to the environment it is difficult to distinguish between in ad hoc networking. An ad hoc network malicious nodes at random intervals is to enter and leave as soon as the radio transmission range to avoid detection or disrupt network activity may collude with other malicious nodes. Further complicating the detection of malicious nodes behave only occasionally harmful. In order to get a global view of the network topology makes it difficult to dynamically and quickly, which is expected to become obsolete. In order to achieve the security objectives of many security schemes to succeed, even though none of them ad hoc wireless networks, security aspects of the proposed deals 
\section[{i. Intrusion Detection}]{i. Intrusion Detection}\par
Intrusion audit data provide evidence Detection System \hyperref[b16]{[17]} for capturing the attacks. Based on the audit data type used, intrusion Detection System can be classified as a network-based and host-based. Means of network packets through the network hardware interface former usually runs in the second Test monitors and analyzes events and hospitality programs or users \hyperref[b17]{[18]}.Manipulation detection (use patterns of known attacks) and abnormal detection (known attacks deviation flag): intrusion detection systems can be classified as the methods used. Both methods rely on the use of those packets for packets sniffing and analysis \hyperref[b18]{[19]}.\par
Zhang and Lee \hyperref[b16]{[17]} described each node in a wireless ad hoc network IDS intrusion detection and personal responsibility by agents involved in the name of the proposed architecture for intrusion detection and response. It can monitor real-time traffic which has no fixed "focus points" Because, audit collection devices is limited by the range of the radio. Anomalies wireless ad hoc network anomaly detection schemes is expected to be localized, incomplete and possibly from the old information is not easily distinguishable. Therefore, the authors \hyperref[b16]{[17]}  the networking layers and incorporated into the further development of a comprehensive, cross-layer approach can be achieved.\par
ii. Secure Routing in Wireless Ad hoc Networks Wireless ad hoc networks routing and wire-line networks cannot rely on dedicated routers. This functionality is simple terminals, as well as routers for other nodes that work is spread out over all the nodes. Data routing face many problems, such as providing a secure environment for networking and for the purposes of possible security attacks experienced temporary special. Ad hoc networks are the most popular routing protocols do not comprise of security aspects. Ad hoc wireless networks from security attacks, and especially attacks at the network layer of the defense, some of the requirements \hyperref[b19]{[20]} should fulfill. Complete missions and the threat of a temporary wormhole attack against the disabled can disrupt communications. Based on the identification of a number of proposals for the use of wormhole packets.\par
Different approaches are very securityconscious in wireless ad hoc networks which have been proposed to achieve the security. In Table  {\ref -}1 it shows the most important security-strengthening properties awareness which drives the appropriate techniques to solve the following implementation for the various mechanisms of security aware routing protocols (SWRP). 
\section[{Table 1 : Secure aware routing properties and techniques}]{Table 1 : Secure aware routing properties and techniques}\par
Many security routing protocols are discussed briefly in the following subsections. SRP: Secure Routing Protocol (SRP) \hyperref[b20]{[21]} is regarding the information to disrupt the process of the discovery, the acquisition of the guarantee to protect against attacks that can be applied to a multitude of reactive routing protocols. Either way, replies to compromise or be rejected again or ever reach the node back to the trial, the fabrication are protocol guarantees. SAR : This protocol \hyperref[b21]{[22]} aware of the ad hoc routing protocol security metric to define the level of trust and security attributes which are taken into account in the routing. And significant levels of trust in the hierarchy of levels of trust between the nodes can be defined. Nodes with the high level of trust among themselves and with the distribution of a common key encryption / decryption keys for the Notes equal to the share of each trust level. However, the contract for a different level of security in the network increases the total number of keys to different keys. SEAD: It is an efficient ad hoc distance vector operation for safe destination protocol-distance gradient vector. Vector creates DOS attacks and resource calculation (DSDV) drives Protocol \hyperref[b22]{[23]} is based on. SEAD DSDV-SQ Operation protocol and the sequence number and operating table update message was inspired to deal with attackers that different industry metric. To secure this DSDV-SQ \hyperref[b23]{[24]} operation protocol of SEAD not rely on each side to implement and expensive asymmetric cryptographic hash chain on art. SEAD operation using a hash table implemented security mechanisms chain features updated message sequence number and the metric is correct. The implementation mechanism to ensure the identity of the client, or the broadcast authenticates the sender information on SEAD attempt to remove malicious nodes. ARAN: Depending on the situation ARAN cryptographic certificates, temporary ad hoc networks and the power of the routing protocol is to prevents from the malicious activities with the support of an trusted third party. Minimum safekeeping policy, reliability of messages, identity authentication and non-repudiation of a necessary from end-to-end authentication for passed and initial certification process implementation \hyperref[b24]{[25]}. ARIADNE: On-demand safe operation Protocol of this is DSR-based highly efficient symmetric cryptography \hyperref[b25]{[26]} only stay on. Protocol required that a genuine key to our view that this must be some. Each node of the network is the same in each of the authentic and genuine way of finding each chain element nodes to nodes (a node between the source and) must share a secret key. ARIADNE message authentication code (MAC) and the joint chief operating point provides authentication message. However, except for the higher version, wormhole does not protect against attacks. S-AODV: Security-aware AODV protocol single malicious nodes \hyperref[b26]{[27]} Therefore, efficient solution to eliminate the black hole attack. Malicious intermediate nodes, it was the shortest route to the destination because of advertising that black-hole problem. Or dealing with the limited means of generating e-solutions proposed by malicious packets to an intermediate node has been tested by the neighbors realized. S-AODV Protocol each intermediate node can be assumed that all transit operators ensure packets. Control Message Originator of South Africa's signature and the final part of the hash chain appends. Network cryptographically signed message headers and the second and intermediate Ordering Sequence number hash confirmed. 'S-AODV is unable to deal with malicious headers to control the working group, including a significant overhead. 
\section[{VI. Secure Energy Optimization Routing in Wireless Communication}]{VI. Secure Energy Optimization Routing in Wireless Communication}\par
Internal attacks are ineffective or compromised nodes before using a global shared key security structures. Therefore, fair wormholes and internal attacks to identify more sophisticated security mechanisms, and to protect the malicious headers. Safe and secure operation routing that can be used to enhance the security WSN. In this section, we have selected the operation of routings for secure networks. Parts in the preceding are well know for the power of information solutions to the solutions. 
\section[{a) SERP: Secure Energy Efficient Routing Protocol}]{a) SERP: Secure Energy Efficient Routing Protocol}\par
Wireless Sensor Networks routing protocol for the safe, energy efficient is described in SERP -Secure energy efficient routing \hyperref[b24]{[25]}. The main objective of this protocol is to limited base station power requirement with authentication and confidential data from the sensors to provide a robust transmission. It is relatively static sensor devices which are deployed in densely dedicated to WSNs.\par
The three key aims were considered during the scheme of the SERP as follows ? To ensure the efficient transmission of power to the network is to know the structure, and the maximum lifetime to the end of the network. ? Secure communications nodes should be able to identify the incorrect intrusion reports. ? Strong and resilient transmission failure of any node can greatly hamper the performance of a network. Energy savings mechanism based on the selected nodes are disabled transceivers radio. The two main states of the nodes in a network to perform: Non forwarding -forwarding transceiver, switch off -both transceiver and sensing devices which are switched. The backbone of the structure of the network, has been the assumption that all the headers are either directed or in non-states. But while the active sensing device nodes forwarding state of their radio transceivers. On the other hand, forwarding nodes keep both the radio and the active sensing device. All the nodes to perceive the environment, and in any event not later identify nodes forwarding the data to the base station via a selected route nodes and broadcast on their radio signal ranges. 
\section[{b) EENC: Energy Efficiency Routing with Node Compromised Resistance}]{b) EENC: Energy Efficiency Routing with Node Compromised Resistance}\par
Node is compromised immunity is a novel energy efficient routing protocol proposed by K Lin et al \hyperref[b27]{[28]} as EENC. It describes that EENC compromised nodes under the situation of bypasses and corresponding energy intake, improves the accuracy of the packets. Reinforcement knowledge established on ant-colony optimization routing tables are used to the complete. All nodes in the network are assigned with a trust Likewise, such as multiple behavior is based on the characteristics of the computed value. A one-hop neighbor of each node in a sensor network calculates the value of the trust. The idea of EENC is to provide security for low energy consumption and manage its energy resources.\par
This protocol EENC was evaluated through simulation. The performance metric to consider life and network packets correctly receives rate included. The EENC performance compared with other operations algorithms, i.e., DRP and MTRP are described \hyperref[b28]{[29]} and presents the results of simulation of EENC operating through the trans-mission line can often compromised headers \hyperref[b28]{[29]} EENC is to ensure that the energy efficiency performance was observed, that the estimated lifetime testing and successful packet delivery ratio and a higher DRP for more EENC received MTRP. 
\section[{c) Location-based Power Conservation outline}]{c) Location-based Power Conservation outline}\par
In \hyperref[b16]{[17]} Location Based Energy Conservation Program (LBPC) was discussed by authors. They suggested that the power consumption reduction algorithm in MANET. Such protocol transmission range of adjustment for the nearest neighbors is the first Hop neighbors and arbitrary detachment between the first uses of location information provided by GPS fitted to obtain general information about the distance. Two types of algorithms based on the results of the simulation are presented in the floods, which varied from 10-50\% ratio showed an energy conservation. This is a significant amount of energy conservation, and the stored power adjustments as a result of a variety of network transmission range are done. However, the average distance to the neighboring transmission range is equal to the ratio of low to provide other performance parameters, but high in energy conservation. 
\section[{d) SPAN: Energy Efficient Coordination Algorithm for}]{d) SPAN: Energy Efficient Coordination Algorithm for}\par
Topology Maintenance SPAN protocol, which reduces power consumption without reducing network connectivity also code named to ad hoc multi-hop wireless networks for the distribution of synchronization technique \hyperref[b17]{[18]}. SPAN is coordinated by the cycle of "stay and sleep-awake" between the nodes and the ad-hoc multi-hop data packet performs routing within the network, while the other nodes are in power redeemable approach and occasionally to check if they will awaken and become a coordinator. During coordinator election every node in the network can adaptively become a coordinator and rotating them in time to decide whether or not to use a random back-off delay, the process is done by the SPAN. Back off delay for a node to other nodes in the neighborhood of the delay and the number of nodes is a function of the amount of remaining power. Network connectivity not only is to protect the approach adopted in SPAN, it also preserves the ability to reduce latency and provides significant energy savings. Node density decreases only slightly increases as the size of the power saving provided by SPAN. Practically nodes wake up and listen for traffic from advertising in the current run of SPAN, features energy-saving, can be used \hyperref[b18]{[19]}. 
\section[{e) Power-aware Routing Protocol}]{e) Power-aware Routing Protocol}\par
Power awareness Routing (PAR) \hyperref[b20]{[21]} is maximizes the life span of the network and, hence, the source of the data packets transmitted during the process of setting up the route to the destination, choose less congested and more stable way to reduce power consumption by providing energy efficient routes. PAR protocols on the three parameters are the accumulated energy of a way, the status of the battery's life and the type of data to be transmitted. PAR time to focus on the core metrics are chosen path, hence, less traffic for the delivery of data is considered to be more stable. That provided different ways for different type of data transfer, network lifetime are increased. PAR simulation results from the energy-related performance metrics to the different ways in high mobility scenarios, such as DSR \hyperref[b21]{[22]} and AODV \hyperref[b22]{[23]} shows that outperforms the relevant protocol. However, PAR suffers increased latency during data transfer, but it goes a long way, and found enormous energy savings. 
\section[{VII.}]{VII.} 
\section[{Conclusion}]{Conclusion}\par
In this paper, the mobile ad-hoc network routing security solutions in energy conservation issues and provides an overview of the study of the protocols. Due to the lack of infrastructure for wireless networks and the dynamic and transient nature of the relationship between network nodes, designers, especially prepared to impose additional challenges. Advanced security mechanisms, security must be designed to achieve the goals and they are effective. Ad-hoc functionality to provide a secure link layer security features are intended to be embedded in the equipment. Another challenge is preventing the efficient use of computing resources, computing harmful. Research in the field of authentication and key management to be efficient in terms of computational burden, which focuses on the design of the cryptographic algorithms. These protocols are available in various performance demands and proposals identified by the use of force against the parameters of this exhibition show the maximum effect. The study describes the achievement of high power conservation without compromising other performance metrics in MANET which provides for the performance demands of individual protocols. In the future, we intentionally designed to deliver the perfect blend of MANETs with some metrics for the performance demands with the intention to use the proposed protocols.\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}}\end{figure}
  			\footnote{© 2015 Global Journals Inc. (US)} 			\footnote{© 2015 Global Journals Inc. (US) 1} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Sharma et al. ()]{b7}\label{b7} 	 		‘A comparative study of various security approaches used in wireless sensor networks’.  		 			K Sharma 		,  		 			M K Ghose 		,  		 			D Kumar 		.  	 	 		\textit{Int. J. Adv. Sci. Technol}  		2010. 17 p. .  	 
\bibitem[Yu and Guan ()]{b27}\label{b27} 	 		‘A dynamic en-route scheme for filtering false data injection in wireless sensor networks’.  		 			Z Yu 		,  		 			Y Guan 		.  	 	 		\textit{Proc. 25th IEEE Int. Conf. Com. Commun. INFOCOM},  				 (25th IEEE Int. Conf. Com. Commun. INFOCOMBarcelona, Spain)  		2006. 2006. p. .  	 
\bibitem[Rahman et al. ()]{b2}\label{b2} 	 		‘A robust pair-wise and group key management protocol for wireless sensor network’.  		 			M Rahman 		,  		 			S Sampalli 		,  		 			S Hussain 		.  	 	 		\textit{GLOBECOM Workshops (GC Wkshps)},  				 (Miami, FL)  		2010. 2010. p. .  	 
\bibitem[Garg et al. (2013)]{b5}\label{b5} 	 		‘A Secure Energy Efficiency Routing Approach In Wireless Sensor Networks’.  		 			Anuradha Garg 		,  		 			Ajay Tiwari 		,  		 			Hemant Kumar Garg 		.  	 	 		\textit{International Journal of Engineering and Advanced Technology (IJEAT)}  		February 2013.  (2) .  	 
\bibitem[Yi et al. ()]{b10}\label{b10} 	 		‘A Security-Aware Routing Protocol for Wireless Ad hoc Networks’.  		 			S Yi 		,  		 			P Naldurg 		,  		 			R Kravets 		.  	 	 		\textit{th World Multi-Conference on Systemics, Cybernetics and Informatics},  				2002.  	 	 (SCI 2002) 
\bibitem[Wu et al. ()]{b20}\label{b20} 	 		‘A Survey of Attacks and Countermeasures in Mobile Ad Hoc Networks’.  		 			B Wu 		,  		 			J Chen 		,  		 			J Wu 		,  		 			M Cardei 		.  	 	 		\textit{Wireless/Mobile Network Security},  				2006. Springer. 17.  	 
\bibitem[Ahmad et al. ()]{b8}\label{b8} 	 		‘Analysis of security protocols for Wireless Sensor Networks’.  		 			M Ahmad 		,  		 			M Habib 		,  		 			J Muhammad 		.  	 	 		\textit{Proc. 3rd Int. Conf. Comp. Res. Develop. ICCRD},  				 (3rd Int. Conf. Comp. Res. Develop. ICCRDShanghai, China)  		2011. 2011. 2 p. .  	 
\bibitem[Hu et al. (2002)]{b19}\label{b19} 	 		‘Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks’.  		 			Y C Hu 		,  		 			A Perrig 		,  		 			D B Johnson 		.  	 	 		\textit{Proc. MobiCom'02},  				 (MobiCom'02Atlanta, GA)  		September 2002. p. .  	 
\bibitem[Sanzgiri et al. (2005)]{b1}\label{b1} 	 		‘Authenticated Routing for Ad Hoc Networks’.  		 			K Sanzgiri 		,  		 			D La Flamme 		,  		 			B Dahill 		,  		 			B N Levine 		,  		 			C Shields 		,  		 			E M Belding-Royer 		.  	 	 		\textit{Proceedings of IEEE Journal on Selected Areas in Communications}  		March 2005. 23  (3) .  	 
\bibitem[Sanzgiri et al. (2005)]{b18}\label{b18} 	 		‘Authenticated Routing for Ad Hoc Networks’.  		 			K Sanzgiri 		,  		 			D Laflamme 		,  		 			B Dahill 		,  		 			B N Levine 		,  		 			C Shields 		,  		 			E M Belding-Royer 		.  	 	 		\textit{Proceedings of IEEE Journal on Selected Areas in Communications}  		March 2005. 23  (3) .  	 
\bibitem[Gheorghe et al. ()]{b14}\label{b14} 	 		‘Authentication and Anti-replay Security Protocol for Wireless Sensor Networks’.  		 			L Gheorghe 		,  		 			R Rughinis 		,  		 			R Deaconescu 		,  		 			N Tapus 		.  	 	 		\textit{Systems and Networks Communications (ICSNC), 2010 Fifth International Conference on},  				 (Nice, France)  		2010. p. .  	 
\bibitem[Ahmed et al. (2006)]{b16}\label{b16} 	 		‘Cluster-based Intrusion Detection (CBID) Architecture for Mobile Ad Hoc Networks’.  		 			E Ahmed 		,  		 			K Samad 		,  		 			W Mahmood 		.  	 	 		\textit{Aus CERT2006 R\&D Stream Program, Information Technology Security Conference},  				May 2006.  	 
\bibitem[Niewiadomska-Szynkiewicz et al. ()]{b6}\label{b6} 	 		‘Comparative study of wireless sensor networks energy-efficient topologies and power save protocols’.  		 			E Niewiadomska-Szynkiewicz 		,  		 			P Kwaoeniewski 		,  		 			I Windyga 		.  	 	 		\textit{J. Telecom. Inform. Technol}  		2009.  (3)  p. .  	 
\bibitem[Sun et al. (2008)]{b13}\label{b13} 	 		‘Defense of trust management vulnerabilities in distributed networks’.  		 			Y Sun 		,  		 			Z Han 		,  		 			K J R Liu 		.  	 	 		\textit{IEEE Communications Magazine}  		February 2008. 46  (2)  p. .  	 
\bibitem[Lin et al. ()]{b26}\label{b26} 	 		‘Energy efficiency routing with node compromised resistance in wireless sensor networks’.  		 			K Lin 		,  		 			Ch F Lai 		,  		 			X Liu 		,  		 			X Guan 		.  	 	 		\textit{Mob. Netw. Appl}  		2012. 17 p. .  	 
\bibitem[Ajina (1793)]{b30}\label{b30} 	 		‘Energy Efficient, Power Aware Routing Algorithm For Sensor Network’.  		 			A Ajina 		.  	 	 		\textit{International Journal of Computer Theory and Engineering}  		1793-8201, February-2011. 3  (1) .  	 
\bibitem[Hall et al. ()]{b24}\label{b24} 	 		‘Enhancing intrusion detection in wireless networks using radio frequency ngerprinting’.  		 			J Hall 		,  		 			M Barbeau 		,  		 			E Kranakis 		.  	 	 		\textit{IASTED International Conference on Communications, Internet, and Information Technology},  				 (St. Thomas, US Virgin Islands)  		2004. 2004. p. .  	 
\bibitem[El-Saadawy and Shaaban ()]{b3}\label{b3} 	 		‘Enhancing S-LEACH security for wireless sensor networks’.  		 			M El-Saadawy 		,  		 			E Shaaban 		.  	 	 		\textit{Electro/Information Technology (EIT), 2012 IEEE International Conference on},  				2012. p. .  	 
\bibitem[Perkins and Bhagwat ()]{b9}\label{b9} 	 		‘Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers’.  		 			C E Perkins 		,  		 			P Bhagwat 		.  	 	 		\textit{Proceedings of SIGCOMM 1994},  				 (SIGCOMM 1994)  		1994.  	 
\bibitem[Zhang and Lee ()]{b11}\label{b11} 	 		‘Intrusion Detection in Wireless Ad hoc Networks’.  		 			Y Zhang 		,  		 			W Lee 		.  	 	 		\textit{Mobicom'00},  				 (Boston, MA, USA)  		2000.  	 
\bibitem[Wai and Aye ()]{b12}\label{b12} 	 		\textit{Intrusion Detection in Wireless Ad-Hoc Networks},  		 			F H Wai 		,  		 			Y N Aye 		,  		 			James 		,  		 			NH 		.  		2005.  		 			School of Computing, National University of Singapore 		 	 	 (CS4274 Introduction to Mobile Computing, term paper) 
\bibitem[Burmester and Breno De Medeiros (2008)]{b15}\label{b15} 	 		‘On the Security of Route Discovery in MANETs’.  		 			Mike Burmester 		,  		 			Breno De Medeiros 		.  	 	 		\textit{IEEE Transactions On Mobile Computing}  		March 1, 2008.  	 
\bibitem[Th and Clausen (2003)]{b22}\label{b22} 	 		\textit{Optimized Link State Routing Protocol},  		 			Th 		,  		 			Clausen 		.  		July 2003.  	 	 (IETF Internet draft, draft-ietfmanet-olsr-11.txt) 
\bibitem[Soroush et al. ()]{b4}\label{b4} 	 		‘Providing transparent security services to sensor networks’.  		 			H Soroush 		,  		 			M Salajegheh 		,  		 			T Dimitriou 		.  	 	 		\textit{Communications}  		2007. 2007. p. .  	 
\bibitem[Patwardhan et al. (2005)]{b0}\label{b0} 	 		‘Secure Routing and Intrusion Detection in Ad hoc Networks’.  		 			A Patwardhan 		,  		 			J Parker 		,  		 			A Joshi 		,  		 			A Karygiannis 		,  		 			M Iorga 		.  	 	 		\textit{3 rd IEEE International Conference on Pervasive Computing and Communications},  				 (Kauaii Island, Hawaii)  		March 2005.  	 
\bibitem[Papadimitratos and Haas ()]{b23}\label{b23} 	 		‘Secure routing for mobile ad hoc networks’.  		 			P Papadimitratos 		,  		 			Z Haas 		.  	 	 		\textit{Proc. SCS Communication Networks and Distributed Systems Modeling and Simulation Conference},  				 (SCS Communication Networks and Distributed Systems Modeling and Simulation Conference)  		2002. 2002.  	 
\bibitem[Yang et al. (2004)]{b17}\label{b17} 	 		‘Security in mobile ad hoc networks: Challenges and solutions’.  		 			Hao Yang 		,  		 			Haiyun Luo 		,  		 			Fan Ye 		,  		 			Songwu Lu 		,  		 			Lixia Zhang 		.  	 	 		\textit{IEEE Wireless Communications}  		Feb., 2004. 11 p. .  	 
\bibitem[Pathan and Hong ()]{b25}\label{b25} 	 		‘SERP: secure energy-efficient routing protocol for densely deployed wireless sensor network’.  		 			A K Pathan 		,  		 			C S Hong 		.  	 	 		\textit{Annales des Telecomm}  		2008. p. .  	 
\bibitem[Perrig et al. ()]{b28}\label{b28} 	 		‘SPINS: security protocols for sensor networks’.  		 			A Perrig 		,  		 			R Szewczyk 		,  		 			J D Tygar 		,  		 			V Wen 		,  		 			D Culler 		.  	 	 		\textit{Wirel. Netw}  		2002. 8  (5)  p. .  	 
\bibitem[Balfanz et al. (2002)]{b21}\label{b21} 	 		‘Talking to Strangers: Authentication in Ad hoc Wireless Networks’.  		 			D Balfanz 		,  		 			D Smetters 		,  		 			P Stewart 		,  		 			H Wong 		.  	 	 		\textit{Proceedings of the Symposium on Network and Distributed Systems Security (NDSS '02)},  				 (the Symposium on Network and Distributed Systems Security (NDSS '02)San Diego, California)  		February 2002.  	 
\bibitem[Karlof et al. ()]{b29}\label{b29} 	 		‘TinySec: a link layer security architecture for wireless sensor networks’.  		 			C Karlof 		,  		 			N Sastry 		,  		 			D Wagner 		.  	 	 		\textit{Proc. 2 nd Int. Conf. Embedded Networked Sensor Sys},  				 (2 nd Int. Conf. Embedded Networked Sensor SysBaltimore, MD, USA)  		2004. p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
