\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: Detection and Prevention of Wormhole Attack 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{2014-01-15 (revised: 15 January 2014)}
\def\TheID{\makeatother }
\def\TheDate{2014-01-15}
\title{A Survey: Detection and Prevention of Wormhole Attack 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]{Akanksha  Gupta}

             \affil[1]{  }

\renewcommand\Authands{ and }

\date{\small \em Received: 15 December 2013 Accepted: 2 January 2014 Published: 15 January 2014}

\maketitle


\begin{abstract}
        


Wireless Sensor Networks refers to a multi-hop packet based network that contains a set of mobile sensor nodes. Every node is free to travel separately on any route and can modify its links to other nodes. Therefore, the network is self organizing and adaptive networks which repeatedly changes its topology. The relations among nodes are restricted to their communication range, and teamwork with intermediate nodes is necessary for nodes to forward the packets to other sensor nodes beyond their communication range. The network?s broadcasting character and transmission medium help the attacker to interrupt network. An attacker can transform the routing protocol and interrupt the network operations through mechanisms such as selective forwarding, packet drops, and data fabrication. One of the serious routingdisruption attacks is Wormhole Attack. The main emphasis of this paper is to study wormhole attack, its detection method and the different techniques to prevent the network from these attack.

\end{abstract}


\keywords{wormhole attack, classification, detection mechanism, wsn, security, routing protocols.}

\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
n Wireless Sensor Networks, the nodes use the open air medium to communicate with each other, in doing so they face sensitive security problems as compared to the wired networks. One such dangerous problem is wormhole attack. In this attack, two distant malicious nodes can plan together using either wired connection or directional antenna, to give an feeling that they are only one hop away. Wormhole attack can be executed in hidden or in sharing mode. Wormholes can either be used to examine the traffic throughout the network or to crash packets selectively or totally to affect the flow of information. The security mechanisms that are used for wired systems such as authentication and encryption are useless under hidden mode of wormhole attack because the nodes do not modify their headers but only forward these packets. But the attack in participating mode is more complicated, because if it once launched, it is difficult to detect. WSN faces some challenges which are as follows:\par
1. Power Consumption -conservation of power is necessary and detection of some power saving routing protocol.\par
2. Multicast Routing -scheming of multicast routing protocol for a frequently changing WSN surroundings 3. Internetworking -Communication among wired system and WSN while maintaining synchronization. 
\section[{II. Security Goals Designed for Wireless Sensor Networks}]{II. Security Goals Designed for Wireless Sensor Networks}\par
Security goals for WSN can be categorized as primary and secondary goals \hyperref[b34]{[35]}. Some of the primary goals are Data Confidentiality, Data Authentication, Data Availability and Data Integrity and secondary goals are Data Freshness, Secure Localization, Self-Organization and Time Synchronization. The primary goals are also known as standard security goals. Primary goals are as follows: a) Data Confidentiality Confidentiality is the capability to hide messages from a passive attacker such that every message communicated using the sensor network remains confidential. It is the most important concern in network security. A sensor node should not expose its data to its neighbors. 
\section[{b) Data Authentication}]{b) Data Authentication}\par
Authentication ensures the consistency of the message by identifying its foundation. Attackers in sensor networks can not only responsible for the alteration of packets but can also insert additional fake packets \hyperref[b33]{[34]}. Basically data authentication is used for the verification of the identity of the senders and receivers. Symmetric or Asymmetric mechanisms are used for data authentication in which sending and receiving nodes share secret keys. Because of wireless medium and unattended nature of sensor networks, it is very demanding to ensure authentication. 
\section[{c) Data Integrity}]{c) Data Integrity}\par
Data integrity in wireless networks is desired to ensure the consistency of data and to verify that a message has not been altered, tampered with or changed. Though the system has secrecy measures, but still there is a possibility of alterations. The integrity of the system will be in dilemma when:\par
? A wicked node present in the network adds false data. 
\section[{d) Data Availability}]{d) Data Availability}\par
Availability ensures whether the resources are free to be used by a node and whether the network is existing for the messages for communication. However, failure of the base station or cluster leader's availability will eventually threaten the entire sensor network. Thus data availability has a main importance for maintaining an operational network. Secondary goals are as follows: e) Data Freshness Even though confidentiality and data integrity are guaranteed, there is also a need to make sure the freshness of each message. Basically, data freshness \hyperref[b32]{[33]} ensures that the data is new and no old data have been replayed. To resolve this trouble related counter will be added into the packet to guarantee data freshness. 
\section[{f) Self-Organization}]{f) Self-Organization}\par
A wireless sensor network is a usually an ad hoc network, in which every sensor node is independent and flexible such that each nodes is self-organizing and self-healing to different situations. No permanent infrastructure is present in a wireless sensor network for network management. This natural feature challenges the wireless sensor network security. So if selforganization is absent in a sensor network, then the harm that results from an attack or from the risky environment may be disturbing. 
\section[{g) Time Synchronization}]{g) Time Synchronization}\par
Most of wireless sensor network applications are based on some type of time synchronization. Moreover, sensors tries to calculate the end-to-end delay of a packet as it travels from source to destination sensor or node. A shared sensor network can require group synchronization \hyperref[b32]{[33]} for purpose of tracking applications. 
\section[{h) Secure Localization}]{h) Secure Localization}\par
The effectiveness of a sensor network is based on its ability to locate each sensor node in the network correctly and automatically. Now a days, sensor networks designed to locate faulty nodes which will require the accurate location information. An attacker can easily operate all the non protected location information by exposing the replaying signals and false signal strengths etc. 
\section[{III.}]{III.} 
\section[{Wormhole Attacks}]{Wormhole Attacks}\par
Wormhole attack contains two nodes that are connected to one another with the a medium that is not offered to normal nodes, due to which the nodes can communicate with one another over a range in which normal nodes cannot. These two colluding nodes are operated such that they shown like a neighbors to all the other nodes. In [Figure \hyperref[fig_0]{1}], suppose node-1 wants to send any data to node-25 through the network, so node-1 broadcasts the route request. Let node-Xs and node-Xd are the two colluder nodes in the locality of source node and destination node. Now Xs along with other nodes in the network gets the route request from source node, it replays the same request to Xd, Xd receives the request and de-capsulate it and rebroadcasts it to its neighborhood. After receiving the route request through Xd the destination node-25 will think that they are direct neighbors to source node-1, and it will reply to that route request. Xd will then capture that reply and using the same process it will send it to Xs; which further send to node-1. Thus node-1 and node-25 will believe that they are 2-hop neighbors. And complete communication will pass through Xs and Xd. This is one type of wormhole attack; many more number of variants are defined in the literature \hyperref[b2]{[3]}, \hyperref[b3]{[4]}, \hyperref[b4]{[5]}. In \hyperref[b5]{[6]}, \hyperref[b6]{[7]}, \hyperref[b7]{[8]}; Wormhole attacks can be classified on the basis of: 1) Its Implementation 2) The medium used 3) The attackers 4) The location of victim nodes. a) Classification based upon Implementation This is the most important classification; which depends upon the behavior the attack is launched. 
\section[{i. Using Encapsulation}]{i. Using Encapsulation}\par
In this manner, there are some nodes are occupied along the path (these nodes may or may not be conscious of wormhole) between xs and xd. The packet gets encapsulated at xs and travels through the path in encapsulated form to avoid the increase in the hop count. In this case the attackers are not directly connected to one another rather make the other nodes believe that they are directly connected. These packets are transmitted between xs and xd using a virtual tunnel. Once this attack is successfully launched, then all the paths will contain a link that will contain of link between xs and xd.\par
ii. Using Out-Of-Band Channel These colluder nodes get connected directly through a out of band channel having high bandwidth. The channel can be obtained by a wired connection or using a wireless connections. The requirement of extra hardware made it difficult to launch, but provides a simplicity because it will not require any encapsulation/de-capsulation while the colluders are directly connected. 
\section[{iii. Using High Power Transmission}]{iii. Using High Power Transmission}\par
This type of wormhole particularly launched from two colluder nodes that facilitates high power transmission potential. 
\section[{iv. Via Protocol Deviations}]{iv. Via Protocol Deviations}\par
In this case the attackers generate the wormhole by not following the protocol set of laws e.g. Some protocols suppose the nodes to wait for a while before retransmitting but the attackers keeps on broadcasting and do not obey this rule and thus trying to reach first at the destination and thus avoiding any future genuine requests to reach destination. If the future requests arrive at destination, they will be dropped, since a request passing through the colluder has previously been received. 
\section[{b) Classification based upon Medium Used}]{b) Classification based upon Medium Used}\par
On the basis of medium used, wormhole attacks can be classified as in-band and out-of-band wormhole attacks.\par
i. In-Band Wormhole Same medium will be used by the attackers for creating link between them e.g. protocol deviations, packet relay and, encapsulation.\par
ii. Out-Of-Band Wormhole Like normal network nodes attackers do not use the same medium, e.g. High Transmission Mode and Out-Of-Band Channel. c) Classification based upon Attackers i. Self-Sufficient\par
Here colluder nodes present themselves as normal nodes and thus all paths passes through them e.g. using high power transmission or out-of-band channel.\par
ii. Extended Wormhole\par
The colluder nodes extends the attacks beyond themselves to normal nodes and are unseen by themselves e.g. packet relay or encapsulation. 
\section[{d) Classification based upon location of Victim nodes i. Simplex}]{d) Classification based upon location of Victim nodes i. Simplex}\par
The victim node is present inside the range of only one attacker. 
\section[{ii. Duplex}]{ii. Duplex}\par
The victim node is present inside the range of both the attackers. 
\section[{V.}]{V.} 
\section[{Literature Review}]{Literature Review}\par
A significant amount of work have been prepared for the detection of wormhole attacks and the attackers. The work ranges from suggestion of extra and exclusive hardware to minor modifications in the system protocols and suggestion of smart ways of avoiding or detecting the wormholes. However some can need extra hardware and other require extra processing and battery life. This section shows a small review of the approaches proposed till date.\par
Hu et al. \hyperref[b15]{[16]} proposed the method in 2003 based upon geographical and temporal packet leaches. In this method to avoid the wormhole, the geographical location or temporal location is used to bound the distance travelled by the packet. This approach is restricted by condition of GPS technology or the time synchronization. Lazos et al. \hyperref[b16]{[17]} proposed a method in 2005 where a few nodes are mandatory to be equipped by GPS locators and directional antennas. This procedure uses "local broadcast keys" for safe communication between one another.  the finding of wormhole attacks, which is right for proactive protocols.\par
Chen et al. \hyperref[b17]{[18]} proposed a secure localization approach in 2010 based on the inconsistent set based resistant localization. Graaf et al. \hyperref[b18]{[19]} proposed a dispersed detection approach based upon ranges of nodes for the detection of wormhole attacks. A Vani et al. \hyperref[b19]{[20]} proposed a solution in 2011 that combines the decision anomaly, neighbor list count and hop count methods for AODV protocol. This procedure depends upon hierarchical processing of nodes and their respective neighbors. They used the hop count information available in the routing table of the nodes which needs that we need to store two copies of routing table of every node so as to maintain the track of earlier hop counts. 
\section[{VI. Routing Protocols and Wormhole Attack}]{VI. Routing Protocols and Wormhole Attack}\par
Various routing protocols are existing for WSN. Some of the often used routing protocols are considered in this section and the risk of wormhole attacks to such protocols is described. These routing protocols are classified into two types: proactive / tabledriven protocols and reactive / demand-driven protocols \hyperref[b0]{[1]}. AODV, DSR and Ariadne are reactive routing protocols and OLSR, DSDV and SEAD are proactive routing protocols. 
\section[{a) OLSR (Optimized Link State Routing)}]{a) OLSR (Optimized Link State Routing)}\par
It is a proactive routing protocol in which information of the topologies get exchanged periodically. Hello messages are transmit to determine single hop neighbors. To allocate signaling traffic, flooding system is use. In this system each node forwards flooded message that was not forwarded by them earlier. The topology messages contains all the information about link states that are sent to all other nodes. With the help of this information, partial topology graph are obtained by every node after calculating the shortest path using symmetric relations. Now this system is open to wormhole attack \hyperref[b8]{[9]} - \hyperref[b10]{[11]}. Isolated nodes can send hello and topology manage messages are available at its colluding nodes to its personal neighbors for broadcasting fake information into the system. This will create two distant nodes to mistakenly believe themselves as neighbors, that leads to the failure of routing protocol. 
\section[{b) DSDV (Destination Sequenced Distance Vector)}]{b) DSDV (Destination Sequenced Distance Vector)}\par
It is a proactive routing protocol, in which all the metric, destination routes, sequence number generated by the destination node and next hop to each destination are maintained in a table \hyperref[b0]{[1]}, \hyperref[b1]{[2]}. Every node in the network acts as a router and the table gets updated periodically by exchange of messages among neighboring routers. This protocol is open to wormhole attack \hyperref[b8]{[9]}. By using a tunnel, the colluding nodes surpass message between two distant nodes, suppose X and Y which will results X and Y to consider themselves as neighbors and they will publicize a hop count of one among each other. As a result of this false information, if the alternative route has hop count more than one then all other authenticated nodes will aim to send the messages through X to destination Y. c) DSR (Dynamic Source Routing) It is a reactive routing protocol because it discovers the required routes only after it has packets to transmit to the destination. It wants source route maintenance because during the utilization of the route, it is necessary to check the operation of the path and to report the sender regarding the errors \hyperref[b1]{[2]}. It is at risk to wormhole attack and denial of service attack at the destination \hyperref[b8]{[9]}. This protocol ensures forwarding of just the first RREQ that it will received and will reject all other RREQ packets for the same route. This RREQ packet contains the intermediate nodes and the hop count information. The route then established is used to send data packets. As wormhole attack ensures a fast channel for forwarding messages, so as compared to other paths RREQ packet through them will arrived at destination faster. This will result in only the wormhole path to be discovered as the route to destination. The wormhole attacker discards the data packets totally or partially that results in denial of service attack at the destination. 
\section[{d) SEAD (Secure Ad-hoc Distance Vector)}]{d) SEAD (Secure Ad-hoc Distance Vector)}\par
This protocol depends upon on one-way hash chains rather than asymmetric cryptograph and protects the network from uncoordinated attacks and DoS attacks. Several nodes have the ability to authenticate all other elements of the chain. This requires authenticating the metric of the routing table and the sequence number. The receiver should also verify the sender \hyperref[b1]{[2]}. Thus, an enemy is not able to send routing message without compromising a node, as it does not give authentication code to its neighbors \hyperref[b11]{[12]}. Although SEAD effectively handles replay attack, it is incapable to handle the wormhole attack \hyperref[b12]{[13]} by a malicious node that are replaying the message from an unauthenticated node as a repeater. 
\section[{e) AODV (Ad-hoc On-demand Distance Vector)}]{e) AODV (Ad-hoc On-demand Distance Vector)}\par
It is an on-demand routing protocol which broadcasts RREQ messages to its immediate neighbors for sending messages to final destination and in turn these neighbors rebroadcast them to their neighbors. This whole process continues unless until the RREQ message reaches the destination. On getting the initial RREQ message from the source, the destination node sends a RREP to the source node through the same reverse path \hyperref[b0]{[1]}, \hyperref[b14]{[15]}. All the in-between nodes also put forward route entries in their respective table. The Year 2014 E neighboring nodes forward route error message to all its neighbors after detecting fault in any link to a node. This will again start a route discovery procedure to change the broken link. This AODV routing protocol is also at risk to wormhole attack \hyperref[b8]{[9]}.\par
As wormhole attack ensures a fast channel for forwarding messages, so as compared to other paths RREQ packet through them will arrived at destination faster. In this protocol, the destination rejects all the later on RREQ packets received, yet they are from authenticated node. Hence the destination chooses the fake path through wormhole for RREP \hyperref[b0]{[1]}.  messages. TESLA uses per-hop hashing method \hyperref[b1]{[2]}. An authentication done at each node does not only depends upon the information contained in the RREQ packet but also depends the authentication code of the preceding node. Ariadne protocol is free from overflooding of RREQ attack because the attacker is prevented from replaying the message due to the network-wide shared secret key. It is necessary for each node to insert authentication code to every RREQ packet that it forwards. Then the source can be able to authenticate the origin of all individual data field in the RREP packet \hyperref[b13]{[14]}. It is protected from rushing attack wormhole and attack \hyperref[b12]{[13]} while successful route distortion requires RREQ to be tailored cautiously. 
\section[{VII.}]{VII.} 
\section[{Detection and Avoidance of Wormhole Attacks}]{Detection and Avoidance of Wormhole Attacks}\par
From past few years the main area of research is the detection of wormhole attack. The most important task is to discover the occurrence of wormhole in the system \hyperref[b11]{[12]}, \hyperref[b23]{[24]} - \hyperref[b30]{[31]}.\par
Detection of wormhole on the basis of the Hello control messages \hyperref[b25]{[26]}. With the use of OLSR specifications, the percentage of HELLO Message Timing Intervals (HMTIs) which lies in a range enclosed by the amount of jitter. A range R = [T?, T + ?] have been defined. If HMTI is in the range R, then it will considered to be valid; otherwise it is said to be out-ofprotocol. A second check is made every time when the HMTI packet behavior is doubtful. On other side, a badly performing node would get coupled with it a comparatively large number of repeat packets, that would not be the case by an attacking node. In this way, the false positive alarms problem gets negotiated.\par
A new protocol known as Multi-path Hop-count Analysis (MHA) is proposed on the basis of hop-count analysis to stay away from wormhole attack \hyperref[b23]{[24]}. It is supposed that very low or very high hop-count is not good for the network. The uniqueness of the hop-count analysis for detecting wormholes nodes is yet uncertain.\par
Wormholes nodes are detected by assuming that wormhole attacks have longer packet latency as compared to the normal wireless propagation latency in a single hop \hyperref[b9]{[10]}. As the route during wormhole seems to be shorter, various new multi-hop routes be also channeled in the direction of the wormhole that leads to the longer queuing delays. The links having delays are considered to be doubtful links, as the delay might also takes place due to congestion as well as intra-nodal processing. The OLSR protocol is used for routing. This approach aims to sense the suspicious link and authenticate them in a two step process that is described below.\par
In first step, Hello packets has been sent to all the nodes that are within its transmission range. As soon as the receiver receives the Hello message, then it records the address of the sender and the time delay Î?" left until it will be programmed to send its next Hello message. The node attaches the address of the sender and their respective values of time delay Î?" that has recorded for piggybacked reply. When Hello reply is received by a node, then it checks for the information related to any of its outstanding requests. But if no such information is there, then it will suppose it as any other control packet. Otherwise, node checks the arrival time of Hello reply message to notice whether it is arrived within its scheduled timeout interval by considering the time delay Î?" that occur at the receiver side. If the arrival time is within its timeout interval then link between itself and node is taken to be safe, otherwise doubtful and communication to that node is terminated by the sender until the verification process gets over.\par
In second step, a probing packet is sent to all the suspected nodes (that are detected in the previous step) by the sender.\par
If a suitable acknowledgement is received from any node X within its scheduled timeout interval then node X is considered to be safe. Otherwise the occurrence of wormhole is proved.\par
Both delay per hop indication (DelPHI) and hop count are monitored for wormhole detection \hyperref[b21]{[22]}. The basic assumption is that the delay that packet experience in standard conditions for propagation of one hop will become too high under wormhole attack as the actual path between the nodes is shorter than the advertised path. This proposed methodology for wormhole detection is a two-step process.\par
The first phase has the route path information, gained from a set of disjoint paths from sender to receiver. Every sender will consist of a timestamp on a unique DREQ packet and send it to receiver after signing it. After receiving the packet for first time every node will adds its node ID then increase the hop count by 1 and rejects the packet next time onwards. After receiving each disjoint path the receiver send the DREP packets. This process is carried out for three times and the hop count and smallest delay information will be chosen for wormhole detection.\par
In second phase, the time difference between the packet it had sent to its neighbor and the reply received by it known as round trip time (RTT) is calculated. Delay per hop value (DPH) is evaluated as RTT/2h, where h stands for hop count to the particular neighbor. Under ordinary circumstances, a smaller h also have smaller RTT. However, smaller hop count will have larger RTT under wormhole attack. But one DPH value for node X exceed the consecutive one by several threshold, then path from node X to every another paths with DPH values greater than it is considered as under wormhole attack.\par
Similar propositions are made in SaW \hyperref[b28]{[29]} and DaW \hyperref[b29]{[30]}. In SaW, AODV protocol was used and in( D D D D )\par
Year 2014 E DaW, DSR routing protocol was used. In these papers, security models have been planned and used to detect interruption. To detect the attacks, it will use statistical methods. If any link is identified to be doubtful, then existing information is used to detect the presence of a wormhole. In trusted model, nodes monitor their neighbors on the basis of packet drop pattern but not on the basis of number of drops. Other algorithm has been proposed in \hyperref[b29]{[30]} to detect the presence of wormhole into system. In this algorithm, the source waits for RREP after sending the RREQ. The source receives a lot of RREP from different routes. By using the below expression we can find out the link with very high frequency:\par
Fi= pi /P, for all Li Fmax = max (Fi), where r is the set of all obtained routes, Li is the ith link, pi is the number of times that Li appears in r, P is the total number of links in r, and Fi is the relative frequency that Li appears in r. If Fmax > Fthreshold, then check the information present in RREP of that route. The node will be malicious if the value of correlation coefficient for packets dropped is greater than the pre-set threshold value t, then it will inform the operator otherwise continue with routing process.\par
According to \hyperref[b28]{[29]} and \hyperref[b29]{[30]}, the regular link frequency analysis may lead to fake detection of wormhole attacks. Though, these recognize the performance of a wormhole as they record the total number of packet drops rather than the pattern of drop.\par
The wormhole attack can be detected using multipath routing \hyperref[b26]{[27]}. When a source node wants a new route, it will broadcast the RREQ into the network and wait for responses. Then the in-between node will forward only the first RREQ packet. After receiving the first RREQ the destination will wait for a while to gather all the obtained routes. A new scheme known as Statistical Analysis of Multi-path (SAM) is projected in \hyperref[b26]{[27]}. SAM uses Pmax (i.e. maximum probability of relative frequency of a link to occur in the set of all obtained routes from one route discovery) and Ø (i.e. difference between the most frequently appeared link and the second most frequently appeared links in the set of all obtained routes from one route discovery), which will be higher in the presence of wormhole attack. Relative Frequency is calculated using probability mass function (PMF) which is more for a network that is under wormhole attack as compared to a normal network. The performance of Dynamic Source Routing (DSR) and Ondemand multipath routing (MR) protocol are compared under wormhole attack.\par
A cluster based counter-measure known as WHIDS \hyperref[b27]{[28]} is proposed for the wormhole attack. By using MATLAB simulation results the effectiveness of WHIDS are revealed for detecting wormhole attack. This method, yet not been experienced in existence of multiple wormhole attacks.\par
Vu et al. proposed the technique to detect the existence of wormhole node using two phases \hyperref[b30]{[31]} as in \hyperref[b9]{[10]} and \hyperref[b21]{[22]}. The first phase contains of two methods: In first method, the computation of round-trip-time (RTT) among the source and all of its immediate neighbors is measured. In second method, source identifies its onehop and two-hop neighbors to form its neighbor set. If it is originated that the destination is not the neighbor of source node then the link between them will be taken as suspicion. After detecting the doubtful links, the next phase is used to verify the presence of wormholes for exchange of messages by using the RTS / CTS mechanism.\par
Table \hyperref[tab_2]{1} represents multi-aspect comparison among eight different wormhole detection techniques. Significant aspects like false alarm detection, the node mobility along with QoS parameters are considered for each detection technique. This qualitative study have been supported by quantitative one also for several algorithms using the network simulator tool. \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Figure 1 (}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.85\textwidth}}
The Prevention of Wormhole attack in AODV using WSN f) Ariadne (A Secure On-Demand Routing Protocol for Ad-hoc Networks) This protocol depends on symmetric Simulation Nodes Deployment for the requisite WSN Implementation of Wormhole attack in the AODV routing protocol Scenario Generation to carry out the effect of wormhole attack Result analysis to distinguishing the effect of wormhole attack Implementation of isolator to detect and prevent simultaneously the wormhole attack in AODV Apply proposed algorithm to further prevention of wormhole attack and for broadcasting safe communication Result analysis and comparison for the desired metrics like end-to-end delay End cryptography and ensures Start Simulation\end{longtable} \par
 
\caption{\label{tab_1}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.075\textwidth}P{0.1881578947368421\textwidth}P{0.1618421052631579\textwidth}P{0.21447368421052634\textwidth}P{0.21052631578947367\textwidth}}
\tabcellsep \tabcellsep \tabcellsep \tabcellsep Year 2014\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep D D D D D D D D )\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep (\\
Method\tabcellsep Mobility\tabcellsep QoS\tabcellsep Synchronization\tabcellsep False detection\\
\tabcellsep \tabcellsep Parameter\tabcellsep \tabcellsep \\
WORMEROS [31]\tabcellsep Topological change is\tabcellsep \multicolumn{2}{l}{Not considered Time synchronization not}\tabcellsep Both false positive and\\
\tabcellsep not considered\tabcellsep \tabcellsep required. RTT between\tabcellsep false negative alarms\\
\tabcellsep \tabcellsep \tabcellsep source node and\tabcellsep are considered\\
\tabcellsep \tabcellsep \tabcellsep destination node is\tabcellsep \\
\tabcellsep \tabcellsep \tabcellsep considered\tabcellsep \\
HMTIs [26]\tabcellsep Handled weakly.\tabcellsep \multicolumn{2}{l}{Jitter and delay Not required. Since PSD}\tabcellsep Used PSD to detect\\
\tabcellsep Topologically robust,\tabcellsep \tabcellsep profiling is done locally\tabcellsep false positive alarm\\
\tabcellsep short range worm-hole\tabcellsep \tabcellsep \tabcellsep \\
\tabcellsep can be detected\tabcellsep \tabcellsep \tabcellsep \\
Farid et al. [10]\tabcellsep Not considered\tabcellsep Packet\tabcellsep Some time delay added\tabcellsep Not handled\\
\tabcellsep \tabcellsep processing\tabcellsep to detect suspicious\tabcellsep \\
\tabcellsep \tabcellsep time, queue\tabcellsep links\tabcellsep \\
DelPHI [22]\tabcellsep Not considered\tabcellsep Delay\tabcellsep Not required\tabcellsep Not handled\end{longtable} \par
 
\caption{\label{tab_2}Table 1 :}\end{figure}
 			\footnote{© 2014 Global Journals Inc. (US)} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Maulik and Chaki ()]{b7}\label{b7} 	 		‘A Comprehensive Review on Wormhole Attacks in MANET’.  		 			R Maulik 		,  		 			N Chaki 		.  	 	 		\textit{9th International Conference on Computer Information Systems and Industrial Management Applications},  				2010.  	 
\bibitem[Maulik and Chaki ()]{b31}\label{b31} 	 		‘A Comprehensive Review on Wormhole Attacks in MANET’.  		 			R Maulik 		,  		 			N Chaki 		.  	 	 		\textit{Proceedings of 9th International Conference on Computer Information Systems and Industrial Management Applications},  				 (9th International Conference on Computer Information Systems and Industrial Management Applications)  		2010.  	 
\bibitem[Shang-Ming Jen and Laih ()]{b23}\label{b23} 	 		\textit{A Hop-Count Analysis Scheme for Avoiding Wormhole Attacks in MANET},  		 			Chi-Sung Shang-Ming Jen 		,  		 			Laih 		.  		2009.  	 
\bibitem[Roy et al. ()]{b27}\label{b27} 	 		\textit{A New Cluster-based Wormhole Intrusion Detection Algorithm for Mobile Ad-hoc Networks},  		 			D B Roy 		,  		 			R Chaki 		,  		 			N Chaki 		.  		2009.  	 
\bibitem[Sankaran et al. ()]{b28}\label{b28} 	 		‘A Novel Security model SaW: Security against Wormhole attack in Wireless Sensor Networks’.  		 			M S Sankaran 		,  		 			P S Das 		,  		 			S Selvakumar 		.  	 	 		\textit{Proceedings of International Conference on PDCN},  				 (International Conference on PDCN)  		2009.  	 
\bibitem[Khokhar et al. ()]{b0}\label{b0} 	 		‘A Review of Current Routing Attacks in Mobile Ad Hoc Networks’.  		 			R H Khokhar 		,  		 			. A Md 		,  		 			S Ngadi 		,  		 			Manda 		.  	 	 		\textit{International Journal of Computer Science and Security}  		2008.  	 
\bibitem[Chen et al. (2010)]{b17}\label{b17} 	 		‘A secure localization approach against wormhole attacks using distance consistency’.  		 			Honglong Chen 		,  		 			Wei Lou 		,  		 			Zhi Wang 		.  	 	 		\textit{EURASIP Journal on Wireless Communications and Networking}  		April 2010.  	 
\bibitem[Vani and Rao (2011)]{b19}\label{b19} 	 		‘A Simple Algorithm for Detection and Removal of Wormhole Attacks for Secure Routing In Ad Hoc Wireless Networks’.  		 			A Vani 		,  		 			D Sreenivasa Rao 		.  	 	 		\textit{International Journal on Computer Science and Engineering}  		June 2011.  	 
\bibitem[Kannhavong et al. ()]{b14}\label{b14} 	 		\textit{A Survey of Routing Attacks in Mobile Ad Hoc Networks},  		 			Bounpadith Kannhavong 		,  		 			Hidehisa Nakayama 		,  		 			Abbas Jamalipour 		.  		2007. IEEE Wireless Communication.  	 
\bibitem[Wang et al. ()]{b33}\label{b33} 	 		\textit{A Survey of Security Issues in Wireless Sensor Networks},  		 			Y Wang 		,  		 			G Attebury 		,  		 			B Ramamurthy 		.  		2006. IEEE Communication Surveys Tutorials.  	 
\bibitem[Meghdadi and Ozdemir ()]{b2}\label{b2} 	 		‘A Survey of Wormholebased Attacks and their Counter measures in Wireless Sensor Networks’.  		 			M Meghdadi 		,  		 			S Ozdemir 		.  	 	 		\textit{IETE Tech Rev}  		2011.  	 
\bibitem[Akykildiz et al. ()]{b32}\label{b32} 	 		\textit{A Survey on Sensor Networks},  		 			Ian F Akykildiz 		,  		 			Yogesh Sankarasubramaniam 		,  		 			Erdal Cayirci 		.  		2002. IEEE Communication Magazine.  	 
\bibitem[Khin Sandar Win ()]{b29}\label{b29} 	 		‘Analysis of Detecting Wormhole Attack in Wireless Networks’.  		 			Khin Sandar Win 		.  	 	 		\textit{World Academy of Science, Engineering and Technology}  		2008.  	 
\bibitem[Mahajan and Natu ()]{b5}\label{b5} 	 		‘Analysis of wormhole intrusion attacks in MANETS’.  		 			V Mahajan 		,  		 			M Natu 		.  	 	 		\textit{IEEE Military Communications Conference (MILCOM)},  				2008.  	 
\bibitem[Mahajan and Natu ()]{b20}\label{b20} 	 		‘Analysis of wormhole intrusion attacks in MANETS’.  		 			V Mahajan 		,  		 			M Natu 		.  	 	 		\textit{IEEE Military Communications Conference},  				2008.  	 
\bibitem[Hu and Johnson ()]{b13}\label{b13} 	 		‘Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks’.  		 			Y.-C Hu 		,  		 			D B Johnson 		.  	 	 		\textit{Wireless Networks},  				2005. 11.  	 
\bibitem[Chiu and Lui ()]{b21}\label{b21} 	 		‘DelPHI: Wormhole Detection Mechanism for Ad Hoc Wireless Networks’.  		 			H S Chiu 		,  		 			K Lui 		.  	 	 		\textit{Proceedings of International Symposium on Wireless Pervasive Computing},  				 (International Symposium on Wireless Pervasive Computing)  		2006.  	 
\bibitem[Nait-Abdesselam and Bensaou ()]{b9}\label{b9} 	 		\textit{Detecting and Avoiding Wormhole Attacks in Wireless Ad hoc Networks},  		 			F Nait-Abdesselam 		,  		 			B Bensaou 		.  		2008. IEEE Communications Magazine.  	 
\bibitem[Gorlatova et al. ()]{b25}\label{b25} 	 		‘Detecting Wormhole Attacks in Mobile Ad Hoc Networks through Protocol Breaking and Packet Timing Analysis’.  		 			M A Gorlatova 		,  		 			P C Mason 		,  		 			L Lamont 		,  		 			R Liscano 		.  	 	 		\textit{IEEE Military Communications Conference},  				2006.  	 
\bibitem[Graaf et al. ()]{b18}\label{b18} 	 		\textit{Detection of wormhole attacks in wireless sensor networks},  		 			R Graaf 		,  		 			I Hegazy 		,  		 			J Horton 		.  		2010. Springer book chapter Ad Hoc Networks.  	 
\bibitem[Vivian and Alchieri ()]{b1}\label{b1} 	 		‘Evaluation of QoS Metrics in Ad Hoc Networks with the use of Secure Routing Protocols’.  		 			D Vivian 		,  		 			E A P Alchieri 		.  	 	 		\textit{Network Operations and Management Symposium},  				2006.  	 
\bibitem[Baras and Theodorakopoulos ()]{b10}\label{b10} 	 		‘Intrusion Detection System Resiliency to Byzantine Attacks: The Case Study of Wormholes in OLSR’.  		 			John S Baras 		,  		 			George Theodorakopoulos 		.  	 	 		\textit{IEEE Military Communications Conference},  				2007.  	 
\bibitem[Jhaveri and Jinwala ()]{b4}\label{b4} 	 		 			R H S J Jhaveri 		,  		 			D C Jinwala 		.  		\textit{Advanced Computing \& Communication Technologies (ACCT)},  				2012.  	 	 (DoS Attacks in Mobile Ad Hoc Networks: A Survey) 
\bibitem[Djenouri et al. ()]{b24}\label{b24} 	 		‘On Securing MANET Routing Protocol Against Control Packet Dropping’.  		 			D Djenouri 		,  		 			O Mahmoudi 		,  		 			M Merabti 		.  	 	 		\textit{IEEE International Conference on Pervasive Services},  				2007.  	 
\bibitem[Hu and Perrig ()]{b8}\label{b8} 	 		‘Packet leashes: A Defense against Wormhole Attacks in Wireless Ad Hoc Networks’.  		 			Yih-Chun Hu 		,  		 			Adrian Perrig 		.  	 	 		\textit{22nd Annual Joint Conference of the IEEE Computer and Communications Societies},  				2003.  	 
\bibitem[Hu et al. (2003)]{b15}\label{b15} 	 		‘Packet leashes: a defense against wormhole attacks in wireless networks’.  		 			Y.-C Hu 		,  		 			A Perrig 		,  		 			D B Johnson 		.  	 	 		\textit{Twenty-Second Annual Joint Conference of the IEEE Computer and Communications},  				April 2003. IEEE Societies.  	 
\bibitem[Lazos et al. (2005)]{b16}\label{b16} 	 		‘Preventing wormhole attacks on wireless ad hoc networks: a graph theoretic approach’.  		 			L Lazos 		,  		 			R Poovendran 		,  		 			P Syverson 		,  		 			L W Chang 		.  	 	 		\textit{Wireless Communications and Networking Conference},  				March 2005.  	 
\bibitem[Hu et al. ()]{b11}\label{b11} 	 		‘SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks’.  		 			Y.-C Hu 		,  		 			A Perrig 		,  		 			D B Johnson 		.  	 	 		\textit{Proceedings of Fourth IEEE Workshop on Mobile Computing Systems and Applications},  				 (Fourth IEEE Workshop on Mobile Computing Systems and Applications)  		2002.  	 
\bibitem[Biswas and Ali ()]{b12}\label{b12} 	 		\textit{Security Threats in Mobile Ad Hoc Network". Paper submitted to the Department of Interaction and System Design},  		 			Kamanshis Biswas 		,  		 			Md Ali 		.  		2007.  		 			School of Engineering at Blekinge Institute of Technology 		 	 
\bibitem[Choi et al. ()]{b22}\label{b22} 	 		‘WAP: Wormhole Attack Prevention Algorithm in Mobile Ad Hoc Networks’.  		 			S Choi 		,  		 			D Kim 		,  		 			J Jung 		.  	 	 		\textit{International Conference on Sensor Networks, Ubiquitous and Trustworthy Computing},  				2008.  	 
\bibitem[Vijayalakshmi and Rabara (2011)]{b3}\label{b3} 	 		‘Weeding Wormhole Attack in MANET Multicast Routing Using Two Novel Techniques -LP3 and NAWA2’.  		 			S Vijayalakshmi 		,  		 			S Albert Rabara 		.  	 	 		\textit{International Journal of Computer Applications}  		February 2011.  	 
\bibitem[Walters et al. ()]{b34}\label{b34} 	 		‘Wireless Sensor Network Security: A Survey’.  		 			John Paul Walters 		,  		 			Zhengqiang Liang 		,  		 			Vipin Chaudhary 		.  	 	 		\textit{Grid and Pervasive Computing Yang Xiao},  				2006.  	 	 (Security in Distributed) 
\bibitem[Vu et al. ()]{b30}\label{b30} 	 		‘WORMEROS: A New Framework for Defending against Wormhole Attacks on Wireless Ad Hoc Networks’.  		 			H Vu 		,  		 			A Kulkarni 		,  		 			K Sarac 		,  		 			N 		.  	 	 		\textit{Proceedings of International Conference on Wireless Algorithms Systems and Applications},  				 (International Conference on Wireless Algorithms Systems and Applications)  		2008.  	 
\bibitem[Song et al. ()]{b26}\label{b26} 	 		‘Wormhole Attacks Detection in Wireless Ad Hoc Networks: A Statistical Analysis Approach’.  		 			N Song 		,  		 			L Qian 		,  		 			X Li 		.  	 	 		\textit{Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium},  				 (the 19th IEEE International Parallel and Distributed Processing Symposium)  		2005.  	 
\bibitem[Chiu and Lui ()]{b6}\label{b6} 	 		‘Wormhole Detection Mechanism for Ad Hoc Wireless Networks’.  		 			H S Chiu 		,  		 			K Lui 		.  	 	 		\textit{Proceedings of International Symposium on Wireless Pervasive Computing},  				 (International Symposium on Wireless Pervasive Computing)  		2006.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
