\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={Energy Efficient Elliptical Curve based Spherical Grid Routing Protocol for 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{2016-01-15 (revised: 15 January 2016)}
\def\TheID{\makeatother }
\def\TheDate{2016-01-15}
\title{Energy Efficient Elliptical Curve based Spherical Grid Routing Protocol for 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]{Jai Prakash  Prasad}

             \affil[1]{  Visvesvaraya Technological University}

\renewcommand\Authands{ and }

\date{\small \em Received: 8 December 2015 Accepted: 4 January 2016 Published: 15 January 2016}

\maketitle


\begin{abstract}
        


The Wireless Sensor Network (WSN) is a collection of no. of mobile nodes which communicate through wireless channel without any existing network infrastructure. Because the resource constrained nature of WSN a data packet routing requires multiple hops to exchange data across the network. In order to facilitate communication within the network, a secure energy efficient routing protocol is used to discover routes between nodes. The proposed energy efficient elliptical curve based spherical grid routing protocol for WSN provides correct and efficient route establishment between a pair of nodes so that data packets can be delivered in time to the destination. Secure route construction can be done with optimized WSN performance matrices such as packet delivery ratio, throughput, minimum energy consumptions, communication overheads & end to end delay. This proposed algorithm evaluates Spherical grid routing protocols for wireless sensor networks protocol while varying no. of nodes and pause time and results are compared with few existing routing protocols using network simulator.

\end{abstract}


\keywords{wireless sensor network, spherical GRID routing, energy efficient, packet delivery ratio, throughput. multi-tier spherical GRID, elliptical curve cryp}

\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[{I. INTRODUCTION}]{I. INTRODUCTION}\par
ireless Sensor Network consists of no. of sensor nodes where nodes are deployed in a region to monitor its environment. Each sensor nodes consists of Microcontroller, internal \& external memory, antennas, sensor and batteries as its main components to perform a specific task. Each sensor node senses its input attributes process the raw data \& converts it into digital data format and then forward the data through chain of network using optimized routing scheme till the data reaches to its correct destination.\par
When the data is travelling through optimized routing path then there are chances of data packet to compromise from its authenticity, confidentiality, and integrity before it reaches to the destination. Therefore to overcome such threats which may exist in WSN depending on its application, there is requirement of strong cryptographic technique to counter. Wireless sensor nodes resources have its own constrained in terms of limited computational speed \& battery backup. There exist plenty of energy efficient secure \& routing algorithms such as LEACH, PEGASIS, TEEN, APTEEN, GBDD, TTDD, DES, AES, RSA, DSA, Elgamal encryption etc has achieved appreciable popularity for improved performance efficiency. However all the existing protocol has its own limitations and their drawbacks which has been studied \& analyzed in detail for further research improvement \& development in the field of wireless sensor networks.\par
Wireless Data Communication poses some kind of threats due to its open environment communication.\par
To avoid compromise of data security it is required to maintain the authenticity, confidentiality and integrity of data. The elliptical curve cryptosystem provide speedy security mechanism compare to other type of public key cryptosystem and used in constrained environment conditions. Elliptical Curve Cryptography provides advantage of smaller key size that result in to faster computations, lower power consumption with savings of memory and bandwidth that makes ECC a fast, flexible, low cost security algorithm suitable for constrained environment.\par
Wireless Sensor Network can be deployed for Tele communication connectivity between various regions of all over the world. The modeling and placement of Wireless sensor nodes across various parts of world region for the coverage of whole world forms a cluster of networks which appears into spherical shape as shown in figure-1. The WSN find applications in,  
\section[{WSN SECURITY \& ROUTING: A REVIEW}]{WSN SECURITY \& ROUTING: A REVIEW}\par
In cryptography the plaintext message content before it is sent out over the infrastructure network is encrypted, which becomes the cipher-text. At the destination side in order to read the plaintext, the ciphertext has to be decrypted. The application of wireless sensor network is wide spreading. The WSN are having limited power source, which required an ultimate power efficient routing and security protocol. There are several asymmetric cryptography schemes that are used to provide the security services. The Elliptic Curve Cryptography (ECC) performance is better for low power implementation applications.\par
To ensure the communication network function correctly and safely, there are mainly four security requirements of WSN i.e. Authenticity, Integrity, Confidentiality, Availability.\par
In Wireless communication routing path is set up by establishing in either of three ways namely reactive, proactive and hybrid. Reactive protocols decide the routing path when they are ready with information to transmit. Proactive protocols calculate all the routes in advance and maintain the records in a routing table of each sensor node. If there is change in the route, the changes is updated throughout the network and due to this region proactive protocol are not suitable for WSN. Hybrid protocols join the idea of proactive and reactive protocols. Some of the routing protocols are discussed below.\par
Hierarchical protocols: Such protocols are suitable for higher scalability. Hierarchical protocols functions in two tier, first tier is used to decide about cluster-heads and the other tier is used for data routing. This protocol is more energy efficient and improves network scalability, lifetime and quality of service.\par
Location based Protocols: This protocol used nodes location information to decide the closeness among two or more nodes to estimate the energy consumptions. Two methods are used to determine the sensor node location, first one which calculates the coordinates of the neighbouring node and second one uses the global positioning system.\par
Ad-hoc on demand distance vector (AODV) Protocol: AODV is the energy efficient and shortest path routing algorithm widely being used for wireless network. It uses methods of path discovery and maintenance. AODV form routes between sensor nodes only when they are needed. 
\section[{III. ELLIPTICAL CURVE CRYPTOGRAPHY}]{III. ELLIPTICAL CURVE CRYPTOGRAPHY}\par
Elliptical Curve Cryptography (ECC) is suited for WSN applications. The benefit of this technique is that they uses smaller size key which need less storage, less bandwidth and less energy, thereby reducing processing and communication overhead, which is ideal for energy-constrained sensor nodes. An elliptic curve is the points in the x-y plane that satisfy an algebraic equation y \hyperref[b1]{2}    
\section[{Spherical Coordinates:}]{Spherical Coordinates:}\par
In the spherical coordinate system, as shown in figure  {\ref 5} a point P(x, y, z) whose Cartesian coordinates are (x, y, z), is described by an ordered triple (?, ?, ?), where ? > 0, 0? ? ? 2?, 0? ? ? ? are defined as follows.\par
? ? = dist(P, O) ? ? is defined as the angle from zx-plane, counterclockwise, to the half-plane originating from z-axis and containing P. ? ? = angle from positive z -axis to vector ???? ?????? 
\section[{: Spherical Cartesian System}]{: Spherical Cartesian System}\par
Note that when P is on z -axis, ? = 0, and ? increases from 0 to  The coordinate system formation of the spherical grids is shown in figure  {\ref 6}.6 : A Spherical Grid V. 
\section[{ELLIPTICAL CURVE BASED MULTI-TIER SPHERICAL GRID ROUTING (ECMSGR): A PROPOSED METHOD}]{ELLIPTICAL CURVE BASED MULTI-TIER SPHERICAL GRID ROUTING (ECMSGR): A PROPOSED METHOD}\par
The several sensor nodes are uniformly distributed across a field to form wireless sensor network for the secure routing of data packet between source and destination. Each sensor node senses its input attribute and before its send the data packet to its neighbor node it forms a routing path in spherical grid fashion with proper coordination among no. of sensor nodes. For the uniform utilization of sensor nodes, each sensor node is checked for remains energy level and no. of times used for path formation by the neighbouring sensor node as shown in figure  {\ref .} In WSN multi-tier spherical grid routing path formation between two or more sensor node is calculated by determining previous and next sensor node angular position such that path formation will be in spherical fashion between starting node and destination node as shown in figure  {\ref 7}. Source as indication in figure  {\ref 7} is sensed by a sensor node near to it. The sensed node now decides about choosing second next node with required angle and second node select third node such that the routing path formation between source and destination takes spherical shape. The red dot represent one tier spherical grid and blue dot represent second tier and so on routing path formation takes place.\par
The required angular position between nodes formation is shown in figure  {\ref 8}. The elliptical curve based multi-tier formation of spherical grid routing to cover very large area with effective \& optimized utilization of sensor node is represented by figure  {\ref 9}.  
\section[{VI. RESULTS \& DISCUSSIONS}]{VI. RESULTS \& DISCUSSIONS}\par
The Proposed protocol ECMSGR is compared with LEACH and GRID protocol in network simulator 2 environment to evaluate the performance metric such packet delivery ratio, throughput, communication overhead, end-end delay and power consumption. The table I represent simulation parameter set up for NS2.  A large area is covered by a large number of sensor nodes which communicate with each other through short-range radios. Long-range data delivery is achieved by forwarding data across multiple hops. Each sensor is aware of its own location. However, mobile sinks may or may not know their own locations. When a stimulus appears, the sensors surrounding it collectively process the signal and one of them becomes the source to generate data reports. Sinks (users) query the network to collect sensing data. There can be multiple sinks moving around in the sensor field and the number of sinks may vary over time as shown in figure \hyperref[fig_0]{11}.  
\section[{Conclusion}]{Conclusion}\par
The proposed method ECMSGR provides a novel and an approach towards improvising potential WSN performance specially in terms of packet delivery ratio, throughput, communication overhead, end-end delay and power consumption. The network route formation as well as data transmission and its security are a major concern in the field of wireless sensor network. The ECMSGR protocol implementation and its performance compare to other related protocol is designed and analyzed to overcome some of the limitations of existing protocol using network simulator-2. The experimentation scenario and results shows that ECMSGR outperforms GBDD \& M-LEACH. The ECMSGR protocol complexity increases when the network scalability increases at very large scale in the application of providing smart \& secure gobal communication for data as well as voice communication to end users. ECC offer advantages of higher speeds, lower power consumption, and code size reductions. This concludes that ECC is best suited for wireless applications which demands speed, time and bandwidth. The results shows that optimal key generation time, encryption time and throughput using simulation. In this paper ECMSGR protocol gives an idea for researcher to explore further possible performance efficiency enhancement to offer better quality of services to provide communication coverage across globe.\begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Fig. 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{23}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Fig. 2 :Fig. 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Fig. 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{222}\includegraphics[]{image-5.png}
\caption{\label{fig_3}?? 2 as 2 2 ,E}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-6.png}
\caption{\label{fig_4}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{78}\includegraphics[]{image-7.png}
\caption{\label{fig_5}Fig. 7 :Fig. 8 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{10}\includegraphics[]{image-8.png}
\caption{\label{fig_6}Fig. . 10 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1113}\includegraphics[]{image-9.png}
\caption{\label{fig_7}Fig. 11 :Fig. 13 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{I} \par 
\begin{longtable}{P{0.5252640845070422\textwidth}P{0.3247359154929577\textwidth}}
Simulation Parameters\tabcellsep Value\\
Channel type\tabcellsep Wireless Channel\\
Radio-propagation model\tabcellsep Propagation/Two Ray Ground\\
Network interface type\tabcellsep Phy /WirelessPhy\\
MAC type\tabcellsep Mac/802\textunderscore 11\\
Interface queue type\tabcellsep Queue/DropTail /PriQueue\\
Link layer type\tabcellsep LL\\
Antenna model\tabcellsep Antenna/Omni Antenna\\
Max packet in IFQ\tabcellsep 50\\
Number of mobile nodes\tabcellsep 16/25/36/49/98/196\\
Routing protocol\tabcellsep AODV/DSR/DSDV\\
\multicolumn{2}{l}{X dimension of topography 4000}\\
\multicolumn{2}{l}{Y dimension of topography 4000}\\
Time of simulation end\tabcellsep 20/40/60/80/100\\
Initial energy in Joules\tabcellsep 100\\
Network Type\tabcellsep Mobile\\
Connection Pattern\tabcellsep Random\\
Packet Size\tabcellsep 512 bytes\\
Connection type\tabcellsep CBR/UDP/TCP\end{longtable} \par
 
\caption{\label{tab_1}Table I :}\end{figure}
 			\footnote{© 2016 Global Journals Inc. (US)} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Chiang et al.]{b11}\label{b11} 	 		\textit{A Cycle-Based Data Aggregation Scheme for Grid-Based Wireless Sensor Networks},  		 			Yung-Kuei Chiang 		,  		 			Neng-Chung Wang 		,  		 			Chih-Hung Hsieh 		.  		 	 
\bibitem[Vigila and Muneeswaran ()]{b14}\label{b14} 	 		‘A new elliptic curve cryptosystem for securing sensitive data applications’.  		 			Smc Vigila 		,  		 			K Muneeswaran 		.  	 	 		\textit{International Journal of Electronic Security and Digital Forensics}  		2013. 5  (1)  p. .  	 
\bibitem[Ye et al. (2002)]{b4}\label{b4} 	 		‘A two-tier data dissemination model for large-scale wireless sensor networks’.  		 			F Ye 		,  		 			H Luo 		,  		 			J Cheng 		,  		 			S Lu 		,  		 			L Zhang 		.  	 	 		\textit{MobiCom'02: Proceedings of the 8th Annual International Conference on Mobile Computing and Networking},  				 (Atlanta, USA)  		September 2002. ACM. p. .  	 
\bibitem[Manjeshwar (2002)]{b3}\label{b3} 	 		‘APTEEN: a hybrid protocol for efficient routing and comprehensive information retrieval in wireless sensor networks’.  		 			A Manjeshwar 		,  		 			DP 		.  	 	 		\textit{Proceedings of the 2 nd International Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile computing},  				 (the 2 nd International Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile computing)  		April 2002. p. .  	 
\bibitem[Jamal et al. (2009)]{b8}\label{b8} 	 		\textit{Data Aggregation and Routing in Wireless Sensor Networks: Optimal And Heuristic Algorithms},  		 			N Jamal 		,  		 			Ahmed E Al-Karaki Raza Ul-Mustafa 		,  		 			Kamal 		.  		13 May 2009. 53.  	 	 (Pages 945-960) 
\bibitem[Hoffstein et al. ()]{b13}\label{b13} 	 		\textit{Elliptic curves and cryptography. An Introduction to Mathematical Cryptography},  		 			J Hoffstein 		,  		 			J C Pipher 		,  		 			J H Silverman 		.  		2014. New York: Springer. p. .  	 
\bibitem[Heinzelman et al. (2000)]{b0}\label{b0} 	 		‘Energy efficient communication protocol for wireless micro sensor networks’.  		 			W R Heinzelman 		,  		 			A Chandrakasan 		,  		 			H Balakrishnan 		.  	 	 		\textit{Proceedings of the 33rd Annual Hawaii International Conference on System Sciences (HICSS)},  				 (the 33rd Annual Hawaii International Conference on System Sciences (HICSS))  		January 2000. p. .  	 
\bibitem[Sharma et al. ()]{b7}\label{b7} 	 		‘GBDD: Grid Based Data Dissemination in Wireless Sensor Networks’.  		 			T P Sharma 		,  		 			R C Joshi 		,  		 			Manoj Misra 		.  	 	 		\textit{Proc. 16th International Conference on Advanced Computing and Communications (ADCOM 2008)},  				 (16th International Conference on Advanced Computing and Communications (ADCOM 2008)Chennai, India)  		2008. p. .  	 
\bibitem[Wang et al.]{b10}\label{b10} 	 		‘Grid-Based Data Aggregation for Wireless Sensor Networks’.  		 			Neng-Chung Wang 		,  		 			Yung-Kuei Chiang 		,  		 			Chih-Hung Hsieh 		,  		 			Young-Long Chen 		.  	 	 		\textit{Journal of Advances in Computer Networks}  		1.  	 
\bibitem[Younis and Fahmy (2004)]{b5}\label{b5} 	 		‘HEED: A hybrid, Energy-efficient, Distributed Clustering Approach for Ad-hoc Networks’.  		 			Ossama Younis 		,  		 			Sonia Fahmy 		.  	 	 		\textit{IEEE Transactions on Mobile Computing},  				Oct-Dec 2004. 3 p. .  	 
\bibitem[Drago? et al. ()]{b9}\label{b9} 	 		‘Increasing lifetime in grid wireless sensor networks through routing algorithm and data aggregation techniques’.  		 			I Drago? 		,  		 			S?c?leanu 		,  		 			M Drago? 		,  		 			Rodica Ofrim 		,  		 			Vasile Stoian 		,  		 			L?z?rescu 		.  	 	 		\textit{International Journal Of Communications}  		2011. 4.  	 
\bibitem[Lindsey and Raghavendra ()]{b2}\label{b2} 	 		‘PEGASIS: Power-efficient gathering in sensor information systems’.  		 			S Lindsey 		,  		 			C S Raghavendra 		.  	 	 		\textit{Proceedings of the IEEE Aerospace},  				 (the IEEE Aerospace)  		2002. 3 p. .  	 
\bibitem[References Références Referencias Sensors ()]{b12}\label{b12} 	 		 \xref{http://dx.doi.org/10.3390/s140508447}{10.3390/s140508447}.  		\textit{References Références Referencias Sensors},  				2014. 14 p. .  	 
\bibitem[Manjeshwar (2001)]{b1}\label{b1} 	 		‘TEEN: a protocol for enhanced efficiency in wireless sensor networks’.  		 			A Manjeshwar 		,  		 			DP 		.  	 	 		\textit{Proceedings of the 1st International Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile Computing},  				 (the 1st International Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile ComputingSan Francisco, CA)  		April 2001.  	 
\bibitem[Swami ()]{b6}\label{b6} 	 		\textit{Wireless Sensor Networks: Signal Processing and Communication Perspectives},  		 			Ananthram Swami 		.  		2007. John Wiley.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
