\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={Wireless Sensor Network Security Model for D2P Attacks Using Zero Knowledge Protocol},
 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-01-15 (revised: 15 January 2012)}
\def\TheID{\makeatother }
\def\TheDate{2012-01-15}
\title{Wireless Sensor Network Security Model for D2P Attacks Using Zero Knowledge Protocol}
\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. Mukesh  Kansari}

             \author[2]{Mrs.Shikha  Pandey}

             \affil[1]{  Rungta College of Engineering and Technology, Bhilai (C.G.), India.}

\renewcommand\Authands{ and }

\date{\small \em Received: 8 December 2011 Accepted: 1 January 2012 Published: 15 January 2012}

\maketitle


\begin{abstract}
        


Wireless sensor networks (WSNs) are innovative large-scale wireless networks that consist of distributed, lowpower, small-size devices using sensors to cooperatively collect information through infrastructure less ad-hoc wireless network. These small devices used in wireless sensor nodes are called sensor nodes. They are envisioned to play an important role in a wide variety of areas ranging from critical military surveillance applications to forest fire monitoring and building security monitoring in the near future. In these networks, a large number of sensor nodes are deployed to monitor a vast field, where the operational conditions are most often harsh or even hostile. Since these networks are usually deployed in remote places and left unattended, they should be equipped with security mechanisms to defend against attacks such as node capture, physical tampering, eavesdropping, denial of service, etc. Unfortunately, traditional security mechanisms with high overhead are not feasible for resource constrained sensor nodes.

\end{abstract}


\keywords{sensor nodes, threats, wsn, attacks, security.}

\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
Wireless Sensor Network is a special type of network that consist of distributed, low-power, small-size devices using sensors to cooperatively collect information through infrastructure less ad-hoc wireless network  {\ref [1]}. They are envisioned to play an important role in a wide variety of areas ranging from critical military surveillance applications to building security monitoring in the near future \hyperref[b1]{[2]}. It shares some commonalities with a typical computer network, but also exhibits many characteristics which are unique to it. The security services in a Wireless Sensor Network should protect the information communicated over the network and the resources from attacks and misbehavior of nodes. The most important security requirements in Wireless Sensor Network are listed below:\par
Data confidentiality: The security mechanism should ensure that no message in the network is understood by anyone except intended recipient. A sensor node should not allow its readings to be accessed by its neighbors unless they are authorized to do so.\par
Data integrity: The mechanism should ensure that no message can be altered by an entity as it traverses from the sender to the recipient.\par
Data freshness: It implies that the data is recent and ensures that no adversary can replay old messages. This requirement is especially important when the WSN nodes use shared keys for message communication, where a potential adversary can launch a replay attack using the old key as the new key is being refreshed and propagated to all the nodes in the WSN.\par
Self-organization: Each node in a WSN should be self organizing and self-healing. The dynamic nature of a WSN makes it sometimes impossible to deploy any preinstalled shared key mechanism among the nodes and the base station \hyperref[b2]{[3]}.\par
Secure localization: In many situations, it becomes necessary to accurately and automatically locate each sensor node in a WSN. For example, a WSN designed to locate faults would require accurate locations of sensor nodes identifying the faults. A potential adversary can easily manipulate and provide false location information by reporting false signal strength, replaying messages etc. if the location information is not secured properly. Authentication: It ensures that the communicating node is the one that it claims to be. An adversary can not only modify data packets but also can change a packet stream by injecting fabricated packets. It is, therefore, essential for a receiver to have a mechanism to verify that the received packets have indeed come from the actual sender node. 
\section[{II.}]{II.} 
\section[{Charesterstics \& applications of wsns}]{Charesterstics \& applications of wsns}\par
There  
\section[{Security attacks in wsn}]{Security attacks in wsn}\par
Wireless Sensor Networks are vulnerable to various types of attacks. These attacks are mainly of three types (denial of service attack, distributed attack and phishing attack.), Attacks on secrecy and authentication: standard cryptographic techniques can protect the secrecy and authenticity of communication channels from outsider attacks such as eavesdropping, packet replay attacks. Attacks on network availability: attacks on availability of WSN are often referred to as denial-of-service (DoS) attacks. Stealthy attack against service integrity: in a stealthy attack, the goal of the attacker is to make the network accept a false data value. In these attacks, keeping the sensor network available for its intended use is essential. The DoS attack usually refers to an adversary's attempt to disrupt, subvert, or destroy a network. However, a DoS attack can be any event that diminishes or eliminates a network's capacity to perform its expected functions.\par
IV. 
\section[{Dos attacks}]{Dos attacks}\par
Wood and Stankovic have defined a DoS attack as an event that diminishes or attempts to reduce a network's capacity to perform its expected function. Some of the important types of DoS attacks in Wireless Sensor Networks are discussed below. 
\section[{a) Physical Layer Attacks}]{a) Physical Layer Attacks}\par
The physical layer is responsible for frequency selection, modulation, and data encryption \hyperref[b3]{[4]}. As with any radio-based medium, the possibility of jamming is there. In addition, nodes in Wireless Sensor Networks may be deployed in hostile or insecure environments where an attacker has the physical access. Two types of attacks in physical layer are (i) jamming and (ii) tampering. 
\section[{b) Link Layer Attacks}]{b) Link Layer Attacks}\par
The link layer is responsible for multiplexing of data streams, data frame detection, medium access control, and error control \hyperref[b3]{[4]}. Attacks at this layer include purposefully created collisions, resource exhaustion, and unfairness in allocation. 
\section[{c) Network Layer Attacks}]{c) Network Layer Attacks}\par
The network layer of Wireless Sensor Networks is vulnerable to the different types of attacks such as: spoofed routing information, selective packet forwarding, sinkhole, Sybil, wormhole, hello flood etc. 
\section[{i. Spoofed routing information}]{i. Spoofed routing information}\par
The most direct attack against a routing protocol is to target the routing information in the network. An attacker may spoof, alter, or replay routing information to disrupt traffic in the network \hyperref[b4]{[5]}.\par
ii. Selective forwarding Thn a multi-hop network like a Wireless Sensor Network, for message communication all the nodes need to forward messages accurately. An attacker may compromise a node in such a way that it selectively forwards some messages and drops others \hyperref[b4]{[5]}. 
\section[{iii. Sinkhole}]{iii. Sinkhole}\par
In this attack, a malicious node acts as a blackhole \hyperref[b5]{[6]} to attract all the traffic in the sensor network. Especially in a flooding based protocol, the attacker listens to requests for routes then replies to the target nodes that it contains the high quality or shortest path to the base station. Once the malicious device has been able to insert itself between the communicating nodes (for example, sink and sensor node), it is able to do anything with the packets passing between them. In fact, this attack can affect even the nodes those are considerably far from the base stations.  In many cases, the sensors in a wireless sensor network might need to work together to accomplish a task, hence they can use distribution of subtasks and redundancy of information. In such situation, a node can pretend to be more than one node using the identities of other legitimate nodes. This type of attack where a node forges the identities of more than one node is the Sybil attack \hyperref[b6]{[7]}. Sybil attack tries to degrade the integrity of data, security and resource utilization that the distributed algorithm attempts to achieve. Sybil attack can be performed for attacking the distributed storage, routing mechanism, data aggregation, voting, fair resource allocation and misbehavior detection \hyperref[b6]{[7]}. Basically, any peer-to-peer network (especially wireless ad hoc networks) is vulnerable to Sybil attack. However, as WSNs can have some sort of base stations or gateways, this attack could be prevented using efficient protocols. Douceur \hyperref[b7]{[8]} showed that, without a logically centralized authority, Sybil attacks are always possible except under extreme and unrealistic assumptions of resource parity  Wormhole attack \hyperref[b8]{[9]} is a critical attack in which the attacker records the packets at one location in the network and tunnels those to another location. The tunneling or retransmitting of bits could be done selectively. Wormhole attack is a significant threat to wireless sensor networks, because; this sort of attack does not require compromising a sensor in the network rather, it could be performed even at the initial phase when the sensors start to discover the neighboring information. When a node B broadcasts the routing request packet, the attacker receives this packet and replays it in its neighborhood. Each neighboring node receiving this replayed packet will consider itself to be in the range of Node B, and will mark this node as its parent. Hence, even if the victim nodes are multi-hop apart from B, attacker in this case convinces them that B is only a single hop away from them, thus creates a wormhole. 
\section[{vi. Hello flood}]{vi. Hello flood}\par
Most of the protocols that use Hello packets make the naive assumption that receiving such a packet implies that the sender is within the radio range of the receiver. An that receiving such a packet implies that the sender is within the radio range of the receiver. An attacker may use a high-powered transmitter to fool a large number of nodes and make them believe that they are within its neighborhood \hyperref[b4]{[5]}. Subsequently, the attacker node falsely broadcasts a shorter route to the base station, and all the nodes which received the Hello packets, attempt to transmit to the attacker node. vii. Acknowledgment spoofing Some routing algorithms for Wireless Sensor Networks require transmission of acknowledgment packets. An attacking node may overhear packet transmissions from its neighboring nodes and spoof the acknowledgments thereby providing false information to the nodes \hyperref[b4]{[5]}. 
\section[{d) Transport layer attacks}]{d) Transport layer attacks}\par
The attacks that can be launched on the transport layer in a Wireless Sensor Network are flooding attack and de-synchronization attack. 
\section[{i. Flooding}]{i. Flooding}\par
Whenever a protocol is required to maintain state at either end of a connection, it becomes vulnerable to memory exhaustion through flooding. An attacker may repeatedly make new connection request until the resources required by each connection are exhausted or reach a maximum limit. In either case, further legitimate requests will be ignored.\par
ii. De-synchronization De-synchronization refers to the disruption of an existing connection. An attacker may, for example, repeatedly spoof messages to an end host causing the host to request the retransmission of missed frames. If timed correctly, an attacker may degrade or even prevent the ability of the end hosts to successfully exchange data causing them instead to waste energy attempting to recover from errors which never really exist. 
\section[{e) Attacks on secrecy and authentication}]{e) Attacks on secrecy and authentication}\par
There are different types of attacks under this category as discussed below: i. Node replication attack In a node replication attack, an attacker attempts to add a node to an existing WSN by replication the node identifier of an already existing node in the network. A node replicated and joined in the network in this manner can potentially cause severe disruption in message communication in the Wireless Sensor Network by corrupting and forwarding the packets in wrong routes.\par
ii. Attacks on privacy Since Wireless Sensor Networks are capable of automatic data collection through efficient and strategic deployment of sensors, these networks are also vulnerable to potential abuse of these vast data sources. Privacy preservation of sensitive data in a Wireless Sensor Network is particularly difficult challenge \hyperref[b9]{[10]}. Moreover, an adversary may gather seemingly innocuous data to derive sensitive information if he knows how to aggregate data collected from multiple sensor nodes. Following are some of the common attacks on sensor data privacy \hyperref[b9]{[10]}.\par
iii. Eavesdropping and passive monitoring This is most common and easiest form of attack on data privacy. If the messages are not protected by cryptographic mechanisms, the adversary could easily understand the contents. Packets containing control information in a WSN convey more information than accessible through the location server, Eavesdropping on these messages prove more effective for an adversary. 
\section[{iv. Traffic analysis}]{iv. Traffic analysis}\par
In order to make an effective attack on privacy, eavesdropping should be combined with a traffic analysis. Through an effective analysis of traffic, an adversary can identify some sensor nodes with special roles and activities in a WSN. 
\section[{v. Camouflage}]{v. Camouflage}\par
An adversary may compromise a sensor node in a WSN and later on use that node to masquerade a normal node in the network. This camouflaged node then may advertise false routing information and attract packets from other nodes for further forwarding. After the packets start arriving at the compromised node, it starts forwarding them to strategic nodes where privacy analysis on the packets may be carried out systematically. 
\section[{V.}]{V.} 
\section[{Distributed attack}]{Distributed attack}\par
A distributed attacks occurs when multiple systems flood the bandwidth or resources of a targeted system, usually one or more web servers. Distributed attacks are traditionally viewed to be fundamentally more difficult to detect than single -source attacks. One reason why distributed attacks are dif ficult to contain is because defenses against these attacks are typically deployed at edge networks, near the victim. Deploying defenses at the edge makesdetecting attacks easier, VI. 
\section[{Phishing attack}]{Phishing attack}\par
In phishing attack the hacker creates a fake web site that looks exactly like a popular site such as the SBI bank or PayPal. The phishing part of the attack is that the hacker then sends an e-mail message trying to trick the user into clicking a link that leads to the fake site. When the user attempts to log on with their account information, the hacker records the username and password and then tries that information on the real site. 
\section[{VII.}]{VII.} 
\section[{Challenges}]{Challenges}\par
There are following challenges occurring in the wireless technology which are given in the following two categories-Challenges Vs Internet:  
\section[{Conclusion}]{Conclusion}\par
Wireless Sensor networks have become promising future to many applications. In the absence of enough security, deployment of sensor networks is vulnerable to variety of attacks. Overall security for wireless sensor networks is very hard to develop due to the limited resources of the sensors. Sensor network security will always be a field in which much work needs to be done. Current research in sensor network security is mostly built on a trusted environment  {\ref [11]}; however there are several research challenges remain unanswered before we can trust on sensor networks. In this paper we have discussed threat models and unique security issues faced by wireless sensor networks. In WSNs, there are still some challenges that are to be addressed. \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{fig_2}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-5.png}
\caption{\label{fig_3}Figure 2}\end{figure}
  		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Eschenauer and Gligor (2002)]{b2}\label{b2} 	 		‘A key-management scheme for distributed sensor networks’.  		 			L Eschenauer 		,  		 			V D Gligor 		.  	 	 		\textit{Proceedings of the 9th ACM Conference on Computer and Networking},  				 (the 9th ACM Conference on Computer and Networking)  		Nov 2002. p. .  	 
\bibitem[Akylidiz (2002)]{b0}\label{b0} 	 		‘A survey on Sensor Networks’.  		 			Weliain S U Akylidiz 		.  	 	 		\textit{IEEE Communication Magazine}  		august 2002.  	 
\bibitem[Peter Chen Arthur et al. (2005)]{b1}\label{b1} 	 		‘Energy-Efficient Data Aggregation Hierarchy for Wireless Sensor Networks’.  		 			Yuanzhu Peter Chen Arthur 		,  		 			L Liestman Jiangchuan 		,  		 			Liu 		.  	 	 		\textit{Proceedings of the 2nd Int'l Conf. on Quality of Service in Heterogeneous Wired/Wireless Networks},  				 (the 2nd Int'l Conf. on Quality of Service in Heterogeneous Wired/Wireless Networks)  		August 2005.  	 
\bibitem[Hu and Perrig (2003)]{b8}\label{b8} 	 		‘Packet leashes: a defense against wormhole attacks in wireless networks’.  		 			Y.-C Hu 		,  		 			A Perrig 		,  		 			Johnson 		,  		 			DB 		.  	 	 		\textit{Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE INFOCOM 2003},  				30 March-3 April 2003. 3 p. .  	 
\bibitem[Gruteser et al. ()]{b9}\label{b9} 	 		‘Privacy-aware location sensor networks’.  		 			G Gruteser 		,  		 			A Schelle 		,  		 			R Jain 		,  		 			D Han 		,  		 			Grunwald 		.  	 	 		\textit{Proceedings of the 9th USENIX Workshop on Hot Topics in Operating Systems, (HotOSIX)},  				 (the 9th USENIX Workshop on Hot Topics in Operating Systems, (HotOSIX))  		2003.  	 
\bibitem[Braginsky and Estrin ()]{b3}\label{b3} 	 		‘Rumor routing algorithm for sensor networks’.  		 			D Braginsky 		,  		 			D Estrin 		.  	 	 		\textit{Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications},  				 (the 1st ACM International Workshop on Wireless Sensor Networks and ApplicationsNew York, NY, USA)  		2002. ACM Press. p. .  	 
\bibitem[Karlof and Wagner (2003)]{b4}\label{b4} 	 		‘Secure routing in wireless sensor networks: Attacks and countermeasures’.  		 			C Karlof 		,  		 			D Wagner 		.  	 	 		\textit{Proceedings of the 1st IEEE International Workshop on Sensor Network Protocols and Applications},  				 (the 1st IEEE International Workshop on Sensor Network Protocols and Applications)  		May 2003. p. .  	 
\bibitem[Culpepper and Tseng ()]{b5}\label{b5} 	 		‘Sinkhole intrusion indicators in DSR MANETs’.  		 			B J Culpepper 		,  		 			H C Tseng 		.  	 	 		\textit{Proc. First International Conference on Broad band Networks},  				 (First International Conference on Broad band Networks)  		2004. p. .  	 
\bibitem[Douceur ()]{b7}\label{b7} 	 		‘The Sybil Attack’.  		 			J Douceur 		.  	 	 		\textit{1st International Workshop on Peer-to-Peer Systems},  				2002.  	 
\bibitem[Newsome et al. ()]{b6}\label{b6} 	 		‘The sybil attack in sensor networks: analysis \& defenses’.  		 			J Newsome 		,  		 			E Shi 		,  		 			D Song 		,  		 			A Perrig 		.  	 	 		\textit{Proc. of the third international Symposium on Information processing in sensor networks},  				 (of the third international Symposium on Information processing in sensor networks)  		2004. ACM. p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
