\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={Qos Routing Protocols and Privacy 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{2012-05-15 (revised: 15 May 2012)}
\def\TheID{\makeatother }
\def\TheDate{2012-05-15}
\title{Qos Routing Protocols and Privacy 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]{Dr. phani  praveen}

             \author[2]{B. Sukumar  Babu}

\renewcommand\Authands{ and }

\date{\small \em Received: 14 April 2012 Accepted: 30 April 2012 Published: 15 May 2012}

\maketitle


\begin{abstract}
        


 Full network level privacy has often been categorized into four sub-categories: Identity, Route,  Location and Data privacy. Achieving full network level privacy is a challenging problem due to the conditions  imposed by the sensor nodes (e.g., energy, memory and computation power), sensor networks (e.g., mobility  and topology) and QoS issues (e.g., packet reach-ability and timeliness). This proposed paper consists of two  algorithms IRL algorithm and data privacy mechanism that  addresses this problem. The proposed system  provides additional trustworthiness, less computation power, less storage space and more reliability. Also, we  proved that our proposed solutions provide protection against various privacy disclosure attacks, such as  eavesdropping and hop-by-hop trace back attacks. 

\end{abstract}


\keywords{Anonymity; eavesdropping; hop-by-hop trace back; privacy; routing; wireless sensor networks}

\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& 	 	 		 \par
n order to present the adversary from back-tracing, the route, location and data privacy mechanism must be enforced. With the spreading application of Wireless Sensor Networks (WSNs) in various sensitive areas such as health-care, military, habitat monitoring, etc. Network level privacy often been categorized into 4 categories: 1) Sender node identity privacy: no intermediate node can get any information about who is sending the packets except the source, its immediate neighbors and the destination. 2) Sender node location privacy: no intermediate node can have any information about the location (in terms of physical distance or number of hops) about the sender node except the source, its immediate neighbors and the destination. 3) Route privacy: no node can predict the information about the complete path (from source to destination). Also, a mobile adversary gets no clue to trace back the source node either from the contents and/or directional information of the captured packet(s). 4) Data packet privacy: no node can see the information inside in a payload of the data packet except the source and the destination.\par
An energy-efficient privacy solution is needed to address these patterns in Wireless Sensor Network. Advanced features in cryptographic system were introduced in this paper are:\par
? A new Identity, Route and Location (IRL) privacy algorithm is proposed that ensures the source, identity and location. This algorithm allows the packets to destination only through trusted intermediate nodes.\par
? The extension of our proposed IRL algorithm is a new reliable Identity, Route and Location (r-IRL) privacy algorithm. This algorithm has the ability to forward packets from multiple secure paths to increase the packet reach-ability. ? A data privacy mechanism is used to unique in the sense that it provides secure data and packet authentication. 
\section[{Network and Assumptions Model}]{Network and Assumptions Model}\par
A wireless sensor network (WSN) is composed of large number of small sensor nodes that are of limited resource and densely deployed in an environment. This sensor node uses IEEE 802.11 standard link layer protocol, which keeps packets in its cache until the sender receives an acknowledgment (ACK). The sender node will retransmit the packet, if the ACK does not receive within threshold.  
\section[{F ebruary a) Concepts And Definitions}]{F ebruary a) Concepts And Definitions}\par
The proposed algorithms use two notions: Direction and Trust. These notions are used to provide reliable secure paths for achieving robust route privacy. Direction helps to forward packet to the destination in a timely manner and trust will help to forward the packets via reliable nodes.\par
Direction : The first notion used in our algorithms is that of direction. The physical location of the base station is the reference point for each sensor node. Based on this reference point, each node classifies its neighboring nodes into four categories: (1) forward neighboring nodes (F), (2) right side backward neighboring nodes (Br), (3) left side backward neighboring nodes (B l ), and (4) middle backward neighboring nodes (B m ). The objective of this categorization is to provide more path diversity as discussed in Section 4.2. A node x classifies its neighboring node y in following fashion:\par
where ? is the angle between the node x and its neighboring node y with respect to the line joining node x and the base station as shown in Figure \hyperref[fig_1]{2}. The second notion used in our algorithms is that of trust. The definition of a trust here is based on our other paper and restated here. A node can be classified into one of the three categories: trustworthy, untrustworthy, and uncertain. A node is considered trustworthy if it interacts successfully most of the time with the other nodes. A node is considered untrustworthy if it tries to do as many unsuccessful interactions as possible with the other nodes. An untrustworthy node could be a faulty or malicious node. A node is considered uncertain if it performs both successful and unsuccessful interactions. Detailed definition if the successful and unsuccessful interactions and trust calculation methodology is available in our paper and provided here in a simplified form.\par
A sender will consider an interaction successful if the sender receives confirmation that the packet is successfully received by the neighbor node and forwarded towards the destination in an unaltered fashion. The first requirement of successful reception is achieved on the reception of the link layer acknowledgment (ACK). The second requirement of forwarding towards the destination is achieved with the help of enhanced passive acknowledgment (PACK) by overhearing the transmission of a next hop on the route, since they are within the radio range. If the sender node does not overhear the retransmission of the packet within a threshold time from its neighboring node or if the overheard packet is found to be illegally fabricated (by comparing the payload that is attached to the packet), then the sender node will consider that interaction as unsuccessful.\par
With this simple approach, several attacks can be prevented, i.e., the black hole attack is straightforwardly detected when malicious node drops the incoming packets and keeps sending self-generated packets .Similarly, sink hole attack, an advanced version of the black hole attack, is also easily detectable by looking at the passive acknowledgment. Likewise, the selective forwarding attack and gray-hole attack  {\ref [27]} can also be eliminated with the aid of above mentioned approach. Based on these successful and unsuccessful interactions node x can calculate the trust value of node y in following fashion: where [.] is the nearest integer function, S x,y is the total number of successful interactions of node x with y during time ?t, and U x,y is the total number of unsuccessful interactions of node x with y during time ?t. After calculating trust value, a node will quantize trust into three states as follows:\par
where, f represents half of the average values of all trustworthy nodes and g represents one-third of he average values of all untrustworthy nodes. Both f and g are calculated as follows:\par
The steady-state operation, these values can change with every passing unit of time which creates dynamic trust boundaries. After each passage of time, ?t, nodes will recalculate the values of f and g. This trust calculation procedure will continue in this fashion.\par
The time window length (?t) could be made shorter or longer based on the network analysis scenarios. If ?t is too short, then the calculated trust value may not reflect the reliable behavior. On the other hand, if it is too long, then it will consume too much memory to store the interaction record at the sensor node. Therefore, various parameters can be used to adjust the length of ?t. Whenever a node needs to forward a packet, the routing phase for source node and for intermediate node) of IRL algorithm is called.\par
Whenever a source node wants to forwards the packet, it will first check the availability of the trusted neighboring nodes in its forward direction setM(tF ). If trusted nodes exists then it will randomly select one node as a next hop from the setM(tF ) and forward the packet towards it .If there is no trusted node in its forward direction, then the source node will check the availability of a trusted node in the right (M(tBr )) and left (M(tBl)) backward sets. If the trusted nodes are available then the source node will randomly select one node as a next hop from these sets and forward the packet towards it.If the trusted node does not exist in these sets either, then the source node will randomly select one trusted node from the backward middle set (M(tBm)) and forward the packet towards it.If there are no trusted nodes available in all of the sets then the packet will be dropped .\par
When an intermediate node receives the packet (either from the source node or from another en-route node), it will first check whether the packet is new or old.If it is new, then the node will first check the availability of the trusted node from the forward direction set (MF ) excluding the prevhop node if it belongs to forward set.If trusted nodes exists in the forward set then the node will randomly select any one trusted node as a next hop and forward the packet towards it. If there is no trusted node available in the forward direction, then it will check to which set the sender of the packet belongs to. For example, If the packet, forwarded by a node, belongs to the right backward set, then it will first check whether the left or middle backward sets contain any trusted nodes. If so, it will randomly select one node from those sets and forward the packet towards it. If there is no trusted node in those two sets, then the node will randomly select a trusted node from the right backward set (M(tBr )) excluding the one from which the node received the current packet and forward the packet towards it.Similar operations will be performed, if the packet, forwarded by a node, belongs to the left and middle backward or forward sets. An example IRL routing scenario is shown in Figure \hyperref[fig_3]{3}. This routing strategy may result in the creation of a cycle (loop). However, due to the randomness in the selection of the next-hop and the presence of the different four direction sets, the probability of creation of any cycle is very low. Nevertheless, in order to fully avoid the occurrence of the cycles, each node (prior to forwarding of a packet) will save the signature of the packet in the buffer for the ?t time,that is: where D is the distance between the forwarding node and the base station, d is the distance between the forwarding node and the next hop, and pt is the propagation transfer time between the forwarding node and the next hop. This signature consists of two fields:\par
(1) sequence number of the packet, and (2) the payload. The potential of the signature to compare and identify the same packet is detailed in the later section. Corresponding to this signature, three more fields are also stored in the buffer:\par
1) previous hop identity, 2) next hop identity where the packet is forwarded, and 3) counter, that tells how many times the same packet is received by the node. This information will later be used to get rid of any cycle. The size of the buffer is mainly dependent on the network traffic conditions. However, it is expected to be low due because the sensor nodes sent data either in periodic intervals or upon the occurrence of some event. If the node received the packet whose signature exists in the buffer, then including the previous hop node , two other nodes will also be excluded from the selection of the next hop process: 1) the node from which last time the packet was received the node from which last time the packet was forwarded. If the same packet is received three times by the same node then the packet will be dropped. Three sample scenarios of the loop creation, detection and prevention are shown in Figure \hyperref[fig_4]{4}. Creation of loops and traversing of the packets in the backward direction is not a completely negative effect. Rather, it provides positive effects in terms of strengthening the route and source location privacy, because these effects will helps to increase the safety period, which is the time for an adversary to reach at the source node.\par
Identity Privacy: Whenever a node receives the packet p from the source node or en-route node then the receiving node will replace the previous hop's identity prevhop contained in the packet with its own.After that, the node will get the next forwarding node nexthop and update the header of the packet p = \{prevhop, nexthop, payload\}. After modification of the two header fields, the node will forward the packet.In this way, all the intermediate forwarding nodes replace the source and next hop's identity contained in the packet p. This process will go on until the packet reaches the base station.\par
Location Privacy: The neighboring nodes which are in each other's radio range can easily approximate the location of each other by measuring the received signal strength and the angle of arrival.If the adversary is within the range of the source node, then adversary can easily estimate the location of the source. Once the packet has crossed the radio range of the original source node, then becomes very difficult for an attacker to estimate the location of the node either in terms of the physical distance or in terms of the number of hops of an original source node. The main reason for this is that the path selection is random and packets are forwarded by only trusted nodes which only contain the information of the last and the next hop. 
\section[{c) Reliable Identity, Route, And Location Privacy (R-IRL)}]{c) Reliable Identity, Route, And Location Privacy (R-IRL)}\par
It is also possible that some applications require more reliability in terms of packet reach-ability; and the packet could be dropped due to either network congestion or malicious behavior of an en-route node. Thus, in order to achieve more reliability, the packet should be forwarded from multiple paths simultaneously, which will give trustworthiness in the sense that at least the packet should reach the base station by any one of the paths, although, this may increase some communication overhead. Our reliable IRL (r-IRL) algorithm is the extended version of our proposed IRL algorithm, in which we introduce one more parameter, reliability r. The source node i will multicast a packet to all r randomly selected neighboring trusted nodes that are in the forward direction. If there are no adequate trusted nodes present in the forward direction, then it will select the remaining trusted nodes from the backward direction. The rest of the mechanism of the r-IRL algorithm is the same as the IRL algorithm. 
\section[{d) Data Privacy}]{d) Data Privacy}\par
The payload contains the identity of the source node (IDx) and the actual data (d). Identity is encrypted with the public key (k+bs) of the base station and data is encrypted with the secret key (kx,bs)shared between the sender node and the BS. Both are appended with the payload as shown below:payload = [E(IDx, k+ bs),E(d, kx,bs)]\par
If we assume that the adversary knows the range of identities assigned to the sensor nodes, public key of the base station and information about cipher algorithm used in the network, an adversary can then successfully obtain the identity of the source by performing simple brute-force search attack by comparing the pattern of encrypted identity with a known range of identities. Therefore in order to provide protection against brute-force search attack, we append a random number (Rn) (equivalent to the size of identity) with the identity of a node and then perform encryption. Now the payload is:payload = [E(IDx||Rn, k+bs),E(d, kx,bs)]\par
where || is the append operation. Inclusion of random number may introduce additional computational overhead. However, the amount of overhead is mainly dependent on random number generation technique. Recently, very nice random generation techniques have been specially designed for low power sensor networks, such as. These techniques could be used to generate random number for each packet. Also, overall computational overhead is dependent on the number of packets generated by the sensor nodes.\par
Our proposed data privacy approach provides several benefits. Firstly, data secrecy is achieved in the presence of identity anonymity. This feature is not available in earlier proposed privacy schemes. Secondly, the base station will receive both the identity of the actual source node and message authentication. If the packet has been successfully decrypted with the shared secret key, it means that packet is received from genuine sensor node.  
\section[{Global Journal of Computer Science and Technology Volume XII Issue IV Version I}]{Global Journal of Computer Science and Technology Volume XII Issue IV Version I} 
\section[{Table 4. Simulation parameters}]{Table 4. Simulation parameters}\par
The proposed paper has implemented our IRL and r-IRL routing schemes on Sensor Network Simulator and Emulator (SENSE).At the application layer we used constant bit rate component (CBR) that generate constant traffic during simulation between randomly selected source node(s) and the base station. For the simplicity, assume that both sensor nodes and the base station are static. Network consists of 300 sensor nodes that are organized into 15 by 20 grid manner.\par
Comparison of proposed IRL and r-IRL algorithms with the four variations of phantom routing schemes that are: 1. Phantom single path routing scheme with hopbased approach (PSR-hop). 2. Phantom single path routing scheme with sectorbased approach (PSR-sec). 3. Phantom flood routing scheme with hop-based approach (PFR-hop). 4. Phantom flood routing scheme with sector-based approach (PFR-sec). The energy consumption analysis with different scenarios are shown in Figure \hyperref[fig_6]{6}. For the r-IRL scheme we select r = 3, which means a single packet will reach the destination via three different routes simultaneously. For phantom routing schemes, we select parameter hwalk=10 (as recommended. Figure \hyperref[fig_6]{6} clearly indicates that, the IRL and r-IRL schemes consume less energy as compared to the PSR-sec, PFR-hop and PFR-sec schemes but slightly consume higher energy as compared to the PSR-hop scheme. This is due to the fact that the IRL and r-IRL algorithms provides more path diversity and packets sometimes took longer paths.\par
Our In order to analyze the path diversity behavior, assume 300 sensor nodes in a 10 by 30 grid manner. In the simulation, a single source node (ID: 224) generates 100 data packets for the base station. Figure shows the path diversity (in terms of path length) of the IRL, PSR-hop and PSR-sec schemes.\par
The average path taken by the PSR-hop, IRL and PSR-sec is 22.12, 36.81 and 38.17, respectively. It indicates that the IRL scheme incurs more delay as compared with the PSR-hop scheme and less delay as compared with the PSR-sec scheme. This figure also indicates that the IRL scheme has more path variation as compared with the other schemes, which creates more difficulties for the adversary to trace back the source from the captured packets.\par
Figure  {\ref 7} also shows that some packets took longer paths in the IRL scheme as compared with others. This is due to the fact that the source or en-route node did not find any trusted node in its forward direction, so the packet is relayed back in the backward direction.\par
Figure \hyperref[fig_8]{8} shows the result of 100 simulation runs in each node has equal probability to be trusted and untrusted. It shows that, as the neighborhood size increases, the probability of the packet to move in the backward direction decreases sharply. Existing privacy schemes of WSNs only provides partial network level privacy. Providing full network level privacy is a critical and challenging issue due to the constraints imposed by the sensor nodes (e.g.,energy, memory and computation power), sensor network (e.g., mobility and topology) and QoS issues (e.g., packet reach ability and timeliness). Therefore, in this paper we proposed the first full network level privacy solution that is composed of two new identity, route and location privacy algorithms and data privacy mechanism.\par
Our solutions provide additional trustworthiness and reliability at modest cost of energy and memory. Future work, will evaluate proposed schemes from the perspective of computation cost that is required to perform encryption and random number generation. \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Figure 1 .}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Figure 2 .}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{fig_2}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-5.png}
\caption{\label{fig_3}Figure 3 .}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4}\includegraphics[]{image-6.png}
\caption{\label{fig_4}Figure 4 .}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-7.png}
\caption{\label{fig_5}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{6}\includegraphics[]{image-8.png}
\caption{\label{fig_6}Figure 6 .}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{107}\includegraphics[]{image-9.png}
\caption{\label{fig_7}10 Figure 7 .}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{8}\includegraphics[]{image-10.png}
\caption{\label{fig_8}Figure 8 .}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-11.png}
\caption{\label{fig_9}}\end{figure}
 			\footnote{© 2012 Global Journals Inc. (US) Global Journal of Computer Science and Technology Volume XII Issue IV Version I} 			\footnote{© 2012 Global Journals Inc. (US)} 			\footnote{© 2012 Global Journals Inc. (US) F ebruary} 		 		\backmatter  			 
\subsection[{This page is intentionally left blank}]{This page is intentionally left blank}			 			  				\begin{bibitemlist}{1}
\bibitem[Armenia et al. ()]{b10}\label{b10} 	 		‘Analysis of Location Privacy /Energy Efficiency Tradeoffs in Wireless Sensor Networks’.  		 			S Armenia 		,  		 			G Morabito 		,  		 			S Palazzo 		.  	 	 		\textit{IFIP-Networking},  				2007.  	 
\bibitem[Zorzi and Rao ()]{b3}\label{b3} 	 		‘Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Perfor-mance’.  		 			M Zorzi 		,  		 			R R Rao 		.  	 	 		\textit{IEEE Tran. Mob. Comput}  		2003.  	 
\bibitem[Blum et al.]{b4}\label{b4} 	 		\textit{IGF: A State-Free Robust Comm-unication Protocol for Wireless Sensor Networks},  		 			B Blum 		,  		 			T He 		,  		 			S Son 		,  		 			J Stankovic 		.  		 CS-2003-11.  		 	 	 (Technical Report) 
\bibitem[Barbeau et al. ()]{b5}\label{b5} 	 		‘Improving Distance Based Geographic Location Techniques in Sensor Networks’.  		 			M Barbeau 		,  		 			E Kranakis 		,  		 			D Krizanc 		,  		 			P Morin 		.  	 	 		\textit{Proceedings of 3rd International Conference on Ad Hoc Networks and Wireless},  				 (3rd International Conference on Ad Hoc Networks and WirelessVancouver, British Columbia)  		2004.  	 
\bibitem[Barbeau et al. ()]{b7}\label{b7} 	 		‘Improving Distance Based Geographic Location Techniques in Sensor Networks’.  		 			M Barbeau 		,  		 			E Kranakis 		,  		 			D; Krizanc 		,  		 			P Morin 		.  	 	 		\textit{Proceedings of 3rd International Conference on Ad Hoc Networks and Wireless},  				 (3rd International Conference on Ad Hoc Networks and WirelessVancouver, British Columbia)  		2004.  	 
\bibitem[Ryu et al. ()]{b6}\label{b6} 	 		\textit{Method and System for Locating Sensor Node in Sensor Network Using Transmit Power Control},  		 			J Ryu 		,  		 			S G Kim 		,  		 			H H Choi 		,  		 			S S An 		,  		 			S Y Ahn 		,  		 			B J Kim 		.  		2009/0128298 A1. U.S.  	 
\bibitem[Xi et al.]{b1}\label{b1} 	 		‘Preserving Source Location Privacy in Monitoring-Based Wireless Sensor Networks’.  		 			Y Xi 		,  		 			L Schwiebert 		,  		 			W Shi 		.  	 	 		\textit{Proceedings of Parallel and Distributed Processing Symposium (IPDPS2006)},  				 (Parallel and Distributed Processing Symposium (IPDPS2006)Rhodes Island, Greece)  		 	 
\bibitem[Gaubatz et al. ()]{b8}\label{b8} 	 		‘Public Key Cryptography in Sensor Networks-Revisited’.  		 			G Gaubatz 		,  		 			J.-P Kaps 		,  		 			B Sunar 		.  	 	 		\textit{Lect. Note. Comput. Sci}  		2006. 3313 p. .  	 
\bibitem[Capone et al.]{b2}\label{b2} 	 		‘SiFT: An Efficient Method for Trajectory Based Forwarding’.  		 			A Capone 		,  		 			L Pizziniaco 		,  		 			I Filippini 		,  		 			M G De La Fuente 		.  	 	 		\textit{Proceedings of International Symposium on Wireless Communication Systems},  				 (International Symposium on Wireless Communication SystemsSiena, Italy)  		 	 
\bibitem[Ozturk et al. ()]{b0}\label{b0} 	 		‘Source-Location Privacy in Energy-Constrained Sensor Network Routing’.  		 			C Ozturk 		,  		 			Y Zhang 		,  		 			W Trappe 		.  	 	 		\textit{Proceedings of the 2nd ACM workshop on Security of Ad hoc and Sensor Networks},  				 (the 2nd ACM workshop on Security of Ad hoc and Sensor NetworksWashington, DC, WA, USA)  		2004. p. .  	 
\bibitem[Lopez ()]{b9}\label{b9} 	 		‘Unleashing Public-Key Cryptography inWireless Sensor Networks’.  		 			J Lopez 		.  	 	 		\textit{J. Comput. Security}  		2006.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
