X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/ThesisAli.git/blobdiff_plain/b15795affb468ae97eeb4dfd90893ff79961f193..df0ded57ac60ab03ead82d37326459a25812634a:/CHAPITRE_04.tex?ds=sidebyside

diff --git a/CHAPITRE_04.tex b/CHAPITRE_04.tex
index f0f1415..c634430 100644
--- a/CHAPITRE_04.tex
+++ b/CHAPITRE_04.tex
@@ -66,12 +66,16 @@ $X_2=( p_x + R_s * (1), p_y + R_s * (0) )$\\
 $X_3=( p_x + R_s * (-1), p_y + R_s * (0)) $\\
 $X_4=( p_x + R_s * (0), p_y + R_s * (1) )$\\
 $X_5=( p_x + R_s * (0), p_y + R_s * (-1 )) $\\
-$X_6= ( p_x + R_s * (\frac{-\sqrt{2}}{2}), p_y + R_s * (0)) $\\
-$X_7=( p_x + R_s *  (\frac{\sqrt{2}}{2}), p_y + R_s * (0))$\\
+%$X_6= ( p_x + R_s * (\frac{-\sqrt{2}}{2}), p_y + R_s * (0)) $\\
+$X_{6}=( p_x + R_s * (\frac{-\sqrt{2}}{2}), p_y + R_s * (\frac{\sqrt{2}}{2})) $\\
+%$X_7=( p_x + R_s *  (\frac{\sqrt{2}}{2}), p_y + R_s * (0))$\\
+$X_{7}=( p_x + R_s * (\frac{\sqrt{2}}{2}), p_y + R_s * (\frac{\sqrt{2}}{2})) $\\
 $X_8=( p_x + R_s * (\frac{-\sqrt{2}}{2}), p_y + R_s * (\frac{-\sqrt{2}}{2})) $\\
 $X_9=( p_x + R_s * (\frac{\sqrt{2}}{2}), p_y + R_s * (\frac{-\sqrt{2}}{2})) $\\
-$X_{10}=( p_x + R_s * (\frac{-\sqrt{2}}{2}), p_y + R_s * (\frac{\sqrt{2}}{2})) $\\
-$X_{11}=( p_x + R_s * (\frac{\sqrt{2}}{2}), p_y + R_s * (\frac{\sqrt{2}}{2})) $\\
+%$X_{10}=( p_x + R_s * (\frac{-\sqrt{2}}{2}), p_y + R_s * (\frac{\sqrt{2}}{2})) $\\
+$X_{10}= ( p_x + R_s * (\frac{-\sqrt{2}}{2}), p_y + R_s * (0)) $\\
+%$X_{11}=( p_x + R_s * (\frac{\sqrt{2}}{2}), p_y + R_s * (\frac{\sqrt{2}}{2})) $\\
+$X_{11}=( p_x + R_s *  (\frac{\sqrt{2}}{2}), p_y + R_s * (0))$\\
 $X_{12}=( p_x + R_s * (0), p_y + R_s * (\frac{\sqrt{2}}{2})) $\\
 $X_{13}=( p_x + R_s * (0), p_y + R_s * (\frac{-\sqrt{2}}{2})) $\\
 $X_{14}=( p_x + R_s * (\frac{\sqrt{3}}{2}), p_y + R_s * (\frac{1}{2})) $\\
@@ -94,7 +98,7 @@ $X_{25}=( p_x + R_s * (\frac{1}{2}), p_y + R_s * (\frac{-\sqrt{3}}{2})) $.
  \begin{multicols}{2}
 \centering
 \includegraphics[scale=0.33]{Figures/ch4/fig21.pdf}\\~ ~ ~ ~ ~ ~ ~ ~(a)
-\includegraphics[scale=0.33]{Figures/ch4/principles13.pdf}\\~ ~ ~ ~ ~ ~(c) 
+\includegraphics[scale=0.33]{Figures/ch4/fig23.pdf}\\~ ~ ~ ~ ~ ~(c) 
 \hfill \hfill
 \includegraphics[scale=0.33]{Figures/ch4/fig25.pdf}\\~ ~ ~ ~ ~ ~(e)
 \includegraphics[scale=0.33]{Figures/ch4/fig22.pdf}\\~ ~ ~ ~ ~ ~ ~ ~ ~(b)
@@ -187,7 +191,14 @@ Active  sensors  in the  period  will  execute  their sensing  task  to preserve
 
 An outline of the  protocol implementation is given by Algorithm~\ref{alg:DiLCO} which describes the execution of a period  by a node (denoted by $s_j$  for a sensor  node indexed by  $j$). In  the beginning,  a node  checks whether  it has enough energy to stay active during the next sensing phase (i.e., the remaining energy $RE_j$ $\geq$ $E_{th}$ (the  amount of energy required to be alive during one period)). If yes, it exchanges information  with  all the  other nodes belonging to the same subregion:  it collects from each node its position coordinates, remaining energy ($RE_j$), ID, and  the number  of  one-hop neighbors  still  alive. Once  the  first phase  is completed, the nodes  of a subregion choose a leader to  take the decision based on the criteria described in section \ref{ch4:sec:02:03:02}.
 %the  following  criteria   with  decreasing  importance:  larger  number  of neighbors, larger remaining energy, and  then in case of equality, larger index. 
-After that,  if the sensor node is  leader, it will execute  the integer program algorithm (see Section~\ref{ch4:sec:03})  which provides a set of  sensors planned to be active in the next sensing phase. As leader, it will send an ActiveSleep packet to each sensor  in the same subregion to  indicate it if it has to  be active or not.  Alternately, if  the  sensor  is not  the  leader, it  will  wait for  the ActiveSleep packet to know its state for the coming sensing phase.
+After that,  if the sensor node is  leader, it will execute  the integer program algorithm (see Section~\ref{ch4:sec:03})  which provides a set of  sensors planned to be active in the next sensing phase. As leader, it will send an ActiveSleep packet to each sensor  in the same subregion to  indicate it if it has to  be active or not.  Alternately, if  the  sensor  is not  the  leader, it  will  wait for  the ActiveSleep packet to know its state for the coming sensing phase. \textcolor{blue}{The flow chart of DiLCO protocol that executed in each sensor node is presented in \ref{flow4}.} 
+
+\begin{figure}[ht!]
+\centering
+\includegraphics[scale=0.50]{Figures/ch4/Algo1.png} % 70mm
+\caption{The flow chart of DiLCO protocol.}
+\label{flow4}
+\end{figure} 
 
 %Primary Points based 
 \section{Coverage Problem Formulation}
@@ -350,7 +361,7 @@ The modeling language for Mathematical Programming (AMPL)~\cite{AMPL} is  employ
 \label{tab:EC}
 \begin{tabular}{|l||cccc|}
   \hline
-  {\bf Sensor status} & MCU & Radio & Sensor & {\it Power (mW)} \\
+  {\bf Sensor status} & MCU & Radio & Sensing & {\it Power (mW)} \\
   \hline
   LISTENING & On & On & On & 20.05 \\
   ACTIVE & On & Off & On & 9.72 \\
