\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={Increase the Alive Nodes based on the Cluster Head Selection Algorithm for Heterogeneous 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{2013-01-15 (revised: 15 January 2013)}
\def\TheID{\makeatother }
\def\TheDate{2013-01-15}
\title{Increase the Alive Nodes based on the Cluster Head Selection Algorithm for Heterogeneous 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]{  A.Petchiammal}

             \author[2]{  A.Petchiammal}

             \affil[1]{  Manonmainam Sundaranar University, Tirunelveli, Indian}

\renewcommand\Authands{ and }

\date{\small \em Received: 16 December 2012 Accepted: 1 January 2013 Published: 15 January 2013}

\maketitle


\begin{abstract}
        


The use of Wireless Sensor Networks (WSNs) is estimated to bring enormous changes in data gathering, processing and distribution for different environments and applications. However, a WSN is a powerful controlled system, since nodes run on limited power batteries. Prolong the lifetime of sensor networks depends on efficient management of sensing node of energy. Hierarchical routing protocols are best known in regard to energy efficient. By using a clustering technique hierarchical routing protocol greatly minimize the energy consumed in collecting and distributing the data. The proposed protocol focuses on reducing the energy consumption and increasing the energy efficiency and also increasing the number of alive nodes of wireless sensor networks better than exiting protocol.

\end{abstract}


\keywords{wireless sensor network, LEACH protocol, new protocol, energy consumption, energy efficiency.}

\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
he Wireless Sensor Networks (WSN)  {\ref [1, 2, and3}] is a broadcast network consists of a large number of sensor nodes that are limited in energy, processing power, storage and sensing ability. The WSN based on routing techniques that handles more complex functions. The energy of nodes is the most important consideration among them because the lifetime of Wireless Sensor Networks is limited by the energy of the nodes. Thus, a network of these sensors gives increase to more robust, reliable and accurate network.\par
The WSN is used the two types of networks homogeneous and heterogeneous. The homogeneous mixture is a mixture where the components that make up the mixture are uniformly distributed throughout the mixture. The heterogeneous mixture is a mixture where the components of the mixture are not uniform or have localized regions with different properties, but heterogeneous networks are more efficient than the homogeneous network in WSN.\par
LEACH (Low-Energy Adaptive Clustering Hierarchy) \hyperref[b3]{[4]} is a clustering-based protocol and one of the first hierarchical routing approaches for sensor networks that utilizes the randomized rotation of local cluster base stations to evenly distribute the energy load Authors ? ? ? : Center for Information technology and Engineering Manonmaniam Sundaranar University Tirunelveli, Tamil Nadu, India. E-mails : divyame@gmail.com, petchiammalmtech17@gmail.com within the network of sensors. In LEACH, the cluster head (CH) nodes reduce the data arriving from nodes that belong to the particular cluster, and send an aggregated data to the base station in order to reduce the amount of information that must be transmitted to the base station. WSN is considered to be a dynamic clustering method. The dynamic is changing the network parameters.\par
We use the concept of heterogeneity and tried to improve the LEACH \hyperref[b4]{[5]} algorithm. In this approach, cluster head gets the data from nodes of the cluster and aggregate the data before sending it to the base station. In each round cluster head rotates and consumes the same energy, hence it utilizes the uniform energy distribution for the whole network. The LEACH protocol follows the concept of nodes homogeneity, which means that entire nodes have same initial energy. But practically it is visible that the network is not pure homogeneous. The heterogeneity, which means some of the nodes of the sensor network are equipped with additional initial energy, this type of sensor network is called heterogeneous wireless sensor network. This protocol of LEACH does not give good result so we have to provide some modification in the existing protocol.\par
LEACH is a cluster based routing protocol and one of the hierarchical based routing \hyperref[b5]{[6]} protocols. Hierarchical based routing is to efficiently maintain the energy consumption of sensor nodes and communication between a number of nodes within a particular time and by performing data aggregation and data fusion. Data fusion helps to reduce the amount of data transmitted between sensor nodes and the base station.\par
The new proposed protocol is an energy efficient communication protocol for WSN.\par
The communication takes place between all the cluster members and cluster heads. The cluster heads can perform data aggregation for communicating to the Base Station. The number of transmission is reduced from cluster to base station known as data aggregation. The new protocol can achieve energy efficiency, reduces energy consumption and increasing the number of a live nodes in every round than existing algorithms. 
\section[{Global Journal of Computer Science and Technology}]{Global Journal of Computer Science and Technology}\par
Volume XIII Issue IX Version I( D D D D D D D D )\par
The paper is organized as follows: Section II describes the assumptions used for the related work. In Section III describes the design of LEACH protocol and new proposed protocol in detail. The simulation result is discussed in Section IV. Finally conclusions made in Section V. 
\section[{II.}]{II.} 
\section[{Related Work}]{Related Work}\par
WSN involves so many clustering techniques such as LEACH \hyperref[b6]{[7,}\hyperref[b7]{8]}, EEAP \hyperref[b8]{[9]}, En-LEACH \hyperref[b9]{[10]}, EERR \hyperref[b10]{[11]}, EAPHRN \hyperref[b11]{[12]}, and I-LEACH \hyperref[b12]{[13]} for balancing the energy consumption, increase the energy efficiency and increase the lifetime of the sensor network. LEACH (Low Energy Adaptive Clustering Hierarchy) \hyperref[b6]{[7]} is one of the important clusters based structures, in wireless sensor networks. LEACH uses a TDMA technique based MAC protocol, and in order to maintain balanced energy consumption. TDMA (Time Division Multiple Access) is a more flexible scheme which comprises all technologies that allocate certain time slots for particular communication means that the receiver can stay at the same frequency the whole time. LEACH protocol is used to reduce the energy consumption of the network resource in each round.\par
LEACH protocols \hyperref[b7]{[8]} highly affect the performance of wireless sensor networks by an even distribution of energy load and decreasing their energy consumption and prolonging their lifetime. Thus, designing energy efficient protocols is important for prolonging the lifetime of wireless sensor networks. Leach-Heterogeneous System provides better energy efficiency and increasing the lifetime of the wireless sensor networks than homogeneous networks.\par
Energy-Efficient Adaptive Protocol for Clustered Wireless Sensor Networks (EEAP) \hyperref[b8]{[9]} is used to increase the lifetime of the sensor networks by balancing the energy consumption of the nodes. EEAP makes the high residual energy node to become a cluster-head. The elector nodes are used to collect the energy information of the neighbor sensor nodes and select the cluster-heads and increase the energy efficiency.\par
In En-LEACH \hyperref[b9]{[10]}, all cluster members are reserved informed about the cluster head, since the probability of breakdowns of cluster-head is high during the data transmission phase. En-LEACH is more effective; producing the information about the nodes are monitoring in an energy-efficient. En-LEACH is able to handle non-uniform energy distribution of sensor nodes which is an important characteristic of a dynamic sensor networks.\par
EERR (Energy Efficient and Reliable Routing protocol) \hyperref[b10]{[11]} is an extension of leach where the cluster head is called headset. The headset consist the number of nodes and each node will be acting like a cluster head in a particular time interval. Two types of phases. In the election phase the cluster head is selected on a random basis.CH node is an advertising message to all nodes in the network using a CSMA MAC protocol. Each node transmits a unite request message to the CH as an acknowledgment. Using this CH forms a headset. The headset is followed by TDMA schedule and transmits this schedule to the nodes in the cluster. In this data transfer phase, all the non-cluster head nodes will collect the information and transmit it into the headset. Then the headset transmits or sends it into the base station. The next new round all the nodes are taken as a normal node and the process will continue further.\par
EAPHRN (Energy aware PEGASIS based Hierarchical routing protocol) \hyperref[b11]{[12]} is a hierarchical chain based routing protocol. In EAPHRN, the nodes can select randomly forms a group of possible nodes but within the distance threshold DT. In EAPHRN divided into two phases. In the first phase chain set up, each node must be calculate the local DT (LDT). It is an average distance between the node and the neighboring node in the network. LDT threshold is computed, after that, the node sends to the BS. BS collects all the LDT from the number of nodes and calculated the DT. Then it sends the DT to the number of nodes in the WSN to start forming the chain. Finally, when the chain formed, choosing a chain leader is based on the leader is a closest node to the BS. Once chain leader received the data it aggregates and sends it in to BS.\par
I-LEACH (Improved LEACH) \hyperref[b12]{[13]} is enhanced from the leach protocol. I-leach solves the problem of node heterogeneity. In I-leach the selection of cluster head is based on the residual energy rather than probability. If the nodes have different initial energy levels instead of uniform initial energy level, they selection of cluster head can be prepared effectively. I-Leach each node will have a CH in their neighborhood. It improves the lifetime of the network. 
\section[{III.}]{III.} 
\section[{Protocol Performance a) LEACH Protocol}]{Protocol Performance a) LEACH Protocol}\par
Low-energy adaptive clustering hierarchy (LEACH) is one of the most popular hierarchical routing algorithms for wireless sensor networks. Is protocol architecture for micro sensor networks that combine the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and production cost.\par
Calculate the distance by using energy per bit ( ) divide energy per area ( ).\par
()\textbf{1}\par
Volume XIII Issue IX Version I With P is the cluster-head probability, r is the number of the round and G is the set of node. This algorithm ensures that every node becomes a clusterhead exactly once within rounds. Although the randomization of electing cluster head nodes can distribute the load among the network. Cluster heads have changed randomly over time in order to balance the energy dissipation of nodes. This decision is made by the nodes are choosing a randomly the values of each node between 0 and 1. If random < T (n), means the sensor node becomes the cluster-head, otherwise it is a cluster member. 
\section[{Minimum Distance}]{Minimum Distance}\par
Find the minimum distance for the election of an associated cluster head for by .\par
In LEACH we need to find the minimum distance in order to send data from the base station to cluster head.\par
(3) If the minimum distance greater than the initial energy \hyperref[b3]{(4)} In the Eq. (  {\ref 4})\par
is the initial energy of each node. The is the transmitted the energy. Length of packet sends the packet between the base stations to the cluster head.\par
Length of packet (pl) sends the packet between the base station to cluster head. \hyperref[b4]{(5)} Two types of transmitting amplifier, first one and second one . is the energy per bit and is the energy per area.\par
If the minimum distance less than the initial energy(6)\textbf{(7)}\par
b) New Protocol\par
The main aim of the new protocol is the hierarchical routing is to efficiently maintain the energy consumption and increasing the energy efficiency of sensor nodes by performing data aggregation and data fusion in order to decrease the number of transmitted between the cluster head and the base station. All sensor nodes are identical and charged with the same amount of initial energy. The new protocol can achieve energy efficiency, reduces energy consumption and increasing the number of alive nodes in each on every round than existing algorithms.\par
Protocol based dynamic clustering method. Dynamic routing allows routing is to change the possible routes. In case of wireless sensor networks dynamic routing is employed because nodes may frequently change their position and die at any moment. 
\section[{i. Cluster Head Selection Algorithm}]{i. Cluster Head Selection Algorithm}\par
In the Eq. ( \hyperref[formula_3]{8}), p is the percentage of cluster heads over all nodes in the network, i.e., the probability (0.05) that a node is selected as a cluster head; r the number of rounds of selection; and G is the set of nodes that are not selected in round 1/p. is the initial energy (0.5 J) divided by the number of nodes and multiply the X is the optimal cluster head number. As we can see here, the selection of cluster heads is totally random.\par
() (\textbf{8})\textbf{9}\par
Where X is the optimal cluster head number, n is the total number of sensor nodes, M (10) is the length of nodes distributing fields, (30) is the distance between the nodes and the Base Station. Fig. \hyperref[fig_2]{1} First select particular node, that node is known as cluster head and joining the number of nodes with cluster head. Number of individual nodes are connected is known as clustering. All clusters are having one cluster head which performs data collection and data fusion. Clustering is the method by which sensor nodes in a network organize themselves into hierarchical structures. Cluster head provides data communication and data aggregation also. It is the number of nodes that sends data to the sink directly after aggregating the data.  The minimum distance is called based on Eq. (  {\ref 3}) Minimum distance from cluster head: \hyperref[b9]{(10)} In the Eq. (  {\ref 4}) 
\section[{Global Journal of Computer}]{Global Journal of Computer}?? ð??"ð??"ð??"ð??" ?? ???? ?? ð??"ð??"ð??"ð??" ?? ???? ?? ?? = ?? ?? ? (?????? * (????)+ ?? ???? * ???? * (?? ?? 2 ) ?? 0 T (n) = ?? ?1??? * ?????? ???,?????????? ? 1 ?? ? ??? ? ? ?? 0 (?? * ??) ? ? X = ? ?? 2 * 22 7 * ?? 0 * ð??"ð??"?????? ? ?? ?? ??ð??"ð??" ? ?? ?? ??ð??"ð??"\par
is the initial energy of each node. The ETX is the transmit energy (5 ×   ). Two ) are the transmit energy and receive energy, In Eq.11 using the receive energy. Is the length of the packet (6400) are multiplied when the minimum distance greater than zero otherwise using is the length of control packet (200), the initial energy is divided by residual energy. They are using transmit the packet between cluster head to the base station.\par
In Eq. 12 using the receive energy ( ), the receive energy is 5 × and energy per area are multiplied when the minimum distance is greater than distance otherwise using the energy per bit for increase the number of alive nodes in each round.\par
()\textbf{12}\par
IV. 
\section[{Simulation Result}]{Simulation Result}\par
The performance of new protocol was analyzed using MATLAB. The number of rounds(r=10,000) is considered in X axis and the number of alive nodes (n=100) in Y axis.  Figure  {\ref 2} shows the energy efficiency of the LEACH algorithm. Rounds increases from 0 to 10,000. The number of alive nodes was calculated for each round in order to find the energy efficiency of the network. The existing algorithm increasing the number of alive is 20 percentages. Figure  {\ref 3} shows the energy efficiency of the new algorithm. Rounds increases from 0 to 10,000. The number of alive nodes was calculated for each round in order to find the energy efficiency of the networks. In the new protocol of heterogeneous system is number of alive nodes is increased near to 60\% than the leach heterogeneous system and lifetime of the networks also increased. From the comparative analysis of figure 4, we analyze that the number of alive nodes is increasing in newer protocol than LEACH protocol.  
\section[{Global}]{Global} 
\section[{Conclusion}]{Conclusion}\par
LEACH protocol is one of the routing protocols based on clustering algorithm to calculate the energy efficiency of the network. A new protocol was proposed based on existing LEACH protocol to save the energy of the network. Energy efficiency was analyzed by calculating the number of alive nodes in the network by considering the number of rounds. The performance analysis using MATLAB shows that the number of alive nodes is increasing in each round than exiting algorithm. Thus the new protocol is suitable to save the energy of the network, increasing the number of alive nodes and energy efficient. \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_1}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-3.png}
\caption{\label{fig_2}Figure 1 :}\end{figure}
     			\footnote{© 2013 Global Journals Inc. (US) Global Journal of Computer Science and Technology} 			\footnote{© 2013 Global Journals Inc. (US)} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Akkaya and Younis ()]{b2}\label{b2} 	 		‘A survey on routing protocols for wireless sensor networks’.  		 			K Akkaya 		,  		 			M Younis 		.  	 	 		\textit{Ad Hoc Networks}  		2005. 3  (3)  p. .  	 
\bibitem[Akyildiz et al. (2002)]{b0}\label{b0} 	 		‘A survey on sensor networks’.  		 			W Akyildiz 		,  		 			Y Su 		,  		 			E Sankarasubramaniam 		,  		 			Cayirci 		.  	 	 		\textit{IEEE Communications Magazine}  		August 2002. 40  (8)  p. .  	 
\bibitem[Heinzelman et al. ()]{b5}\label{b5} 	 		‘An application-specific protocol architecture for wireless microsensor networks’.  		 			W R Heinzelman 		,  		 			A P Chandrakasan 		,  		 			H Balakrishnan 		.  	 	 		\textit{IEEE Transactions on Wireless Communications}  		2002. 1  (4)  p. .  	 
\bibitem[Mr et al.]{b9}\label{b9} 	 		‘Design of Enhanced LEACH Routing Protocol for Wireless Sensor Network’.  		 			Mr 		,  		 			Halke Rajesh 1 		,  		 			Mrs 		,  		 			V A Kulkarni 		.  	 	 		\textit{IOSR Journal of Electronics and Communication Engineering}  		 2278-2834.  		p. .  		 			IOSR-JECE 		 	 
\bibitem[Al et al. ()]{b11}\label{b11} 	 		‘EAPHRN: Energy aware PEGASIS Based Hierarchical Routing protocol for wireless sensor networks’.  		 			Hasan Al 		,  		 			Mohammad Hasan 		,  		 			Azzam Qatawneh 		,  		 			Wesam Sleit 		,  		 			Almobaideen 		.  	 	 		\textit{Journal of American science}  		2011.  	 
\bibitem[Padmavathy and Chitra]{b10}\label{b10} 	 		\textit{EERR: Performance Evaluation of Energy Efficient and Reliable routing protocol for wireless sensor networks" Data management and network control in wireless networks (SICN)},  		 			T V Padmavathy 		,  		 			M Chitra 		.  		p. 2011.  	 
\bibitem[Padmanabhan et al. (2011)]{b8}\label{b8} 	 		‘Energy Efficient Adaptive Protocol for Clustered Wireless Sensor Networks’.  		 			K Padmanabhan 		,  		 			. P Dr 		,  		 			Kamalakkannan 		.  	 	 		\textit{IJCSI International Journal of Computer Science Issues}  		September 2011. 8  (1)  p. .  	 
\bibitem[Heinzelman et al. ()]{b4}\label{b4} 	 		‘Energy efficient Communication protocol for wireless Microsensor networks’.  		 			W R Heinzelman 		,  		 			A P Chandrakasan 		,  		 			H Balakrishnan 		.  	 	 		\textit{Proceedings of 33rd Hawaii International Conference on System Sciences (HICSS)},  				 (33rd Hawaii International Conference on System Sciences (HICSS))  		2000.  	 
\bibitem[Saravanakumar et al. (2011)]{b7}\label{b7} 	 		‘Energy Efficient Homogeneous and Heterogeneous System for Wireless Sensor Networks’.  		 			R Saravanakumar 		,  		 			S G Susila 		,  		 			J Raja 		.  	 	 		\textit{International Journal of Computer Applications}  		March 2011. 17  (4)  p. .  	 
\bibitem[Naveen Kumar and Kaur ()]{b12}\label{b12} 	 		\textit{Improved Leach Protocol for Wireless sensor Networks},  		 			Mrs Naveen Kumar 		,  		 			Kaur 		.  		2011. IEEE.  	 
\bibitem[Mortaza Fahimi Khaton Abad, Mohammad Ali Jabraeil Jamali (2011)]{b6}\label{b6} 	 		‘Modify LEACH Algorithm for Wireless Sensor Network’.  	 	 		\textit{IJCSI International Journal of Computer Science Issues}  		Mortaza Fahimi Khaton Abad, Mohammad Ali Jabraeil Jamali (ed.)  		September 2011. 8  (1) .  	 
\bibitem[Li and Zhang]{b3}\label{b3} 	 		‘Research and Improvement of LEACH Protocol for Wireless Sensor Network’.  		 			Baiping Li 		,  		 			Xiaoqin Zhang 		.  	 	 		\textit{International Conference on Information Engineering Lecture Notes in Information Technology}  		p. .  	 
\bibitem[Akyildiz et al. ()]{b1}\label{b1} 	 		‘Wireless sensor networks: a survey’.  		 			I F Akyildiz 		,  		 			W J Su 		,  		 			Y Sankarasubramaniam 		,  		 			E Cayirci 		.  	 	 		\textit{Computer Networks}  		2002. 38 p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
