\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={Sensor Data Encryption Protocol for Wireless Network Security},
 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{Sensor Data Encryption Protocol for Wireless Network Security}
\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. Bharat  Singh}

             \affil[1]{  Central University of Rajasthan.}

\renewcommand\Authands{ and }

\date{\small \em Received: 10 April 2012 Accepted: 3 May 2012 Published: 15 May 2012}

\maketitle


\begin{abstract}
        


Wireless Sensor Network consisting of a large number of sensor nodes that connected through wireless media has emerged as a ground breaking technology that offers unprecedented ability to monitor the physical word accurately. The privacy preservation is an important issue in wireless sensor network. Developing effective security solutions for wireless sensor networks are not easy due to limited resources. In this paper we propose new techniques for the purpose of security in wireless sensor network called as SDEP sensor data encryption protocol. In the scheme we use the RC 6 method for the purpose of encryption and decryption. RC 6 provide best confusion and diffusion properties with the less computational overhead. In order to confirm effectiveness of SDEP, a comparative performance evaluation with AES and RC 5 algorithms are presented in terms of memory requirement and execution time criteria. Our proposed scheme provides better performance than AES and RC 5 in the term of execution time and total memory requirement. We also provide simulation results for proposed method in the term of overhead and energy according to this result SDEP is strong block cipher for wireless sensor networks.

\end{abstract}


\keywords{SDEP, Security, RC 6 cryptography, AES}

\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 simple defined as a large collection of sensor nodes, equipped with its own sensor, processor and radio transceiver. A wireless sensor network has been widely used in different application areas to know the battlefield situation data, monitoring building parameters and reports about malfunction in a system.\par
The evolution leading to RC6 has provided a simple cipher yielding numerous evaluations and adequate security in a small package. After describing the structure of the algorithm, the prominent goal that stands out is simplicity. Through this simplicity, multiple evaluations have been performed, including AES-related evaluations, which will be discussed at a high level, due to complexity and number of articles. The fact that such a small, simple algorithm contended for AES with such high security requirements is noteworthy.\par
The main objective of our approach is to provide better performance than AES and RC 5 in the term of execution time and total memory requirement. We also provide simulation results for proposed method in the term of overhead and energy according to this result SDEP is strong block cipher for wireless sensor networks. In this new technique for the purpose of security in wireless sensor network called as SDEP sensor data encryption protocol. In the scheme we use the RC 6 method for the purpose of encryption and decryption. RC 6 provide best confusion and diffusion properties with the less computational overhead. In order to confirm effectiveness of SDEP, a comparative performance evaluation with AES and RC 5 algorithm are presented in terms of memory requirement and execution time criteria. Our proposed scheme provides better performance than AES and RC 5 in the term of execution time and total memory requirement. 
\section[{II.}]{II.} 
\section[{ATTACKS ON WIRELESS SENSOR NETWORK}]{ATTACKS ON WIRELESS SENSOR NETWORK}\par
Wormhole Attacks: In the wormhole attack an adversary builds a virtual tunnel through a low latency link that takes the messages from one part of the network and forwards them to another. The simplest case of this attack is when one node is located between two other nodes that are forwarding. However, wormhole attacks commonly involve two distant nodes that are colluded to underestimate the distance between them and forward packets through an external communication channel that is only available to the adversary.\par
Sinkhole Attacks: In a sinkhole attack, the adversary's goal is to lure nearly all the traffic from a particular area through a compromised node, creating a metaphorical sinkhole with the adversary at the center. Sinkhole attacks typically work by making a compromised node look especially attractive to surrounding nodes with respect to the routing algorithm. Effectively, the adversary creates a large "sphere of influence", attracting all traffic destined for a base stations from nodes several hops away from the compromised node.\par
Subversion of a Node: A particular sensor might be captured, and information stored on it (such as the key) might be obtained by an adversary. If a node has been compromised then how to exclude that node, and that node only, from the sensor network is at issue defines an efficient way to do so.\par
Physical Attacks: Sensor networks often operate in hostile environments. In those environments, the size of the nodes plus the unattended operation mode contributes to make them very vulnerable to physical attacks. In contrast to other types of attacks, physical attacks destroy the nodes permanently, thus, their loss is irreversible. For instance, an adversary could extract cryptographic keys, alter the node's circuitry, and reprogram it or replace it with malicious nodes.\par
Passive Information Gathering: An intruder with an appropriately powerful receiver and well designed antenna can easily pick off the data stream. Interception of the messages containing the physical locations of sensor nodes allows an attacker to locate the nodes and destroy them. Besides the locations of sensor nodes, an adversary can observe the application specific content of messages including message IDs, timestamps and other fields. To minimize the threats of passive information gathering, strong encryption techniques needs to be used.\par
False Node and Malicious Data: An intruder might add a node to the system that feeds false data or prevents the passage of true data. Such messages also consume the scarce energy resources of the nodes. This type of attack is called "sleep deprivation torture".\par
The Sybil Attack: In a Sybil Attack, a single node presents multiple identities to other nodes in the network. They pose a significant threat to geographic routing protocols, where location aware routing requires nodes to exchange coordinate information with their neighbors to efficiently route geographically addressed packets. Authentication and encryption techniques can prevent an outsider to launch a Sybil Attack on the sensor network.\par
Acknowledgement spoofing: Some routing algorithms require the use of acknowledgement signals (ACK). In this case, an adversary could spoof this signal in response to the packets that the adversary listens to. This results in convincing the transmitting node that a weak link is strong. Thus, an adversary could perform a selective forwarding attack after spoofing ACK signals to the node that the adversary intends to attack. Attacks to Data Aggregation Techniques Data aggregation in wireless sensor networks can significantly reduce communication overhead compared to all the nodes sending their data to the base station. However, data aggregation complicates even more network security. This is due to the fact that every intermediate node could potentially modify, forge, or discard messages. Therefore, a single compromised node could be able to alter the final aggregation value. Intruder node and compromised node attacks are two major threats to security in sensor networks that use data aggregation techniques. An easy way to comply with the conference paper formatting requirements is to use this document as a template and simply type your text into it. 
\section[{III.}]{III.} 
\section[{Key expansion algorithm}]{Key expansion algorithm}\par
The key expand algorithm is used to expand the user supplied key to fill the expanded array S, so that S resembles an array of t=(2*r+4) random binary words determine by user supplied key K. it is differ from RC5 version where more words are derived from user supplied key K. These drive words are star in array S which are uses later encryption or decryption. in our proposed method we simplify the key expansion terms of RC6.\par
In first step: key expansion is to copy the secret key K [0??.b-1] into array L[0???..c-1] this operation is done in natural manner, using u consecutive key bytes of K to fill up each successive word in L, in little endian order. The two magic constraints Pw and Q w define for arbitrary were follows:P w = Odd((e-2)2 w Q w =odd((Ø-1)2 w\par
These magic constant Pw and Q w are uses for arithmetic progression modulo 2 w which provide randomness in table S. 
\section[{In Second step:}]{In Second step:}\par
In this step of key expansion we initialize array S to a particular pseudorandom bit pattern using an arithmetical progression modulo  The third algorithm steps of key expansion are to mix in the user's secret key in three phrases over the array S and L. More precisely, due to the potentially different sizes of S and L, the larger array will be processed three times, and the other array may be handled more times. 
\section[{Mix the secret key into table, S I = j =}]{Mix the secret key into table, S I = j =}0 ; A = B = 0; V = 3 x max \{ c, 2r + 4 \} For s = 1 to v do \{ A = S [ i ] = S [ i ] + A + B) < < < 3 B = L [ j ] = ( L [ j ] + A + B ) < < < ( 3 + i ) J = ( j + 1 ) mod c \}\par
Key expansion function is an one way function so no one can determine secret key Encryption :\par
This is a second phase of proposed scheme it composed with three states: pre-whitening, an inner Global Journal of Computer Science and Technology Volume XII Issue IX Version I loop of rounds, and post-whitening. Pre-whitening and post-whitening remove the possibility of the plaintext revealing part of the input to the first round of encryption and the cipher text revealing part of the input to the last round of encryption.\par
We uses four W bit input register A, B, C, D registers B and D undergo pre-whitening the register B and D put through the quadratic equation and rotated (log 2 w) bits to the left respectively and these value store in variable t and u now register A XOR with t and left shift by u bits and added to round key S [ 2i ].\par
Similarly C is XOR with the value of u and left shift by t bits. Now it added to round key S [ 2 i + 1 ] for I = 1 to r do\{ T = ( B * ( 2 B + 1 ) ) < < < log 2 W U = ( D * 2 ( 2 D + 1 ) ) < < < log 2 W A = ( ( A XOR t ) < < < u + S [ 2i ] C = ( ( C XOR u ) < < < t ) + S [ 2i + 1 ] ( A, B, C, D ) = ( B, C, D, A ) \} IV. 
\section[{Results}]{Results}\par
In this paper we have proposed a new algorithm for the security purpose in wireless sensor network. We also perform evaluation this new approach by comparing with two alternative popular algorithm AES and RC5. We investigate performance of this new algorithm based on memory requirements and the bandwidth according to our result the bandwidth for SDEP is much less than AES and RC5. Memory requirement for both code and data is less than AES and nearly equal to RC5. According to these simulation results our new algorithm SDEP much better than RC5 and AES in term of memory requirement, bandwidth requirement and time delay. It is also very much energy efficient.\par
Sensor Network traffic An Experiment was performed with 15 sources and a simulation time 350s. The maximum packets transmission of the sensor nodes could be achieved in 50 s. the number of packet transfer at that time are 680 in SDEP and 600 in RC5 so the delay time for SDEP is less than RC5 Figure2 show the estimated maximum transmission network packet for the sensor node.\par
This paper proposed a new security scheme for wireless sensor network in which we use the concept of RC6 for encryption and decryption of sensor data. In first modification of RC6 in key expansion step is static number of rotation and in encryption method we perform some function parallel based on RC 5 concept so it increase the throughput of SDEP. In this paper we also compare our new algorithm with AES and RC5 which show that proposed scheme is best useful in end to end encryption in wireless sensor network.\begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}For i = 1}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{figure3}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{figure4}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-5.png}
\caption{\label{figure5}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-6.png}
\caption{\label{figure6}}\end{figure}
 			\footnote{© 2012 Global Journals Inc. (US) Global Journal of Computer Science and Technology Volume XII Issue IX Version I} 		 		\backmatter  			 \par
V. 
\subsection[{Conclusion}]{Conclusion}			 			  				\begin{bibitemlist}{1}
\bibitem[Pawan Kumar Goel and Sharma (2011)]{b8}\label{b8} 	 		\textit{},  		 			Vinit Kumar Pawan Kumar Goel 		,  		 			Sharma 		.  	 	 		\textit{International Journal of Science Technology \& Management , IJSTM}  		April 2011. 2  (2) .  	 
\bibitem[Hwang and Huh ()]{b10}\label{b10} 	 		‘An Efficient Topology Control and Dynamic Interval Scheduling Scheme for 6LoWPAN’.  		 			S M Hwang 		,  		 			E N Huh 		.  	 	 		\textit{ICCSA, Part I},  		LNCS  		 			Gervasi 		 (ed.)  		2009. 5592 p. .  	 
\bibitem[Ganesan et al. (2003)]{b7}\label{b7} 	 		\textit{Analyzing and Modeling Encryption Overhead for Sensor Network Nodes},  		 			P Ganesan 		,  		 			R Venugopalan 		,  		 			P Peddabachagari 		,  		 			A Dean 		,  		 			M Mueller 		,  		 			Sichitiu 		.  		September 19, 2003. San Diego, California,USA.  	 
\bibitem[Woo et al. ()]{b5}\label{b5} 	 		\textit{Implementation and Analysis of New Lightweight Cryptographic Algorithm Suitable for Wireless Sensor Networks},  		 			Koo Woo 		,  		 			K Lee 		,  		 			H 		,  		 			Kim Yong 		,  		 			H 		,  		 			Lee Dong 		,  		 			H 		.  		2008. p. .  	 	 (Information Security and Assurance, ISA) 
\bibitem[Zhu et al. ()]{b9}\label{b9} 	 		‘LEAP: Efficient Security Mechanisms for Large Scale Distributed Sensor Networks’.  		 			Sencun Zhu 		,  		 			Sanjeev Setia 		,  		 			Sushil Jajodia 		.  	 	 		\textit{The Proceedings of the 10th ACM Conference on Computer and Communications Security},  				2003.  	 
\bibitem[MobiDE'07 ()]{b4}\label{b4} 	 		\textit{MobiDE'07},  				 (Beijing, China)  		2007.  	 
\bibitem[Albath and Madria]{b3}\label{b3} 	 		\textit{Practical Algorithm for Data Security (PADS) in Wireless Sensor Networks},  		 			J Albath 		,  		 			S Madria 		.  		 	 
\bibitem[Kadri et al. ()]{b2}\label{b2} 	 		‘Secured Clustering Algorithm For Mobile Ad Hoc Networks’.  		 			B Kadri 		,  		 			A Mhamed 		,  		 			M Feham 		.  	 	 		\textit{International Journal of Computer Science and Network Security}  		2007. 7  (3)  p. .  	 
\bibitem[Anushiya A Kannan et al.]{b11}\label{b11} 	 		\textit{Simulated Annealing based Wireless Sensor Network Localization},  		 			Guoqiang Anushiya A Kannan 		,  		 			Branka Mao 		,  		 			Vucetic 		.  		 	 
\bibitem[Perrig et al. (2002)]{b6}\label{b6} 	 		‘SPINS: Security Protocols for Sensor Networks’.  		 			A Perrig 		,  		 			R Szewczyk 		,  		 			V Wen 		,  		 			D Culler 		,  		 			J D Tygar 		.  	 	 		\textit{Wireless Networks Journal (WINE)},  				September 2002.  	 
\bibitem[Rivest ()]{b0}\label{b0} 	 		‘The RC5 Encryption Algorithm’.  		 			R L Rivest 		.  	 	 		\textit{Proc. 1994 LeuvenWorkshop on Fast Software Encryption},  				 (1994 LeuvenWorkshop on Fast Software Encryption)  		1995. p. .  	 
\bibitem[Karlof et al. ()]{b1}\label{b1} 	 		‘Tinysec: a link layer security architecture for wireless sensor networks’.  		 			C Karlof 		,  		 			N Sastry 		,  		 			D Wagner 		.  	 	 		\textit{SenSys 04: Proceedings of the 2nd international conference on Embedded networked sensor systems},  				 (New York, NY, USA)  		2004. ACM Press. 175 p. 162.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
