X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/ThesisAli.git/blobdiff_plain/55d4f1aa141136c31e0c3a805ed0a09ad7c8b4e8..fb2946597e20d8a0af9a7ecd5b81a3bb462ecea7:/CHAPITRE_02.tex?ds=inline

diff --git a/CHAPITRE_02.tex b/CHAPITRE_02.tex
index a069064..c25e13d 100644
--- a/CHAPITRE_02.tex
+++ b/CHAPITRE_02.tex
@@ -60,7 +60,7 @@ In a distributed algorithms, on the other hand, the decision process is localize
      
 \textbf{\begin{center} Computation \end{center}} & Require low processing power where the algorithm is executed only in one elected node. & Require large processing power due to execution the algorithm in every node in WSN. \\ \hline
 
-\textbf{\begin{center} Communication \end{center}} & Require large power consumption for communication. & Require low power consumption for communication. \\ \hline
+\textbf{\begin{center} Communication \end{center}} & Sensor nodes communicate directly with the base station, therefore, they require low-power consumption for communication. & Sensor nodes require high power consumption for communication because of the frequent exchange of hello packets. \\ \hline
 
 \textbf{\begin{center} Decision \end{center}} & Ensure nearly or close to optimal solution.  & Can not ensure optimal (or near-optimal) solution.\\ \hline
 
@@ -139,7 +139,7 @@ In this dissertation, we focused in more detail on two distributed coverage algo
 \subsection{GAF}
 \label{ch2:sec:03:1}
 
-Xu et al. \cite{GAF} develop an algorithm, called Geographical Adaptive Fidelity (GAF). It uses geographic location information to divide the area of interest into fixed square grids. Within each grid, it keeps only one node staying awake to take the responsibility of sensing and communication. Figure~\ref{gaf1} gives an example of fixed square grid in GAF.
+Xu et al. \cite{GAF} develop an algorithm, called Geographical Adaptive Fidelity (GAF). It uses geographic location information to divide the area of interest into fixed square grids. Within each grid, it keeps only one node staying awake to take the responsibility of sensing and communication. Each sensor node uses its GPS to associate itself with a point in the grid.Figure~\ref{gaf1} gives an example of fixed square grid in GAF.
 
 \begin{figure}[h!]
 \centering
@@ -173,7 +173,10 @@ In discovery state, the radio of each sensor node is turned on. Thereafter, the
 \label{gaf2}
 \end{figure}
 
-The sensor node sets a timer to $T_d$ seconds after entering in the discovery state. As soon as the timer fires, the sensor node broadcasts its discovery message and enters the active state. The active sensor node sets a timeout value $T_a$ to define how long it can stay in the active state. After $T_a$, the sensor node will return to the discovery state. Whilst, during its active state, it re-broadcasts its discovery message at intervals $T_d$ periodically. The sensor node with discovery or active state can change its state to sleep when it detects that some other equivalent node will handle routing inside the grid. The sensor nodes in the sleeping state wake up after a sleeping time $T_s$ and go back to the discovery state. In GAF, load balancing is performed by means of periodic election of the leader (i.e., the active node that handle the routing inside the fixed grid). A rank-based election algorithm has been used to elect the leader. It is based on the remaining energy of sensor nodes inside the fixed square grid so as to extend the network lifetime.
+The sensor node sets a timer to $T_d$ seconds after entering in the discovery state. As soon as the timer fires, the sensor node broadcasts its discovery message and enters the active state. The active sensor node sets a timeout value $T_a$ to define how long it can stay in the active state. After $T_a$, the sensor node will return to the discovery state. Whilst, during its active state, it re-broadcasts its discovery message at intervals $T_d$ periodically. The sensor node with discovery or active state can change its state to sleep when it detects that some other equivalent node will handle routing inside the grid. The sensor nodes in the sleeping state wake up after a sleeping time $T_s$ and go back to the discovery state. In GAF, load balancing is performed by means of periodic election of the leader (i.e., the active node that handle the routing inside the fixed grid). Inside each fixed square grid, sensor nodes collaborate with each other to play different roles. For example, nodes will elect
+one sensor node (based on the remaining energy of sensor nodes inside the fixed square grid) to stay awake for a certain period of time, and then the rest go to sleep. This sensor node is responsible for monitoring and reporting data to the base station on behalf of the nodes
+in the square grid. 
+%A rank-based election algorithm has been used to elect the leader. It is based on the remaining energy of sensor nodes inside the fixed square grid so as to extend the network lifetime.
 
 \subsection{DESK}
 \label{ch2:sec:03:2}
@@ -186,8 +189,8 @@ DESK is based on the result from \cite{ref133}. In \cite{ref133}, the whole area
 \begin{figure}[h!]
   \centering
   \begin{tabular}{@{}cr@{}}
-    \includegraphics[scale=0.6]{Figures/ch2/P2.jpg} & \raisebox{4cm}{(a)} \\  
-    \includegraphics[scale=0.6]{Figures/ch2/P1.jpg} & \raisebox{4cm}{(b)}
+    \includegraphics[scale=0.8]{Figures/ch2/P22.jpg} & \raisebox{3cm}{(a)} \\  
+    \includegraphics[scale=0.8]{Figures/ch2/P11.jpg} & \raisebox{3cm}{(b)}
   \end{tabular}
   \caption{Determining the perimeter-coverage of $s_i$’s perimeter.}
   \label{figp}