\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={An ACO and Mobile Sink based Algorithm for Improvement of Ml-Mac for Wsns using Compressive Sensing},
 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{2018 2018-01-15 (revised: 33 Year 2018 15 January 2018)}
\def\TheID{\makeatother }
\def\TheDate{2018 2018-01-15}
\title{An ACO and Mobile Sink based Algorithm for Improvement of Ml-Mac for Wsns using Compressive Sensing}
\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]{Sandeep  Sharma}

             \author[2]{Neha  Sharma}

             \author[3]{Sandeep  Sharma}

\renewcommand\Authands{ and }

\date{\small \em Received: 12 December 2017 Accepted: 4 January 2018 Published: 15 January 2018}

\maketitle


\begin{abstract}
        


WSN is becoming key subject of research in computational basic principle because of its great deal of applications. ACO( Ant Colony Optimization) constructs the redirecting or routing tree via a method by which, for every single circular or round, Base Station (BS) chooses the root node in addition to shows the following substitute for every node. In order to prevail over the actual constraints with the sooner work a new increased method proposed in this research work. The proposed method has the capacity to prevail over the constraints of ACO routing protocol using the principle with reactivity, mobile sink and also the compressive sensing technique. In this paper we measure the main parameters that affect the wsn that are network lifetime, packets dropped, throughput, end to end delay and remaining energy for proposed algorithm and simulation results have shown that the proposed algorithm is highly effective.

\end{abstract}


\keywords{mobile sink; ACO; compressive sensing; MLMAC.}

\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 Networks (WSN) is an arrangement of hundreds or many small scale sensor hubs that have capacities of detecting, building up remote correspondence between each other and doing computational and preparing operations. Wireless sensor networks are used in many applications.Multi-layer Mac Protocol is an effective technique used in WSNs. It is designed with two main features: less active time and lesser collisions. Sensor hubs in ML-MAC have a very short active time which would lessen the vitality required to communicate with other nodes. Eventually, the number of collisions in cases where two or more nodes try to send at the same time is minimized in ML-MAC. This spares the vitality required to re-send the corrupted packets along these lines expanding system lifetime.ML-MAC demonstrate much better execution of the vitality utilization contrasted and the current MAC conventions. In this paper we further try to optimize the ML-MAC protocol by applying the techniques of Compressive sensing and ACO( Ant Colony Optimization). ACO: ACO calculation depends on the conduct of genuine ants. While moving a few ants discover food store pheromones while in transit to their homes, and alternate ants take after pheromones saved before by different ants. Over the long haul, pheromones dissipate, opening up new conceivable outcomes, and ants coordinate to pick a way with vigorously laid pheromones. Along these lines, ants meet to most optimum path from their home to a food deposits with just pheromone data \hyperref[b0]{[1]}. ACO depends on swarm intelligence. In swarm knowledge complex aggregate conduct rises up out of the conduct of numerous basic specialists. ACO has taking after qualities. The correspondences in the WSN have the many to-one property in that information from an extensive number of sensor hubs have a tendency to be amassed into a few sinks. Since multi-hop routing is by and large required for far off sensor hubs from the sinks to save energy, the hubs close to a sink can be loaded with transferring a lot of activity from other hubs. This problem is called the "crowded centre effect" \hyperref[b8]{[8]} or the "energy hole problem" .It results in vitality consumption at the hubs close to the sink too early, prompting the partition of the sink from whatever is left of hubs that even now have a lot of vitality. In any case, by moving the sink in the sensor field, one can maintain a strategic distance from or moderate the energy hole problem and expect an expanded system lifetime. Comptressive sensing: Compressive sensing (CS) is recent technique of simultaneously sensing and compressing that is highly appealing for fully distributed compression in wireless sensor networks (WSNs). WSNs observing ecological marvels over expansive geographic territories gather estimations from an extensive number of circulated sensors. Compressive Sensing gives a viable method for revelation and remaking of capacities with just a subset of tests. The issue of information examining and accumulation in remote sensor systems (WSNs) is getting to be basic as bigger systems are being sent. Expanding system size stances noteworthy information gathering challenges, for what concerns examining and transmission coordination and system lifetime. To handle these issues, in-system in-network compression techniques are getting to be vital answers for develop network lifetime.\par
II. 
\section[{Related Work}]{Related Work}\par
Z. Li and Q. Shi \hyperref[b3]{[3]} proposed another vitality successful QoS routing convention. The calculation is to speeds up the joining of ant colony algorithm by using SNGF to optimize routing candidate nodes; the pheromone is characterized as a blend of connection burden and transmission capacity delay.\par
S. Okdem and D. Karaboga \hyperref[b4]{[4]} acquaints another methodology with routing operations in remote sensor systems (WSNs).\par
Compressive Sensing gives a powerful method for revelation and remaking of capacities with only a subset of samples.\par
Customary CS depends on consistently circulated tests which limits reasonableness of CS based recuperation. To improve the adaptability of sampling and implementation, D. C. Dhanapala et.al \hyperref[b5]{[5]} proposed approach utilizes irregular walk based examples. 
\section[{III.}]{III.} 
\section[{Proposed Alogithm}]{Proposed Alogithm}\par
The proposed algorithm follows following steps:\par
i. Initialize ML-MAC based remote sensor system.\par
ii.\par
Check if "a" every single current nodes '1/b' ideal percentages end up being dead if yes then exhibit no. of utilized bees speaking to any arrangement of hub equal to zero else proceed next stride.In the event that a \% 1/b== 0 ??. (1)\par
iii. "X" is no. of appointed bees "j" is any hub that needs to end up the CH in that round "Y" is the set of hubs that previously chosen as CHs Cluster head in past '1/p' round. An ACO and Mobile Sink based Algorithm for Improvement of Ml-Mac for Wsns using Compressive Sensing W. Yan et.al \hyperref[b6]{[6]} introduced a very simple deterministic measurement matrix design algorithm (SDMMDA), based on which the data gathering and reconstruction in wireless sensor networks (WSNs) are greatly enhanced. C.Caione et.al \hyperref[b7]{[7]} compared Distributed compressed sensing (DCS) and Kronecker compressive sensing (KCS) two structures against a typical arrangement of artificial signals legitimately worked to typify the primary attributes of characteristic signs. J.Wang et.al \hyperref[b9]{[9]} separates the system into a few groups and cluster heads are chosen inside every group. At that point, a mobile sink speaks with every cluster head to gather information specifically through short range correspondences. The ACO calculation has been used in this work keeping in mind the end goal to locate the ideal mobility direction for the mobile sink.B.Nazir and H.Hasbullah provide a mobile sink based routing protocol for prolonging network lifetime \hyperref[b10]{[10]}. N.Vlajic and D.Stenvanoic performed analysis of zigbee-based wireless sensor networks with path constrained mobile sink \hyperref[b11]{[11]}. Y.Nizhamudong et.al \hyperref[b13]{[12]} evaluated the cost of route wireless sensor network with a mobile sink. Manish Kumar Jha et al. \hyperref[b14]{[13]} gives an enhanced time synchronized relay node based ML-MAC convention for WSNs. Manish Kumar Jha et al.  {\ref [} S. Singh et al. \hyperref[b1]{[2]} proposed a ACO method and discovered the sink area for which the quantity of sensors is least among every accessible area in the matrix. In their calculation, they process aggregate of separations of the objectives from that sensor, which are in its reach. At that point they include these totals for all sensors in the network. This separation compares to the given sink area. Then rehash same procedure for registering the separation by changing the sink area in the lattice. That sink area for which the separation is least is picked and this sink area requires least number of sensors to cover all objectives. Check whether "rnd" is less than threshold value if yes than set as cluster head (CH) and report all hubs else wait and join with mean set cluster head. 
\section[{X (j)}]{X (j)}
\begin{quote}
.\end{quote}
 
\section[{IF rnd ? TH(n)}]{IF rnd ? TH(n)}\par
vi.\par
Find relay hub from Cluster Head. vii.\par
Apply Ant Colony Optimization (ACO) on CHs to discover short routes way amongst CHs and sink. viii.\par
Apply compressive sensing and Communicate information and update vitality dissemination. ix.\par
Check whether dead is equivalent to no. of hubs "n" if yes then Join with mean set (CH)cluster head else go to step 2. Is dead == n IV. 
\section[{Experimental Setup}]{Experimental Setup}\par
For performing the simulation we are using MATLAB 2010a version 7.10.0.499 32-bit.We are using windows 7 core i5 processor with 64 bit operating system and 4GB RAM.\par
V. 
\section[{Experimental Results}]{Experimental Results}\par
The main objective of simulation is to evaluate the performance of proposed algorithm .In the simulations we refer to network with nodes varying from 100 to 600.we get the following results which the effectiveness of algorithm.   \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2} \par 
\begin{longtable}{P{0.08360655737704918\textwidth}P{0.2201639344262295\textwidth}P{0.25081967213114753\textwidth}P{0.29540983606557375\textwidth}}
\tabcellsep Exiting\tabcellsep ACO based ml-mac\tabcellsep Mobile sink and aco baesd ML-mac\\
100\tabcellsep 19.4779\tabcellsep 24.4513\tabcellsep 24.4516\\
150\tabcellsep 29.9045\tabcellsep 37.7087\tabcellsep 37.9928\\
200\tabcellsep 40.6416\tabcellsep 51.7361\tabcellsep 51.9828\\
250\tabcellsep 51.0113\tabcellsep 65.2385\tabcellsep 65.5300\\
300\tabcellsep 62.0976\tabcellsep 79.0836\tabcellsep 79.2515\\
350\tabcellsep 71.2310\tabcellsep 92.5709\tabcellsep 92.8383\\
400\tabcellsep 83.0392\tabcellsep 105.8739\tabcellsep 106.5069\\
450\tabcellsep 92.3126\tabcellsep 120.0419\tabcellsep 120.3627\\
500\tabcellsep 103.9739\tabcellsep 133.6166\tabcellsep 133.9290\\
600\tabcellsep 124.2635\tabcellsep 160.6876\tabcellsep 161.1973\end{longtable} \par
 
\caption{\label{tab_3}Table 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3} \par 
\begin{longtable}{P{0.11184210526315788\textwidth}P{0.19758771929824562\textwidth}P{0.24232456140350878\textwidth}P{0.2982456140350877\textwidth}}
\tabcellsep Exiting\tabcellsep ACO based ml -mac\tabcellsep Mobile sink and aco baesd ML-mac\\
100\tabcellsep 3620\tabcellsep 4980\tabcellsep 4964\\
150\tabcellsep 5565\tabcellsep 7682\tabcellsep 7790\\
200\tabcellsep 7570\tabcellsep 10586\tabcellsep 10652\\
250\tabcellsep 9509\tabcellsep 13367\tabcellsep 13419\\
300\tabcellsep 11572\tabcellsep 16803\tabcellsep 16238\\
350\tabcellsep 13226\tabcellsep 19032\tabcellsep 19028\\
400\tabcellsep 15459\tabcellsep 21801\tabcellsep 21880\\
450\tabcellsep 17206\tabcellsep 24655\tabcellsep 24733\\
500\tabcellsep 19325\tabcellsep 27435\tabcellsep 27537\\
600\tabcellsep 23144\tabcellsep 32994\tabcellsep 33127\end{longtable} \par
 
\caption{\label{tab_4}Table 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4} \par 
\begin{longtable}{P{0.22616407982261638\textwidth}P{0.15077605321507762\textwidth}P{0.12815964523281598\textwidth}P{0.1696230598669623\textwidth}P{0.1752771618625277\textwidth}}
\tabcellsep No. of nodes\tabcellsep \tabcellsep ACO based ml-\tabcellsep \\
Year 2018\tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
32\tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
Volume XVIII Issue II Version I\tabcellsep No. of nodes\tabcellsep \tabcellsep \tabcellsep \\
( ) E\tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
Global Journal of Computer Science and Technology\tabcellsep 100 No. of nodes No. of nodes\tabcellsep Exiting 0.6436\tabcellsep ACO based ml-mac 0.1084\tabcellsep Mobile sink and aco baesd ML-mac 0.1201\\
\tabcellsep 150\tabcellsep 0.9438\tabcellsep 0.1041\tabcellsep 0.0984\\
\tabcellsep 200\tabcellsep 1.2171\tabcellsep 0.1371\tabcellsep 0.7141\\
\tabcellsep 250\tabcellsep 1.6492\tabcellsep 0.1637\tabcellsep 0.3470\\
\tabcellsep 300\tabcellsep 1.7300\tabcellsep 0.1816\tabcellsep 0.1746\\
\tabcellsep 350\tabcellsep 2.0176\tabcellsep 0.1938\tabcellsep 0.1898\\
\tabcellsep 400\tabcellsep 2.1084\tabcellsep 0.2368\tabcellsep 0.2278\\
\tabcellsep 450\tabcellsep 2.5062\tabcellsep 0.2529\tabcellsep 0.3223\\
\tabcellsep 500\tabcellsep 2.8251\tabcellsep 0.3051\tabcellsep 0.3415\\
\tabcellsep 600\tabcellsep 3.2361\tabcellsep 0.4563\tabcellsep 0.4070\\
© 2018 Global Journals 1\tabcellsep \tabcellsep \tabcellsep \tabcellsep \end{longtable} \par
 
\caption{\label{tab_5}Table 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5} \par 
\begin{longtable}{P{0.08732876712328766\textwidth}P{0.22414383561643836\textwidth}P{0.24452054794520545\textwidth}P{0.2940068493150685\textwidth}}
\tabcellsep Exiting\tabcellsep ACO based ml-mac\tabcellsep Mobile sink and aco baesd ML-mac\\
100\tabcellsep 128\tabcellsep 10.2000\tabcellsep 19.3600\\
150\tabcellsep 129\tabcellsep 2.7867\tabcellsep 6.0667\\
200\tabcellsep 121.5000\tabcellsep 8.0700\tabcellsep 17.7400\\
250\tabcellsep 109.6400\tabcellsep 12.2800\tabcellsep 27.3240\\
300\tabcellsep 104.2667\tabcellsep 17.0633\tabcellsep 16.8733\\
350\tabcellsep 112.1143\tabcellsep 18.6229\tabcellsep 16.6343\\
400\tabcellsep 103.5250\tabcellsep 33.4975\tabcellsep 17.3000\\
450\tabcellsep 107.6444\tabcellsep 16.2111\tabcellsep 16.0378\\
500\tabcellsep 103.5000\tabcellsep 16.1300\tabcellsep 15.9260\\
600\tabcellsep 104.2667\tabcellsep 28.0100\tabcellsep 30.7883\end{longtable} \par
 
\caption{\label{tab_6}Table 5 :}\end{figure}
 		 		\backmatter  			 			 			  				\begin{bibitemlist}{1}
\bibitem[Zheng]{b15}\label{b15} 	 		\textit{},  		 			Tao Zheng 		.  		 	 
\bibitem[ ()]{b2}\label{b2} 	 		\textit{},  		 \xref{http://dx.doi.org/10.1109/ICISCON.2014.6965229}{10.1109/ICISCON.2014.6965229}.  		2014. Mathura. p. .  	 
\bibitem[Yan et al. ()]{b6}\label{b6} 	 		‘An efficient data gathering and reconstruction method in WSNs based on compressive sensing’.  		 			W Yan 		,  		 			Q Wang 		,  		 			Y Shen 		,  		 			Y Wang 		,  		 			Q Han 		.  		 \xref{http://dx.doi.org/10.1109/I2MTC.2012.6229316}{10.1109/I2MTC.2012.6229316}.  	 	 		\textit{IEEE International}  		2012. 2012. p. .  	 	 (Instrumentation and Measurement Technology Conference (I2MTC)) 
\bibitem[Li and Shi ()]{b3}\label{b3} 	 		‘An QoS Algorithm Based on ACO for Wireless Sensor Network’.  		 			Z Li 		,  		 			Q Shi 		.  	 	 		\textit{High Performance Computing and Communications \& 2013 IEEE International Conference on Embedded and Ubiquitous Computing (HPCC\textunderscore EUC), 2013 IEEE 10th International Conference on},  				 (Zhangjiajie)  		2013. p. .  	 
\bibitem[Dorigo and Stutzle ()]{b0}\label{b0} 	 		\textit{Ant Colony Optimization, A Bradfordbook},  		 			M Dorigo 		,  		 			T Stutzle 		.  		2004. London, England.  	 
\bibitem[Popa et al. (2007)]{b8}\label{b8} 	 		\textit{Balancingtraffic load in wireless networks with curveball routing},  		 			L Popa 		,  		 			A Rostamizadeh 		,  		 			R M Karp 		,  		 			C Papadimitriou 		.  		Sept 2007. 07 p. .  	 
\bibitem[Wang et al. (2015)]{b9}\label{b9} 	 		‘Bio-inspired ant colony optimization based clustering algorithm with mobile sinks for applications in consumer home automation networks’.  		 			J Wang 		,  		 			J Cao 		,  		 			B Li 		,  		 			S Lee 		,  		 			R S Sherratt 		.  	 	 		\textit{IEEE Transactions on Consumer Electronics},  				November 2015. 61 p. .  	 
\bibitem[Caione et al. (2014)]{b7}\label{b7} 	 		‘Compressive Sensing Optimization for Signal Ensembles in WSNs’.  		 			C Caione 		,  		 			D Brunelli 		,  		 			L Benini 		.  		 \xref{http://dx.doi.org/10.1109/TII.2013.2266097}{10.1109/TII.2013.2266097}.  	 	 		\textit{IEEE Transactions on Industrial Informatics}  		Feb. 2014. 10  (1)  p. .  	 
\bibitem[Khurana et al. ()]{b14}\label{b14} 	 		‘Improved time synchronization in ML-MAC for WSN using relay nodes’.  		 			Manju Khurana 		,  		 			Ranjana Thalore 		,  		 			Vikas Raina 		,  		 			Manish Kumar Jha 		.  	 	 		\textit{AEU-International Journal of Electronics and Communications}  		2015. 69  (11)  p. .  	 
\bibitem[Gidlund and Akerberg (2014)]{b16}\label{b16} 	 		‘Medium access protocol design for time-critical applications in wireless sensor networks’.  		 			M Gidlund 		,  		 			J Akerberg 		.  		 doi: 0.1109/WFCS.2014.6837585.  	 	 		\textit{Factory Communication Systems (WFCS), 2014 10th IEEE Workshop on},  				5-7 May 2014. p. .  	 
\bibitem[Nazir and Hasbullah ()]{b10}\label{b10} 	 		‘Mobile Sink based Routing Protocol (MSRP) for Prolonging Network Lifetime in Clustered Wireless Sensor Network’.  		 			B Nazir 		,  		 			H Hasbullah 		.  		 \xref{http://dx.doi.org/10.1109/ICCAIE.2010.5735010}{10.1109/ICCAIE.2010.5735010}.  	 	 		\textit{Computer Applications and Industrial Electronics (ICCAIE), 2010 International Conference on},  				 (Kuala Lumpur)  		2010. p. .  	 
\bibitem[Singh et al. ()]{b1}\label{b1} 	 		‘Optimum deployment of sensors in WSNs’.  		 			S Singh 		,  		 			S Chand 		,  		 			B Kumar 		.  	 	 		\textit{Information Systems and Computer Networks (ISCON)},  				2014.  	 
\bibitem[Vlajic and Stevanovic ()]{b11}\label{b11} 	 		\textit{Performance Analysis of ZigBee-Based Wireless Sensor Networks with Path-Constrained Mobile Sink(s)," Sensor Technologies and Applications},  		 			N Vlajic 		,  		 			D Stevanovic 		.  		2009.  	 
\bibitem[Nizhamudong et al. ()]{b13}\label{b13} 	 		‘Performance evaluation of route cost for wireless sensor networks with a mobile sink’.  		 			Y Nizhamudong 		,  		 			N Nakaya 		,  		 			Y Hagihara 		,  		 			Y Koui 		.  	 	 		\textit{SICE Annual Conference (SICE), 2011 Proceedings of},  				 (Tokyo)  		2011. p. .  	 
\bibitem[Dhanapala et al. ()]{b5}\label{b5} 	 		‘Phenomena discovery in WSNs: A compressive sensing based approach’.  		 			D C Dhanapala 		,  		 			V W Bandara 		,  		 			A Pezeshki 		,  		 			A P Jayasumana 		.  		 \xref{http://dx.doi.org/10.1109/ICC.2013.6654790}{10.1109/ICC.2013.6654790}.  	 	 		\textit{2013 IEEE International Conference on Communications (ICC)},  				 (Budapest)  		2013. p. .  	 
\bibitem[Okdem and Karaboga ()]{b4}\label{b4} 	 		‘Routing in Wireless Sensor Networks Using Ant Colony Optimization’.  		 			S Okdem 		,  		 			D Karaboga 		.  		 \xref{http://dx.doi.org/10.1109/AHS.2006.63}{10.1109/AHS.2006.63}.  	 	 		\textit{First NASA/ESA Conference on Adaptive Hardware and Systems (AHS'06)},  				 (Istanbul)  		2006. p. .  	 
\bibitem[SENSORCOMM '09. Third International Conference on ()]{b12}\label{b12} 	 		 \xref{http://dx.doi.org/10.1109/SENSORCOMM.2009.114}{10.1109/SENSORCOMM.2009.114}.  		\textit{SENSORCOMM '09. Third International Conference on},  				 (Athens, Glyfada)  		2009. p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
