\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={Performance Evaluation of AODV based on black hole attack in ad hoc network},
 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{2012-03-15 (revised: 15 March 2012)}
\def\TheID{\makeatother }
\def\TheDate{2012-03-15}
\title{Performance Evaluation of AODV based on black hole attack in ad hoc network}
\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]{Dr. Yatin  Chauhan}

             \author[2]{Prof Jaikaran  Singh}

             \affil[1]{  }

\renewcommand\Authands{ and }

\date{\small \em Received: 6 February 2012 Accepted: 1 March 2012 Published: 15 March 2012}

\maketitle


\begin{abstract}
        


A Mobile Ad hoc Network (MANET) is a new networking paradigm. In the development of Mobile Ad hoc networks routing is the main issue. There are different security flaws and attacks on routing protocols in MANETs. These attacks can affect the performance of different routing protocols. Blackhole is one of these attacks. The blackhole attack can affect the performance of different routing protocols. During this attack, a malicious node captures packets and not forwards them in the network. This paper illustrates how blackhole attack can affect the performance of routing protocol, AODV, in Mobile Ad hoc networks by using NS-2.34 simulator.

\end{abstract}


\keywords{MANET, AODV, Black Hole attack;.}

\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
obile ad hoc network (MANET) is a collection of wireless mobile nodes which have the ability to communicate with each other without having fixed network infrastructure or any central base station. Since mobile nodes are not controlled by any other controlling entity, and network management are done, they have unrestricted mobility and connectivity to others. Nodes routes cooperatively by each other nodes. Due to limited transmission power, multi hop architecture is needed for one node to communicate with another through network. In this multi hop architecture, each node works as a host and as well as a router that forwards packets for other nodes that may not be within a direct communication range. Each node participates in an ad hoc route discovery protocol which finds out multi hop routes through the mobile network between any two nodes. These infrastructure-less mobile nodes in ad hoc networks dynamically create routes among themselves to form own wireless network on the fly. Thus, mobile ad hoc networks provide an extremely flexible communication method for any place where geographical or terrestrial constraints are present and any fixed architecture, such as battlefields, and some disaster management situations. Recent research on MANET shows that the MANET has larger security issues than conventional networks \hyperref[b0]{[1,}\hyperref[b1]{2]}.\par
In our study, we simulated the blackhole attack on AODV routing protocol. Extensive simulations have been carried out using NS-2.34 simulator. We have analyzed the network performance with and without blackhole attack. This paper is organized as follows; section II describes the background or related work and section III explains about the AODV. Section IV describes blackhole attack. In section V simulation results shows the impact of blackhole attack on the performance of routing protocols which is followed by conclusion in section VI. 
\section[{II.}]{II.} 
\section[{BACKGROUND}]{BACKGROUND}\par
The problem of security has received considerable attention by researchers in the ad hoc network community. In this section, some of these contributions are presented. The problem of securing the routing layer using cryptographically secure messages is addressed by Hu et al. \hyperref[b3]{[4]}, Papadimitratos and Haas \hyperref[b4]{[5]}, and Sanzgiri et al. \hyperref[b5]{[6]}. Schemes to handle authentication in ad hoc networks assuming trusted certificate authorities have been proposed by Kong et al. \hyperref[b6]{[7]}. Hubaux et al. \hyperref[b7]{[8]} have employed a self-organized PGPbased scheme to authenticate nodes using chains of certificates and transitivity of trust. Stajano and Anderson \hyperref[b8]{[9]} authenticate users by imprinting in analogy toducklings acknowledging the first moving subject they see as their mother.\par
In contrast to securing the routing layer of ad hoc networks, some researchers have also focused on simply detecting and reporting misleading routing misbehavior. Watchdog and Pathrater \hyperref[b9]{[10]} use observation-based techniques to detect misbehaving nodes, and report observed misbehavior back to the source of the traffic. Pathrater manages trust and route selection based on these reports. This allows nodes to choose better paths along which to route their traffic by routing around the misbehaving nodes. However, the scheme does not punish malicious nodes; instead, they are relieved of their packet forwarding burden.\par
CONFIDANT \hyperref[b10]{[11]} detects misbehaving nodes by means of observation and more aggressively informs other nodes of this misbehavior through reports sent around the network. Each node in the network hosts a monitor for observations, reputation records for firsthand and trusted second-hand reports, trust records to control the trust assigned to the received warnings, and a path manager used by nodes to adapt their behavior according to reputation information. Subsequent research has found that reputation schemes can be beneficial for fast misbehavior detection, but only when one can deal with false accusations \hyperref[b11]{[12]}.\par
Researchers have also investigated means of discouraging selfish routing behavior in ad hoc networks, generally through payment schemes \hyperref[b12]{[13]}. These approaches either require the use of tamperproof hardware or central bankers to do the accounting securely, both of which may not be appropriate in some truly ad hoc network scenarios. In the per-hop payment scheme proposed by Buttyan and Hubaux \hyperref[b14]{[15]}, the payment units are called nuglets and reside in a secure tamper-proof module in each node. They have observed that given such a module, increased cooperation is beneficial not only for the entire network but also for individual nodes. The scheme can result in unfairness to some hosts, but its simplicity and performance may be appropriate in some cases.\par
Bansal and Baker \hyperref[b13]{[14]} have proposed a scheme that relies on first-hand observations. Directly observed positive behavior increases the rating of a node, while directly observed negative behavior decreases it by an amount larger than that is used for positive increments. If the rating of a node dips below the faulty threshold, the node is added to a faulty list. The faulty list is appended to the route request by each node broadcasting it to be used as a list of nodes to be avoided. A route is rated good or bad depending on whether the next hop is on the faulty list. If the next hop of a route is in the faulty list, the route is rated as bad. As a response to misbehavior of a node, all traffic from that node is rejected. A second chance mechanism for redemption employs a timeout after an idle period. After a timeout, the node is removed from the faulty list with its rating remaining unchanged.\par
Sen et al. have presented a scheme for detection of malicious packet dropping nodes in a MANET \hyperref[b14]{[15]}. The mechanism is based on local misbehavior detection and flooding of the detection information in a controlled manner in the network so that the malicious node is detected even if moves out a local neighborhood.\par
Deng, Li and Agarwal \hyperref[b2]{[3]} have suggested a mechanism of defense against black hole attack in adhoc networks. In their proposed scheme, as soon as the RouteReply packet is received from one of the intermediate nodes, another RouteRequest is sent from the source node to a neighbor node of the intermediate node in the path. This is to ensure that such a path exists from the intermediate node to the destination node. For example, let the source node S send RouteRequest packets and receive RouteReply through the intermediate malicious node M. The RouteReply packet of M contains information regarding its nexthop neighbor node. Let it contain information about the neighbor E. Then, the source node S sends FurtherRouteRequest packets to this neighbor node E. Node E responds by sending a FurtherRouteReply packet to source node S. Since node M is a malicious node, and thus not present in the routing list of node E, the FurtherRouteReply packet sent by node E will not contain a route to the malicious node M. But if it contains a route to the destination node D, then the new route to the destination through node E is selected, and the earlier selected route through node M is rejected.\par
While this scheme completely eliminates the black hole attack by a single attacker, it fails completely in identifying a cooperative black hole attack involving multiple malicious nodes. 
\section[{III.}]{III.} 
\section[{AODV}]{AODV}\par
In this section, a brief overview of the AODV routing protocol is presented and the security threat that are associated with this routing protocol are briefly discussed.\par
AODV is a reactive routing protocol that does not require maintenance of routes to destination nodes that are not in active communication. Instead, it allows mobile nodes to quickly obtain routes to new destination nodes. Every mobile node maintains a routing table that stores the next hop node information for a route to the destination node. When a source node wishes to route a packet to a destination node, it uses the specified route if a fresh enough route to the destination node is available in its routing table. If such a route is not available in its cache, the node initiates a route discovery process by broadcasting a RouteRequest (RREQ) message to its neighbors. On receiving a RREQ message, the intermediate nodes update their routing tables for a reverse route to the source node. All the receiving nodes that do not have a route to the destination node broadcast the RREQ packet to their neighbors. Intermediate nodes increment the hop count before forwarding the RREQ. A RouteReply (RREP) message is sent back to the source node when the RREQ query reaches either the destination node itself or any other intermediate node that has a current route to the destination. As the RREP propagates to the source node, the forward route to the destination is updated by the intermediate nodes receiving a RREP. The RREP message is a unicast message to the source node.\par
AODV uses sequence numbers to determine the freshness of routing information and to guarantee loop-free routes. In case of multiple routes, a nodeselects the route with the highest sequence number. If multiple routes have the same sequence number, then the node chooses the route with the shortest hop count. Timers are used to keep the route entries fresh.\par
When a link break occurs, RouteError (RERR) packets are propagated along the reverse path to the source invalidating all broken entries in the routing table of the intermediate nodes. AODV also uses periodic hello messages to maintain the connectivity of neighboring nodes. Since AODV has no security mechanisms, malicious nodes can perform many attacks just by not behaving according to the AODV rules. A malicious node M can carry out many attacks against AODV. This paper provides routing security to the AODV routing protocol by eliminating the threat of 'Black Hole' attacks. 
\section[{Global Journal of Researches in Engineering}]{Global Journal of Researches in Engineering}\par
IV. 
\section[{BLACK HOLE ATTACK}]{BLACK HOLE ATTACK}\par
In black hole attack [17], all network traffics are redirected to a specific node, which does not exist at all. Because traffics disappear into the special node as the matter disappears into Black hole in universe. So the specific node is named as Black hole. A black hole has two properties. First, the node exploits the ad hoc routing protocol, such as AODV, to advertise itself as having a valid route to a destination node, even though the route is spurious, with the intention of intercepting packets. Second, the node consumes the intercepted packets. Black hole attacks in AODV protocol routing level can be classified into two categories --RREQ Blackhole attack and RREP Blackhole attack. a) Black hole attack caused by RREQ An attacker can send fake RREQ messages to form black hole attack  {\ref [17]}. In RREQ Blackhole attack, the attacker pretends to rebroadcast a RREQ message with a non-existent nodes will update their route to pass by the non destination node. The Fig. \hyperref[fig_2]{3} shows the effect to measured for the AODV protocol when the node increased. The result shows both the cases, with the blackhole and without the blackhole attack. It is measured that the packet delivery ratio is dramatically decreases nodes in the network. For example, the packet when there is no effect of Blackhole attack and moving at the speed 50 m/s. but due to effect of the Blackhole the packet delivery ratio  From the figure \hyperref[fig_4]{5} it can be observed that, there is slight increase in the average end-to-end delay without the effect of blackhole, as compared to the effect of blackhole attack, This is due to the immediate reply from the malicious node i.e. the nature of malicious node here is it would not check its routing table. It is observed from the figure 6 that, avg. jitter between the nodes is more without the blackhole attack, as compared to the Avg jitter between the nodes with the effect of blackhole attack. This is due to the malicious nodes provides the path with fewer number of nodes, or smaller path. Thus average jitter between the nodes is reduces. \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}VolumeF}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{12}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Fig. 1 :Fig. 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Fig. 3 :F}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4}\includegraphics[]{image-5.png}
\caption{\label{fig_3}Fig. 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5}\includegraphics[]{image-6.png}
\caption{\label{fig_4}Fig. 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{6}\includegraphics[]{image-7.png}
\caption{\label{fig_5}Fig. 6 :F}\end{figure}
 			\footnote{© 2012 Global Journals Inc. (US)} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Jakobsson et al. ()]{b12}\label{b12} 	 		‘A micropayment scheme encouraging collaboration in multihop cellular networks’.  		 			M Jakobsson 		,  		 			J Hubaux 		,  		 			L Buttyan 		.  	 	 		\textit{Proceedings of Financial Crypto},  				 (Financial Crypto)  		2003.  	 
\bibitem[Hongsong et al.]{b15}\label{b15} 	 		\textit{A novel security agent scheme for AODV routing protocol based on thread state transition},  		 			Chen Hongsong 		,  		 			Ji Zhenzhou 		,  		 			Hu Mingzeng 		.  		p. 150001.  		 			Department of Computer Science and Technology Harbin Institute of Technology 		 	 
\bibitem[Sanzgiri et al. (2002)]{b5}\label{b5} 	 		‘A secure routing protocol for ad References Références Referencias F hoc networks’.  		 			K Sanzgiri 		,  		 			B Dahill 		,  		 			B Levine 		,  		 			C Shields 		,  		 			E Belding-Royer 		.  	 	 		\textit{International Conference on Network Protocols (ICNP)},  				 (Paris, France)  		Nov 2002.  	 
\bibitem[Hu et al. (2002)]{b3}\label{b3} 	 		‘Ariadne: A secure on -demand routing protocol for ad hoc networks’.  		 			Y Hu 		,  		 			A Perrig 		,  		 			D Johnson 		.  	 	 		\textit{Proceedings of the 8 th International Conference on Mobile Computing and Networking},  				 (the 8 th International Conference on Mobile Computing and NetworkingAtlanta, GA)  		Mobicm 2002. Sept 2002. ACM. p. .  	 
\bibitem[Marti et al. ()]{b9}\label{b9} 	 		‘Mitigating routing misbehavior in mobile ad hoc networks’.  		 			S Marti 		,  		 			T Giuli 		,  		 			K Lai 		,  		 			M Baker 		.  	 	 		\textit{Proceedings of MOBICOM 2000},  				 (MOBICOM 2000)  		2000. p. .  	 
\bibitem[Bansal and Baker ()]{b13}\label{b13} 	 		\textit{OCEAN: Observationbased cooperation enforcement in ad hoc networks},  		 			S Bansal 		,  		 			M Baker 		.  		2003.  		 			Stanford University 		 	 	 (Technical Report) 
\bibitem[Buchegger and Boudec (2002)]{b10}\label{b10} 	 		‘Performance analysis of the ONFIDANT protocol: Cooperation Of Nodes -Fairness In Dynamic Ad hoc NeTworks’.  		 			S Buchegger 		,  		 			J Boudec 		.  	 	 		\textit{Proceedings of IEEE/ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHOC)},  				 (IEEE/ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHOC)Lausanne, CH)  		Jun 2002.  	 
\bibitem[Kong et al. ()]{b6}\label{b6} 	 		‘Providing robust and ubiquitous security support for m obile ad hoc networks’.  		 			J Kong 		,  		 			P Zerfos 		,  		 			H Luo 		,  		 			S Lu 		,  		 			L Zhang 		.  	 	 		\textit{Innternational Conference on Network Protocols (ICNP)},  				2001. p. .  	 
\bibitem[Deng and Li (2002)]{b2}\label{b2} 	 		‘Routing security in wireless ad hoc networks’.  		 			H Deng 		,  		 			H Li 		,  		 			D 		.  	 	 		\textit{IEEE Communications Magazine}  		Oct 2002. 40  (10) .  	 
\bibitem[Cooper et al. ()]{b1}\label{b1} 	 		‘Searching for blackhole faults in a network using multiple agents’.  		 			C Cooper 		,  		 			R Klasing 		,  		 			T Radzik 		.  	 	 		\textit{Proc. 10th Int. Conf. on Principles of Distributed Systems (OPODIS 2006)},  				 (10th Int. Conf. on Principles of Distributed Systems (OPODIS 2006))  		2006. p. .  	 
\bibitem[Papadimitratos and Haas (2002)]{b4}\label{b4} 	 		‘Secure routing for mobile ad hoc networks’.  		 			P Papadimitratos 		,  		 			Z Haas 		.  	 	 		\textit{SCS Communications Networks and Distributed Systems Modeling and Simulation Conference (CNDS 2002)},  				 (San Antonio, TX)  		Jan 2002.  	 
\bibitem[Ki et al. (2001)]{b14}\label{b14} 	 		‘Security aware ad hoc routing for wireless networks’.  		 			S Ki 		,  		 			P Naldurg 		,  		 			R Kravets 		.  	 	 		\textit{Proceedings of the 2nd ACM Symposium on Mobile Ad Hoc Networking and Computing},  				 (the 2nd ACM Symposium on Mobile Ad Hoc Networking and ComputingLong Beach, California)  		October 2001. Poster Session. p. .  	 
\bibitem[Chess ()]{b0}\label{b0} 	 		‘Security issues in mobile code systems’.  		 			D M Chess 		.  	 	 		\textit{Proc. Conf. on Mobile Agent Security},  				 (Conf. on Mobile Agent Security)  		1998. p. .  	 	 (LNCS 1419) 
\bibitem[Buchegger and Boudec (2003)]{b11}\label{b11} 	 		‘The effect of rumor spreading in reputation systems for mobile ad hoc networks’.  		 			S Buchegger 		,  		 			J Boudec 		.  	 	 		\textit{WiOpt '03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks},  				Mar 2003.  	 
\bibitem[Hubaux et al. ()]{b7}\label{b7} 	 		‘The quest for security in mobile ad hoc networks’.  		 			J Hubaux 		,  		 			L Buttyan 		,  		 			S Capkun 		.  	 	 		\textit{Proceedings of the ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHOC)},  				 (the ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHOC))  		2001.  	 
\bibitem[Stajano and Anderson ()]{b8}\label{b8} 	 		‘The resurrecting duckling’.  		 			F Stajano 		,  		 			R Anderson 		.  	 	 		Lecture Notes in Computer Science  		1999. Springer-Verlag.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
