Update on the Figure of energy consumption by Ali

Merge branch 'master' of ssh://bilbo.iut-bm.univ-fcomte.fr/Sensornets15

Conflicts:
	Example.tex

diff --cc Example.tex
index 2558b1922f442cf744a706e3959d1ef5ebcc3e6d,d8659636b063dcc47d9ab43967047f4fb0d69501..bd29ee69d763da4d19ad50ad77cb5694cc7e7357
--- 1/Example.tex
--- 2/Example.tex
+++ b/Example.tex
@@@ -168,6 -170,8 +168,11 @@@ used~\cite{castano2013column,rossi2012e
    \cite{pedraza2006}  where the  objective is  to maximize  the number  of cover
    sets.}
  
++<<<<<<< HEAD
++=======
+ 
+ 
++>>>>>>> ec736a6c4605ef475156098f1b75d72120a294ba
  
  \section{\uppercase{Description of the DiLCO protocol}}
  \label{sec:The DiLCO Protocol Description}
@@@ -177,6 -181,7 +182,10 @@@ on  each subregion  in  the area  of in
  techniques: network leader election  and sensor activity scheduling for coverage
  preservation  and  energy  conservation,  applied  periodically  to  efficiently
  maximize the lifetime in the network.
++<<<<<<< HEAD
++=======
+ 
++>>>>>>> ec736a6c4605ef475156098f1b75d72120a294ba
  
  \subsection{Assumptions and models}
  
@@@ -271,10 -277,12 +280,15 @@@ to each sensor  in the same subregion t
  not.  Alternately, if  the  sensor  is not  the  leader, it  will  wait for  the
  Active-Sleep packet to know its state for the coming sensing phase.
  
++<<<<<<< HEAD
++=======
+ 
+ 
+ 
++>>>>>>> ec736a6c4605ef475156098f1b75d72120a294ba
  
  \begin{algorithm}[h!]                
-  % \KwIn{all the parameters related to information exchange}
- %  \KwOut{$winer-node$ (: the id of the winner sensor node, which is the leader of current round)}
+ 
    \BlankLine
    %\emph{Initialize the sensor node and determine it's position and subregion} \; 
    
@@@ -548,6 -556,12 +562,15 @@@ where  $n$ is  the number  of covered  
  subregions during  the current  sensing phase  and $N$ is the total number  of grid
  points in  the sensing field. In  our simulations, we have  a layout of  $N = 51
  \times 26 = 1326$ grid points.
++<<<<<<< HEAD
++=======
+ %The accuracy of this method depends on the distance between grids. In our
+ %simulations, the sensing field has been divided into 50 by 25 grid points, which means
+ %there are $51 \times 26~ = ~ 1326$ points in total.
+ % Therefore, for our simulations, the error in the coverage calculation is less than ~ 1 $\% $.
+ 
+ 
++>>>>>>> ec736a6c4605ef475156098f1b75d72120a294ba
  
  \item {{\bf  Energy Consumption}:}  energy consumption (EC)  can be seen  as the
    total amount of  energy   consumed   by   the   sensors   during   $Lifetime_{95}$   or
@@@ -570,6 -584,9 +593,12 @@@ refers to the energy needed by all the 
  during a period.  Finally, $E^a_{m}$ and $E^s_{m}$ indicate  the energy consumed
  by the whole network in the sensing phase (active and sleeping nodes).
  
++<<<<<<< HEAD
++=======
+ 
+ 
+ 
++>>>>>>> ec736a6c4605ef475156098f1b75d72120a294ba
  \end{itemize}
  %\end{enumerate}
  
@@@ -621,6 -638,7 +650,10 @@@ nodes, and thus enables the extension o
  \label{fig3}
  \end{figure} 
  
++<<<<<<< HEAD
++=======
+ 
++>>>>>>> ec736a6c4605ef475156098f1b75d72120a294ba
  \subsubsection{Energy consumption}
  
  Based on  the results shown in  Figure~\ref{fig3}, we focus on  the DiLCO-16 and
@@@ -680,6 -702,7 +713,10 @@@ prevents it  to  ensure a  good  covera
  subregions. Thus,  the optimal number of  subregions can be seen  as a trade-off
  between execution time and coverage performance.
  
++<<<<<<< HEAD
++=======
+ 
++>>>>>>> ec736a6c4605ef475156098f1b75d72120a294ba
  \subsubsection{Network lifetime}
  
  In the next figure, the network lifetime is illustrated. Obviously, the lifetime
@@@ -703,6 -726,8 +740,11 @@@ DESK and GAF for the lifetime of  the n
  the larger level  of coverage ($95\%$) in the case of  our protocol, the subdivision
  in $16$~subregions seems to be the most appropriate.
  
++<<<<<<< HEAD
++=======
+ 
+ 
++>>>>>>> ec736a6c4605ef475156098f1b75d72120a294ba
  \section{\uppercase{Conclusion and future work}}
  \label{sec:Conclusion and Future Works} 
  
@@@ -729,6 -754,8 +771,11 @@@ there is an optimal number of  subregio
  context  a subdivision in  $16$~subregions seems  to be  the most  relevant. The
  optimal number of subregions will be investigated in the future.
  
++<<<<<<< HEAD
++=======
+ 
+ 
++>>>>>>> ec736a6c4605ef475156098f1b75d72120a294ba
  \section*{\uppercase{Acknowledgements}}
  
  \noindent  As a  Ph.D.   student, Ali  Kadhum  IDREES would  like to  gratefully