X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/ThesisAli.git/blobdiff_plain/7c91ad0ef9e5b3ba9e8d84cfed55bc7692a8e359..3d06a5c3f39989cad3f899ea07b088a5e8f3716b:/CHAPITRE_02.tex diff --git a/CHAPITRE_02.tex b/CHAPITRE_02.tex old mode 100755 new mode 100644 index c3082a7..e977bf7 --- a/CHAPITRE_02.tex +++ b/CHAPITRE_02.tex @@ -134,17 +134,14 @@ The works presented in~\cite{ref134,ref135,ref136} focus on coverage-aware, dist - - - \subsection{GAF} \label{ch2:sec:03:1} -In \cite{GAF}, Xu et al. have developed 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} have developed 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. \begin{figure}[h!] \centering -\includegraphics[scale=0.8]{Figures/ch2/GAF1.jpeg} +\includegraphics[scale=0.4]{Figures/ch2/GAF1.eps} \caption{ Example of fixed square grid in GAF.} \label{gaf1} \end{figure} @@ -169,7 +166,7 @@ In discovery state, the radio of each sensor node is turned on. Thereafter, the \begin{figure}[h!] \centering -\includegraphics[scale=0.8]{Figures/ch2/GAF2.jpeg} +\includegraphics[scale=0.4]{Figures/ch2/GAF2.eps} \caption{ Example of fixed square grid in GAF.} \label{gaf2} \end{figure} @@ -179,7 +176,7 @@ The sensor node sets a timer to $T_d$ seconds after entering in the discovery st \subsection{DESK} \label{ch2:sec:03:2} -In~\cite{DESK}, the author design a novel distributed heuristic, called Distributed Energy-efficient Scheduling for k-coverage (DESK), which ensures that the energy consumption among the sensors is balanced and the lifetime maximized while the coverage requirement is satisfied. This heuristic works in rounds, requires only one-hop neighbor information, and each sensor decides its status (active or sleep) based on the perimeter coverage model from~\cite{ref133}. +The authors in~\cite{DESK} design a novel distributed heuristic, called Distributed Energy-efficient Scheduling for k-coverage (DESK), which ensures that the energy consumption among the sensors is balanced and the lifetime maximized while the coverage requirement is satisfied. This heuristic works in rounds, requires only one-hop neighbor information, and each sensor decides its status (active or sleep) based on the perimeter coverage model from~\cite{ref133}. DESK is based on the result from \cite{ref133}. In \cite{ref133}, the whole area is k-covered if and only if the perimeter of sensing regions of all sensors are k-covered. The coverage level of perimeter of a sensor $s_i$ is determined by calculating the angle corresponding to the arc that each of its neighbors covers its perimeter. Figure~\ref{figp}~(a) illuminates such arcs whilst figure~\ref{figp}~(b) shows the angles corresponding with those arcs, which were posted into the range [0,2$ \pi $]. According to figure~\ref{figp}~(b), the coverage level of sensor $s_i$ can be calculated via traversing the range from 0 to 2$ \pi $. @@ -198,7 +195,7 @@ DESK is based on the result from \cite{ref133}. In \cite{ref133}, the whole area \begin{figure}[h!] \centering -\includegraphics[scale=0.6]{Figures/ch2/DESK.jpeg} +\includegraphics[scale=0.45]{Figures/ch2/DESK.eps} \caption{ DESK network time line.} \label{desk} \end{figure} @@ -222,7 +219,7 @@ DESK uses two types of messages, mACTIVATE message by which a sensor informs oth Typically, the algorithm works as follows. At the beginning of each round, no sensors are active. All sensors are in listening mode, i.e. all wait for the time to make a decision while still doing sensing job. All the sensor nodes collect the information (coordinates, current residual energy, and sensing range) from the one-hop neighbors. It stores this information into a list L in the increasing order of the angle $\alpha $ . Each sensor node set its timer to $w_i$ and initially it is proposed that all of its neighbors need it to join the network. When the sensor node $s_j$ joins the network, it broadcasts a mACTIVATE message to inform all of its 1-hop neighbors about its status change. Its neighbors execute the perimeter coverage model to recalculate its coverage level. If it finds any neighbor u that is useless in covering its perimeter, i.e., the perimeter that u covers was covered by other active neighbors, it will send mASK2SLEEP message to that sensor. When the sensor node receives mASK2SLEEP message, it updates its counter $n_i$, contribution $c_i$ to coverage level, and recalculate waiting time $w_i$. It then check if its $n_i$ is decreased to 0 or not. If $n_i$ of a sensor node is 0 (i.e., it receives mASK2SLEEP message from all of its neighbors), then it will send message mGOSLEEP to all of its neighbors telling them that it is about to go to sleep, and set a timer $R_i$ for waking up in next round and at last go to sleep. If the sensor node receives mGOSLEEP message, it removes the neighbor sending that message out of its list L. All the sensors have to decide its status in the decision phase. After that, the active sensors perform the sensing task during the sensing phase. - +The period the average \begin{table}