Ali Made update

[ThesisAli.git] / CHAPITRE_02.tex

diff --git a/CHAPITRE_02.tex b/CHAPITRE_02.tex
index 7b56933da0baf935bf0e4d76dbb4b332b7f4d0be..b657f60be9a5b5ad6a0af9dedb111c1a7b036713 100755 (executable)
--- a/CHAPITRE_02.tex
+++ b/CHAPITRE_02.tex
@@ -110,12 +110,12 @@ In \cite{GAF}, Xu et al. have described an algorithm, called Geographical Adapti
 
 \begin{figure}[h!]
 \centering
 
 \begin{figure}[h!]
 \centering

-\includegraphics[scale=0.5]{Figures/ch2/GAF1.jpeg} 
+\includegraphics[scale=0.8]{Figures/ch2/GAF1.jpeg} 

 \caption{ Example of fixed square grid in GAF.}
 \label{gaf1}
 \end{figure}
 
 \caption{ Example of fixed square grid in GAF.}
 \label{gaf1}
 \end{figure}
 

-The fixed grid is defined where, each two adjacent grids, for example, A and B in figure\ref{gaf1}, all the sensor nodes inside A can communicate with sensor nodes inside B and vice versa. Therefore, all the sensor nodes are equivalent from the point of view the routing. The size of the fixed grid is based on the radio communication range $R_c$. It is supposed that the fixed grid is square with $r$ units on a side as shown in figure~\ref{gaf1}. The distance between the farthest two possible sensor nodes in two adjacent grid such as, B and C in figure~\ref{gaf1}, should not be greater than the radio communication range $R_c$ so as to satisfy the definition of fixed square grid. For instance, the sensor node \textbf{2} of grid B can communicate with the sensor node \textbf{5} of grid C. So, 
+The fixed grid is defined where, each two adjacent grids, for example, A and B in figure\ref{gaf1}, all the sensor nodes inside A can communicate with sensor nodes inside B and vice versa. Therefore, all the sensor nodes are equivalent from the point of view the routing. The size of the fixed grid is based on the radio communication range $R_c$. It is supposed that the fixed grid is square with $r$ units on a side as shown in figure~\ref{gaf1}. The distance between the farthest two possible sensor nodes in two adjacent grid such as, B and C in figure~\ref{gaf1}, should not be greater than the radio communication range $R_c$ so as to satisfy the definition of fixed square grid. For instance, the sensor node \textbf{2} of grid B can communicate with the sensor node \textbf{5} of grid C So, 

 
 \begin{eqnarray}
 r^2 + \left(2r \right)^2 \leq R_c^2 
 
 \begin{eqnarray}
 r^2 + \left(2r \right)^2 \leq R_c^2 


@@ -129,7 +129,7 @@ The sensor nodes in GAF can be in one of the three states: active, sleep, or dis
 
 \begin{figure}[h!]
 \centering
 
 \begin{figure}[h!]
 \centering

-\includegraphics[scale=0.5]{Figures/ch2/GAF2.jpeg} 
+\includegraphics[scale=0.8]{Figures/ch2/GAF2.jpeg} 

 \caption{ Example of fixed square grid in GAF.}
 \label{gaf2}
 \end{figure}
 \caption{ Example of fixed square grid in GAF.}
 \label{gaf2}
 \end{figure}


@@ -141,7 +141,7 @@ In~\cite{DESK}, the author have designed a novel distributed heuristic, called D
 
 \begin{figure}[h!]
 \centering
 
 \begin{figure}[h!]
 \centering

-\includegraphics[scale=0.5]{Figures/ch2/DESK.jpeg} 
+\includegraphics[scale=0.6]{Figures/ch2/DESK.jpeg} 

 \caption{ DESK network time line.}
 \label{desk}
 \end{figure}
 \caption{ DESK network time line.}
 \label{desk}
 \end{figure}