Update by Ali

diff --git a/CHAPITRE_01.tex b/CHAPITRE_01.tex
index 996d91ddab23912c90f4bb0833ff97be20b01f31..aedf97f840c2162debcaab7c5f2913818f8f84df 100644 (file)
--- a/CHAPITRE_01.tex
+++ b/CHAPITRE_01.tex
@@ -458,26 +458,27 @@ The coverage protocols proposed in this dissertation use the binary disc sensing
 \begin{enumerate}[(i)]
 \item $\textbf{Coverage Type}$ Is the WSN dedicated to monitor a whole area, to observe a set of targets, or to look for a breach of a barrier?
  
 \begin{enumerate}[(i)]
 \item $\textbf{Coverage Type}$ Is the WSN dedicated to monitor a whole area, to observe a set of targets, or to look for a breach of a barrier?
  

-\item $\textbf{Deployment Method}$ refers to the way by which the wireless sensor nodes are deployed over the target sensing field in order to build the wireless sensor network. Generally, the sensor nodes can be placed either deterministically or randomly in the target sensing field~\cite{ref107}. The method of placement can be selected based on the type of sensors, application, and the environment. In the deterministic placement, the deployment can be achieved for a small number of sensor nodes and in friendly environment, whilst for a large number of sensor nodes or when the area of interest is inaccessible or hostile, a random placement is the choice. The sensor network can be either dense or sparse. The dense deployment is preferable when it is necessary to provide a security robustness in WSNs. On the other hand, the sparse deployment is used when the dense deployment is expensive or when the maximum coverage is performed by a less number of sensor nodes.
+\item $\textbf{Deployment Method}$ refers to the way by which the wireless sensor nodes are deployed over the target sensing field in order to build the wireless sensor network. Generally, the sensor nodes can be placed either deterministically or randomly in the target sensing field~\cite{ref107}. The method of placement can be selected based on the type of sensors, application, and the environment. In the deterministic placement, the deployment can be achieved for a small number of sensor nodes and in friendly environment, whilst for a large number of sensor nodes or when the area of interest is inaccessible or hostile, a random placement is the choice. The sensor network can be either dense or sparse. On the one hand, the dense deployment is preferable when it is necessary to provide a security robustness in WSNs. On the other hand, the sparse deployment is used when the dense deployment is expensive or when the maximum coverage is performed by a low number of sensor nodes.

 
 
 \item $\textbf{Coverage Degree}$ refers to how many sensor nodes are required to cover a target or an area. A point in the sensing field is said to be K-coverage by at least K sensor nodes. Some applications need a high reliability to achieve their tasks. Therefore, the sensing field is deployed densely so as to perform a K-coverage for this field. The simple coverage problem consists of a coverage degree equal to one (i.e., K=1), where every point in the sensing field is covered by at least one sensor.
 
 
 
 \item $\textbf{Coverage Degree}$ refers to how many sensor nodes are required to cover a target or an area. A point in the sensing field is said to be K-coverage by at least K sensor nodes. Some applications need a high reliability to achieve their tasks. Therefore, the sensing field is deployed densely so as to perform a K-coverage for this field. The simple coverage problem consists of a coverage degree equal to one (i.e., K=1), where every point in the sensing field is covered by at least one sensor.
 

-\item $\textbf{Coverage Ratio}$ is the percentage of the area of sensing field that fulfills the coverage degree of the application. If all the points in the sensing field are covered, the coverage ratio is $100\%$ and it can be called a complete coverage. Otherwise, it can be called as partial coverage.
+\item $\textbf{Coverage Ratio}$ is the percentage of the sensing field that fulfills the coverage degree of the application. If all the points in the sensing field are covered, the coverage ratio is $100\%$ and it can be called a complete coverage. Otherwise, it is said as partial coverage.

 
 

-\item $\textbf{Network Connectivity}$ is to ensure the existence of a path from any sensor node in WSN to the sink. The connected WSN refers to guarantee sending the sensed data from one sensor node to another sensor node directly toward the sink. 
+\item $\textbf{Network Connectivity}$ is to ensure the existence of a path from any sensor node in WSN to the sink. A connected WSN ensures the sending of the sending the sensed data from one sensor node to another sensor node directly toward the sink. 

 %It is necessary to consider the communication range of wireless sensor node is at least twice that of the sensing range ($R_c \geqslant 2R_s$) so as to imply connectivity among the sensor nodes during covering the sensing field~\cite{ref108}.
 
  
 %It is necessary to consider the communication range of wireless sensor node is at least twice that of the sensing range ($R_c \geqslant 2R_s$) so as to imply connectivity among the sensor nodes during covering the sensing field~\cite{ref108}.
 
  

-\item $\textbf{Activity based Scheduling}$ is to schedule the activation and deactivation of sensor nodes during the network lifetime. The basic objective is to decide which sensors are in what states (active or sleeping mode) and for how long, so that the application coverage requirement can be guaranteed and the network lifetime can be prolonged. Various  centralized, distributed, and localized approaches have been proposed for activity scheduling. In distributed algorithms, each node in the network autonomously makes decisions on whether to turn on or turn off itself only using local neighbor information. In centralized algorithms, a central controller (a node or base station) informs every sensor of the time intervals to be activated.
-This dissertation deals with activity based scheduling to ensure the best coverage in WSNs.
+\item $\textbf{Activity based Scheduling}$ is to schedule the activation and deactivation of sensor nodes during the network lifetime. The basic objective is to decide which sensors are in what states (active or sleeping mode) and for how long, so that the application coverage requirement can be guaranteed and the network lifetime can be prolonged. Various  centralized, distributed, and localized approaches have been proposed for activity scheduling. In distributed algorithms, each node in the network autonomously makes decisions on whether to turn on or turn off itself, using only local neighbor information. In centralized algorithms, a central controller (a node or base station) informs every sensor of the time intervals to be activated.
+This dissertation deals with activity based scheduling to ensure the best coverage.

 
 \end{enumerate}
 
 \section{Energy Consumption Modeling} 
 \label{ch1:sec:9}
 %\indent The WSNs have been received a lot of interests because the low energy consumption of the sensor nodes.  
 
 \end{enumerate}
 
 \section{Energy Consumption Modeling} 
 \label{ch1:sec:9}
 %\indent The WSNs have been received a lot of interests because the low energy consumption of the sensor nodes.  

-One of the most critical issues in WSNs is to reduce the energy consumption of the limited power battery of the sensor nodes so as to prolong the network lifetime as long as possible. In order to model the energy consumption, four states for a sensor node are used~\cite{ref140}:  transmission, reception, listening, and sleeping. In addition, two states should be taken into account: computation and sensed data acquisition. The main tasks of each of these states include:
+%One of the most critical issues in WSNs is to reduce the energy consumption of the limited power battery of the sensor nodes so as to prolong the network lifetime as long as possible. 
+In order to model the energy consumption, four states for a sensor node are used~\cite{ref140}:  transmission, reception, listening, and sleeping. In addition, two states should be taken into account: computation and data acquisition. The main tasks of each of these states include:

 
 \begin{enumerate}[(i)]
 
 
 \begin{enumerate}[(i)]
 


@@ -491,7 +492,7 @@ One of the most critical issues in WSNs is to reduce the energy consumption of t
 
 \item Data Acquisition: sensing, processing sensed data, analog to digital conversion, preprocessing, and maybe storing.
 
 
 \item Data Acquisition: sensing, processing sensed data, analog to digital conversion, preprocessing, and maybe storing.
 

-\item Sleeping: a low power to the sensor node to stay alive.
+\item Sleeping: a low power level allowing the sensor node to stay alive.

 
 
 
 
 
 


@@ -510,7 +511,7 @@ One of the most critical issues in WSNs is to reduce the energy consumption of t
 \label{RDM}
 \end{figure}
 
 \label{RDM}
 \end{figure}
 

-\indent In this model, the radio consumes energy to execute the transmitter and the power amplifier. The receiver circuitry consumes energy to run the radio electronics, as described in figure~\ref{RDM}.  The channel model can be either free space ($d^2$ power loss) or multipath fading ($d^4$ power loss), based on the distance between the transmitter and receiver. This power loss can be controlled by setting the power amplifier so that if the distance is less than a threshold ($d_0$), the free space ($\varepsilon_{fs}$) model is used (i.e., $\varepsilon_{amp}$ = $\varepsilon_{fs}$); Otherwise, the multipath ($\varepsilon_{mp}$) model is used (i.e., $\varepsilon_{amp}$ = $\varepsilon_{mp}$). Therefore, to transmit a K-bit packet with a distance d, the radio expends
+\indent In this model, the radio consumes energy to execute the transmitter and the power amplifier. The receiver circuitry consumes energy to run the radio electronics, as described in figure~\ref{RDM}.  The channel model can be either free space ($d^2$ power loss) or multipath fading ($d^4$ power loss), based on the distance between the transmitter and receiver. This power loss can be controlled by setting the power amplifier so that if the distance is less than a threshold ($d_0$), the free space ($\varepsilon_{fs}$) model is used (i.e., $\varepsilon_{amp}$ = $\varepsilon_{fs}$). Otherwise, the multipath ($\varepsilon_{mp}$) model is used (i.e., $\varepsilon_{amp}$ = $\varepsilon_{mp}$). Therefore, to transmit a K-bit packet across a distance d, the radio expends

 
 
 \begin{equation}
 
 
 \begin{equation}


@@ -522,17 +523,17 @@ E_{tx}\left(K,d \right)  = \left \{
 \label{eq3-ch1} 
 \end{equation}
 
 \label{eq3-ch1} 
 \end{equation}
 

-As well as to receive a K-bit packet, the radio expends
+while to receive a K-bit packet, the radio expends

 
 \begin{equation}
       E_{rx}\left(k,d \right)  =   \emph{ KE_{elec} }.   
 \label{eq4-ch1} 
 \end{equation}
 
 
 \begin{equation}
       E_{rx}\left(k,d \right)  =   \emph{ KE_{elec} }.   
 \label{eq4-ch1} 
 \end{equation}
 

-The typical parameters are set as: $E_{elec}$ = 50 nJ/bit, $\varepsilon_{fs}$ = 10 pJ/bit/$m^2$, $\varepsilon_{mp}$ = 0.0013 pJ/bit/$m^4$. In addition, the energy for data aggregation is set as $E_{DA}$ = 5 nJ/bit.
+\noindent The typical parameters are set as: $E_{elec}$ = 50 nJ/bit, $\varepsilon_{fs}$ = 10 pJ/bit/$m^2$, $\varepsilon_{mp}$ = 0.0013 pJ/bit/$m^4$. In addition, the energy for data aggregation is set as $E_{DA}$ = 5 nJ/bit.

 
 

-\indent The radio energy dissipation model considers only the energy consumed by the communication part of the sensor node. However, in order to achieve a more accurate model, it is necessary to take into account the energy consumed by other parts inside the sensor node such as computation unit and sensing unit. 
-In this dissertation, we developed another energy consumption model that proposed by~\cite{DESK} and based on \cite{ref112}.
+\indent The radio energy dissipation model considers only the energy consumed by the communication part of the sensor node. However, in order to achieve a more accurate model, it is necessary to take into account the energy consumed by other parts inside the sensor node such as computation and sensing units. 
+In this dissertation, we developed another energy consumption model that based on \cite{ref112}.

 %\subsection{Our Energy Consumption Model:}
 %\label{ch1:sec9:subsec2}
 
 %\subsection{Our Energy Consumption Model:}
 %\label{ch1:sec9:subsec2}
 


@@ -541,4 +542,6 @@ In this dissertation, we developed another energy consumption model that propose
 \section{Conclusion}
 \label{ch1:sec:10}
 
 \section{Conclusion}
 \label{ch1:sec:10}
 

-\indent In this chapter, an overview of the wireless sensor networks has been presented. Unlike traditional ad-hoc networks, WSNs are collaborative and very oriented toward a specific application domain. The structure of the typical wireless sensor network and the main components of the sensor nodes have been detailed. Several types of wireless sensor networks are described. Various fields of applications covering a wide spectrum for a WSNs including health, home, environmental, military, and industrial applications have been presented.  As shown, since sensor nodes have limited battery life; since it is impossible to replace batteries, especially in remote and hostile environments; the limited power of a battery represents the critical challenge in WSNs. The main challenges in WSNs have explained. Energy efficiency is the primary challenge to increase the network lifetime. Therefore, the energy efficient solutions have proposed in order to handle that challenge. Many energy efficient mechanisms have been illustrated, which are aimed to reduce the energy consumption of the different parts of the wireless sensor nodes in WSNs. The definition of the network lifetime has been presented and in different contexts.  The problem of the coverage in WSNs is explained.  One of the main scientific research challenges in WSNs is how to build energy efficient coverage protocols. This chapter highlights the main design issues for the coverage problems that need to be considered in designing a coverage protocol for WSNs. In addition, the energy consumption modeling have been illustrated. 
\ No newline at end of file
+\indent In this chapter an overview of the wireless sensor networks has been presented. Unlike traditional ad-hoc networks, WSNs are collaborative and very oriented toward a specific application domain. The structure of the typical wireless sensor network and the main components of the sensor nodes have been detailed. Several types of wireless sensor networks are described. Various fields of applications covering a wide spectrum including health, home, environmental, military, and industrial applications have been presented.  As shown, since sensor nodes have limited battery life; since it is impossible to replace batteries, especially in remote and hostile environments; the limited power of a battery represents the critical challenge in WSNs. The main challenges in WSNs have been explained. Energy efficiency is the primary challenge to increase the network lifetime. Therefore, energy efficient solutions have been proposed in order to handle that challenge. Many energy efficient mechanisms have been illustrated, which are aimed to reduce the energy consumption of the different parts of the wireless sensor nodes. The definition of the network lifetime has been presented in different contexts.  The problem of the coverage in WSNs is also explained.  
+%One of the main scientific research challenges in WSNs is how to build energy efficient coverage protocols. 
+This chapter highlights the main design issues that need to be considered when designing an energy efficient coverage protocol for WSNs. In addition, energy consumption models have been discussed. 
\ No newline at end of file

diff --git a/Thesis.toc b/Thesis.toc
index 539eaadb969a5f03c077a8d08b3b671da5cc9fce..d8f9a79e07586f863dbaea928d21bdba4530ab36 100644 (file)
--- a/Thesis.toc
+++ b/Thesis.toc
@@ -12,95 +12,95 @@
 \contentsline {part}{I\hspace {1em}Scientific Background}{15}{part.1}
 \contentsline {chapter}{\numberline {1}Wireless Sensor Networks}{17}{chapter.1}
 \contentsline {section}{\numberline {1.1}Introduction}{17}{section.1.1}
 \contentsline {part}{I\hspace {1em}Scientific Background}{15}{part.1}
 \contentsline {chapter}{\numberline {1}Wireless Sensor Networks}{17}{chapter.1}
 \contentsline {section}{\numberline {1.1}Introduction}{17}{section.1.1}

-\contentsline {section}{\numberline {1.2}Wireless Sensor Network Architecture}{18}{section.1.2}
+\contentsline {section}{\numberline {1.2}Architecture}{18}{section.1.2}

 \contentsline {section}{\numberline {1.3}Types of Wireless Sensor Networks}{20}{section.1.3}
 \contentsline {section}{\numberline {1.3}Types of Wireless Sensor Networks}{20}{section.1.3}

-\contentsline {section}{\numberline {1.4}Wireless Sensor Network Applications}{22}{section.1.4}
-\contentsline {section}{\numberline {1.5}The Main Challenges in Wireless Sensor Networks}{25}{section.1.5}
-\contentsline {section}{\numberline {1.6}Energy-Efficient Mechanisms in Wireless Sensor Networks}{27}{section.1.6}
+\contentsline {section}{\numberline {1.4}Applications}{22}{section.1.4}
+\contentsline {section}{\numberline {1.5}The Main Challenges}{25}{section.1.5}
+\contentsline {section}{\numberline {1.6}Energy-Efficient Mechanisms of a working WSN}{26}{section.1.6}

 \contentsline {subsection}{\numberline {1.6.1}Energy-Efficient Routing}{27}{subsection.1.6.1}
 \contentsline {subsubsection}{\numberline {1.6.1.1}Routing Metric based on Residual Energy}{27}{subsubsection.1.6.1.1}
 \contentsline {subsection}{\numberline {1.6.1}Energy-Efficient Routing}{27}{subsection.1.6.1}
 \contentsline {subsubsection}{\numberline {1.6.1.1}Routing Metric based on Residual Energy}{27}{subsubsection.1.6.1.1}

-\contentsline {subsubsection}{\numberline {1.6.1.2}Multipath Routing}{28}{subsubsection.1.6.1.2}
-\contentsline {subsection}{\numberline {1.6.2}Cluster Architectures}{28}{subsection.1.6.2}
+\contentsline {subsubsection}{\numberline {1.6.1.2}Multipath Routing}{27}{subsubsection.1.6.1.2}
+\contentsline {subsection}{\numberline {1.6.2}Cluster Architecture}{28}{subsection.1.6.2}

 \contentsline {subsection}{\numberline {1.6.3}Scheduling Schemes}{28}{subsection.1.6.3}
 \contentsline {subsection}{\numberline {1.6.3}Scheduling Schemes}{28}{subsection.1.6.3}

-\contentsline {subsubsection}{\numberline {1.6.3.1}Wake up Scheduling Schemes}{29}{subsubsection.1.6.3.1}
+\contentsline {subsubsection}{\numberline {1.6.3.1}Wake up Scheduling Schemes}{28}{subsubsection.1.6.3.1}

 \contentsline {subsubsection}{\numberline {1.6.3.2}Topology Control Schemes}{31}{subsubsection.1.6.3.2}
 \contentsline {subsubsection}{\numberline {1.6.3.2}Topology Control Schemes}{31}{subsubsection.1.6.3.2}

-\contentsline {subsection}{\numberline {1.6.4}Data-Driven Schemes}{32}{subsection.1.6.4}
-\contentsline {subsubsection}{\numberline {1.6.4.1}Data Reduction Schemes}{32}{subsubsection.1.6.4.1}
+\contentsline {subsection}{\numberline {1.6.4}Data-Driven Schemes}{31}{subsection.1.6.4}
+\contentsline {subsubsection}{\numberline {1.6.4.1}Data Reduction Schemes}{31}{subsubsection.1.6.4.1}

 \contentsline {subsubsection}{\numberline {1.6.4.2}Energy Efficient Data Acquisition Schemes}{32}{subsubsection.1.6.4.2}
 \contentsline {subsection}{\numberline {1.6.5}Battery Repletion}{32}{subsection.1.6.5}
 \contentsline {subsubsection}{\numberline {1.6.4.2}Energy Efficient Data Acquisition Schemes}{32}{subsubsection.1.6.4.2}
 \contentsline {subsection}{\numberline {1.6.5}Battery Repletion}{32}{subsection.1.6.5}

-\contentsline {subsubsection}{\numberline {1.6.5.1}Energy Harvesting}{33}{subsubsection.1.6.5.1}
-\contentsline {subsubsection}{\numberline {1.6.5.2}Wireless Charging}{33}{subsubsection.1.6.5.2}
-\contentsline {subsection}{\numberline {1.6.6}Radio Optimization}{33}{subsection.1.6.6}
+\contentsline {subsubsection}{\numberline {1.6.5.1}Energy Harvesting}{32}{subsubsection.1.6.5.1}
+\contentsline {subsubsection}{\numberline {1.6.5.2}Wireless Charging}{32}{subsubsection.1.6.5.2}
+\contentsline {subsection}{\numberline {1.6.6}Radio Optimization}{32}{subsection.1.6.6}

 \contentsline {subsection}{\numberline {1.6.7}Relay nodes and Sink Mobility}{33}{subsection.1.6.7}
 \contentsline {subsubsection}{\numberline {1.6.7.1}Relay node placement}{33}{subsubsection.1.6.7.1}
 \contentsline {subsubsection}{\numberline {1.6.7.2}Sink Mobility}{33}{subsubsection.1.6.7.2}
 \contentsline {subsection}{\numberline {1.6.7}Relay nodes and Sink Mobility}{33}{subsection.1.6.7}
 \contentsline {subsubsection}{\numberline {1.6.7.1}Relay node placement}{33}{subsubsection.1.6.7.1}
 \contentsline {subsubsection}{\numberline {1.6.7.2}Sink Mobility}{33}{subsubsection.1.6.7.2}

-\contentsline {section}{\numberline {1.7}Network Lifetime in Wireless Sensor Networks}{34}{section.1.7}
-\contentsline {section}{\numberline {1.8}Coverage in Wireless Sensor Networks }{35}{section.1.8}
+\contentsline {section}{\numberline {1.7}Network Lifetime}{33}{section.1.7}
+\contentsline {section}{\numberline {1.8}Coverage in Wireless Sensor Networks }{34}{section.1.8}

 \contentsline {section}{\numberline {1.9}Design Issues for Coverage Problems}{36}{section.1.9}
 \contentsline {section}{\numberline {1.10}Energy Consumption Modeling}{37}{section.1.10}
 \contentsline {section}{\numberline {1.9}Design Issues for Coverage Problems}{36}{section.1.9}
 \contentsline {section}{\numberline {1.10}Energy Consumption Modeling}{37}{section.1.10}

-\contentsline {section}{\numberline {1.11}Conclusion}{39}{section.1.11}
-\contentsline {chapter}{\numberline {2}Related Works on Coverage Problems}{41}{chapter.2}
-\contentsline {section}{\numberline {2.1}Introduction}{41}{section.2.1}
-\contentsline {section}{\numberline {2.2}Centralized Algorithms}{43}{section.2.2}
-\contentsline {section}{\numberline {2.3}Distributed Algorithms}{46}{section.2.3}
-\contentsline {subsection}{\numberline {2.3.1}GAF}{48}{subsection.2.3.1}
-\contentsline {subsection}{\numberline {2.3.2}DESK}{50}{subsection.2.3.2}
-\contentsline {section}{\numberline {2.4}Conclusion}{52}{section.2.4}
-\contentsline {chapter}{\numberline {3}Evaluation Tools and Optimization Solvers}{55}{chapter.3}
-\contentsline {section}{\numberline {3.1}Introduction}{55}{section.3.1}
-\contentsline {section}{\numberline {3.2}Evaluation Tools}{55}{section.3.2}
-\contentsline {subsection}{\numberline {3.2.1}Testbed Tools}{56}{subsection.3.2.1}
-\contentsline {subsection}{\numberline {3.2.2}Simulation Tools}{57}{subsection.3.2.2}
-\contentsline {section}{\numberline {3.3}Optimization Solvers}{60}{section.3.3}
-\contentsline {section}{\numberline {3.4}Conclusion}{65}{section.3.4}
-\contentsline {part}{II\hspace {1em}Contributions}{67}{part.2}
-\contentsline {chapter}{\numberline {4}Distributed Lifetime Coverage Optimization Protocol in Wireless Sensor Networks}{69}{chapter.4}
-\contentsline {section}{\numberline {4.1}Introduction}{69}{section.4.1}
-\contentsline {section}{\numberline {4.2}Description of the DiLCO Protocol}{70}{section.4.2}
-\contentsline {subsection}{\numberline {4.2.1}Assumptions and Network Model}{70}{subsection.4.2.1}
-\contentsline {subsection}{\numberline {4.2.2}Primary Point Coverage Model}{71}{subsection.4.2.2}
-\contentsline {subsection}{\numberline {4.2.3}Main Idea}{72}{subsection.4.2.3}
-\contentsline {subsubsection}{\numberline {4.2.3.1}Information Exchange Phase}{73}{subsubsection.4.2.3.1}
-\contentsline {subsubsection}{\numberline {4.2.3.2}Leader Election Phase}{73}{subsubsection.4.2.3.2}
-\contentsline {subsubsection}{\numberline {4.2.3.3}Decision phase}{73}{subsubsection.4.2.3.3}
-\contentsline {subsubsection}{\numberline {4.2.3.4}Sensing phase}{73}{subsubsection.4.2.3.4}
-\contentsline {section}{\numberline {4.3}Primary Points based Coverage Problem Formulation}{74}{section.4.3}
-\contentsline {section}{\numberline {4.4}Simulation Results and Analysis}{76}{section.4.4}
-\contentsline {subsection}{\numberline {4.4.1}Simulation Framework}{76}{subsection.4.4.1}
-\contentsline {subsection}{\numberline {4.4.2}Modeling Language and Optimization Solver}{76}{subsection.4.4.2}
-\contentsline {subsection}{\numberline {4.4.3}Energy Consumption Model}{76}{subsection.4.4.3}
-\contentsline {subsection}{\numberline {4.4.4}Performance Metrics}{77}{subsection.4.4.4}
-\contentsline {subsection}{\numberline {4.4.5}Performance Analysis for Different Subregions}{78}{subsection.4.4.5}
-\contentsline {subsection}{\numberline {4.4.6}Performance Analysis for Primary Point Models}{84}{subsection.4.4.6}
-\contentsline {subsection}{\numberline {4.4.7}Performance Comparison with other Approaches}{89}{subsection.4.4.7}
-\contentsline {section}{\numberline {4.5}Conclusion}{95}{section.4.5}
-\contentsline {chapter}{\numberline {5}Multiround Distributed Lifetime Coverage Optimization Protocol in Wireless Sensor Networks}{97}{chapter.5}
-\contentsline {section}{\numberline {5.1}Introduction}{97}{section.5.1}
-\contentsline {section}{\numberline {5.2}MuDiLCO Protocol Description}{98}{section.5.2}
-\contentsline {subsection}{\numberline {5.2.1}Background Idea and Algorithm}{98}{subsection.5.2.1}
-\contentsline {section}{\numberline {5.3}Primary Points based Multiround Coverage Problem Formulation}{99}{section.5.3}
-\contentsline {section}{\numberline {5.4}Experimental Study and Analysis}{101}{section.5.4}
-\contentsline {subsection}{\numberline {5.4.1}Simulation Setup}{101}{subsection.5.4.1}
-\contentsline {subsection}{\numberline {5.4.2}Metrics}{102}{subsection.5.4.2}
-\contentsline {subsection}{\numberline {5.4.3}Results Analysis and Comparison }{103}{subsection.5.4.3}
-\contentsline {section}{\numberline {5.5}Conclusion}{108}{section.5.5}
-\contentsline {chapter}{\numberline {6}Perimeter-based Coverage Optimization to Improve Lifetime in Wireless Sensor Networks}{111}{chapter.6}
-\contentsline {section}{\numberline {6.1}Introduction}{111}{section.6.1}
-\contentsline {section}{\numberline {6.2}The PeCO Protocol Description}{112}{section.6.2}
-\contentsline {subsection}{\numberline {6.2.1}Assumptions and Models}{112}{subsection.6.2.1}
-\contentsline {subsection}{\numberline {6.2.2}The Main Idea}{115}{subsection.6.2.2}
-\contentsline {subsection}{\numberline {6.2.3}PeCO Protocol Algorithm}{115}{subsection.6.2.3}
-\contentsline {section}{\numberline {6.3}Perimeter-based Coverage Problem Formulation}{116}{section.6.3}
-\contentsline {section}{\numberline {6.4}Performance Evaluation and Analysis}{118}{section.6.4}
-\contentsline {subsection}{\numberline {6.4.1}Simulation Settings}{118}{subsection.6.4.1}
-\contentsline {subsection}{\numberline {6.4.2}Simulation Results}{119}{subsection.6.4.2}
-\contentsline {subsubsection}{\numberline {6.4.2.1}Coverage Ratio}{120}{subsubsection.6.4.2.1}
-\contentsline {subsubsection}{\numberline {6.4.2.2}Active Sensors Ratio}{120}{subsubsection.6.4.2.2}
-\contentsline {subsubsection}{\numberline {6.4.2.3}The Energy Consumption}{121}{subsubsection.6.4.2.3}
-\contentsline {subsubsection}{\numberline {6.4.2.4}The Network Lifetime}{121}{subsubsection.6.4.2.4}
-\contentsline {section}{\numberline {6.5}Conclusion}{124}{section.6.5}
-\contentsline {part}{III\hspace {1em}Conclusion and Perspectives}{125}{part.3}
-\contentsline {chapter}{\numberline {7}Conclusion and Perspectives}{127}{chapter.7}
-\contentsline {section}{\numberline {7.1}Conclusion}{127}{section.7.1}
-\contentsline {section}{\numberline {7.2}Perspectives}{128}{section.7.2}
-\contentsline {part}{Bibliographie}{144}{chapter*.11}
+\contentsline {section}{\numberline {1.11}Conclusion}{38}{section.1.11}
+\contentsline {chapter}{\numberline {2}Related Works on Coverage Problems}{39}{chapter.2}
+\contentsline {section}{\numberline {2.1}Introduction}{39}{section.2.1}
+\contentsline {section}{\numberline {2.2}Centralized Algorithms}{41}{section.2.2}
+\contentsline {section}{\numberline {2.3}Distributed Algorithms}{44}{section.2.3}
+\contentsline {subsection}{\numberline {2.3.1}GAF}{46}{subsection.2.3.1}
+\contentsline {subsection}{\numberline {2.3.2}DESK}{48}{subsection.2.3.2}
+\contentsline {section}{\numberline {2.4}Conclusion}{50}{section.2.4}
+\contentsline {chapter}{\numberline {3}Evaluation Tools and Optimization Solvers}{53}{chapter.3}
+\contentsline {section}{\numberline {3.1}Introduction}{53}{section.3.1}
+\contentsline {section}{\numberline {3.2}Evaluation Tools}{53}{section.3.2}
+\contentsline {subsection}{\numberline {3.2.1}Testbed Tools}{54}{subsection.3.2.1}
+\contentsline {subsection}{\numberline {3.2.2}Simulation Tools}{55}{subsection.3.2.2}
+\contentsline {section}{\numberline {3.3}Optimization Solvers}{58}{section.3.3}
+\contentsline {section}{\numberline {3.4}Conclusion}{63}{section.3.4}
+\contentsline {part}{II\hspace {1em}Contributions}{65}{part.2}
+\contentsline {chapter}{\numberline {4}Distributed Lifetime Coverage Optimization Protocol in Wireless Sensor Networks}{67}{chapter.4}
+\contentsline {section}{\numberline {4.1}Introduction}{67}{section.4.1}
+\contentsline {section}{\numberline {4.2}Description of the DiLCO Protocol}{68}{section.4.2}
+\contentsline {subsection}{\numberline {4.2.1}Assumptions and Network Model}{68}{subsection.4.2.1}
+\contentsline {subsection}{\numberline {4.2.2}Primary Point Coverage Model}{69}{subsection.4.2.2}
+\contentsline {subsection}{\numberline {4.2.3}Main Idea}{70}{subsection.4.2.3}
+\contentsline {subsubsection}{\numberline {4.2.3.1}Information Exchange Phase}{71}{subsubsection.4.2.3.1}
+\contentsline {subsubsection}{\numberline {4.2.3.2}Leader Election Phase}{71}{subsubsection.4.2.3.2}
+\contentsline {subsubsection}{\numberline {4.2.3.3}Decision phase}{71}{subsubsection.4.2.3.3}
+\contentsline {subsubsection}{\numberline {4.2.3.4}Sensing phase}{71}{subsubsection.4.2.3.4}
+\contentsline {section}{\numberline {4.3}Primary Points based Coverage Problem Formulation}{72}{section.4.3}
+\contentsline {section}{\numberline {4.4}Simulation Results and Analysis}{74}{section.4.4}
+\contentsline {subsection}{\numberline {4.4.1}Simulation Framework}{74}{subsection.4.4.1}
+\contentsline {subsection}{\numberline {4.4.2}Modeling Language and Optimization Solver}{74}{subsection.4.4.2}
+\contentsline {subsection}{\numberline {4.4.3}Energy Consumption Model}{74}{subsection.4.4.3}
+\contentsline {subsection}{\numberline {4.4.4}Performance Metrics}{75}{subsection.4.4.4}
+\contentsline {subsection}{\numberline {4.4.5}Performance Analysis for Different Subregions}{76}{subsection.4.4.5}
+\contentsline {subsection}{\numberline {4.4.6}Performance Analysis for Primary Point Models}{82}{subsection.4.4.6}
+\contentsline {subsection}{\numberline {4.4.7}Performance Comparison with other Approaches}{87}{subsection.4.4.7}
+\contentsline {section}{\numberline {4.5}Conclusion}{93}{section.4.5}
+\contentsline {chapter}{\numberline {5}Multiround Distributed Lifetime Coverage Optimization Protocol in Wireless Sensor Networks}{95}{chapter.5}
+\contentsline {section}{\numberline {5.1}Introduction}{95}{section.5.1}
+\contentsline {section}{\numberline {5.2}MuDiLCO Protocol Description}{96}{section.5.2}
+\contentsline {subsection}{\numberline {5.2.1}Background Idea and Algorithm}{96}{subsection.5.2.1}
+\contentsline {section}{\numberline {5.3}Primary Points based Multiround Coverage Problem Formulation}{97}{section.5.3}
+\contentsline {section}{\numberline {5.4}Experimental Study and Analysis}{99}{section.5.4}
+\contentsline {subsection}{\numberline {5.4.1}Simulation Setup}{99}{subsection.5.4.1}
+\contentsline {subsection}{\numberline {5.4.2}Metrics}{100}{subsection.5.4.2}
+\contentsline {subsection}{\numberline {5.4.3}Results Analysis and Comparison }{101}{subsection.5.4.3}
+\contentsline {section}{\numberline {5.5}Conclusion}{106}{section.5.5}
+\contentsline {chapter}{\numberline {6}Perimeter-based Coverage Optimization to Improve Lifetime in Wireless Sensor Networks}{109}{chapter.6}
+\contentsline {section}{\numberline {6.1}Introduction}{109}{section.6.1}
+\contentsline {section}{\numberline {6.2}The PeCO Protocol Description}{110}{section.6.2}
+\contentsline {subsection}{\numberline {6.2.1}Assumptions and Models}{110}{subsection.6.2.1}
+\contentsline {subsection}{\numberline {6.2.2}The Main Idea}{113}{subsection.6.2.2}
+\contentsline {subsection}{\numberline {6.2.3}PeCO Protocol Algorithm}{113}{subsection.6.2.3}
+\contentsline {section}{\numberline {6.3}Perimeter-based Coverage Problem Formulation}{114}{section.6.3}
+\contentsline {section}{\numberline {6.4}Performance Evaluation and Analysis}{116}{section.6.4}
+\contentsline {subsection}{\numberline {6.4.1}Simulation Settings}{116}{subsection.6.4.1}
+\contentsline {subsection}{\numberline {6.4.2}Simulation Results}{117}{subsection.6.4.2}
+\contentsline {subsubsection}{\numberline {6.4.2.1}Coverage Ratio}{118}{subsubsection.6.4.2.1}
+\contentsline {subsubsection}{\numberline {6.4.2.2}Active Sensors Ratio}{118}{subsubsection.6.4.2.2}
+\contentsline {subsubsection}{\numberline {6.4.2.3}The Energy Consumption}{119}{subsubsection.6.4.2.3}
+\contentsline {subsubsection}{\numberline {6.4.2.4}The Network Lifetime}{119}{subsubsection.6.4.2.4}
+\contentsline {section}{\numberline {6.5}Conclusion}{122}{section.6.5}
+\contentsline {part}{III\hspace {1em}Conclusion and Perspectives}{123}{part.3}
+\contentsline {chapter}{\numberline {7}Conclusion and Perspectives}{125}{chapter.7}
+\contentsline {section}{\numberline {7.1}Conclusion}{125}{section.7.1}
+\contentsline {section}{\numberline {7.2}Perspectives}{126}{section.7.2}
+\contentsline {part}{Bibliographie}{142}{chapter*.11}