X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/ThesisAli.git/blobdiff_plain/6cacb63d8ed60c9822de6be85af0c827783658df..7976cef0966cf4550fcfd57c22cebce39f5fc3c3:/CHAPITRE_05.tex

diff --git a/CHAPITRE_05.tex b/CHAPITRE_05.tex
old mode 100755
new mode 100644
index ba1dc5a..91014fb
--- a/CHAPITRE_05.tex
+++ b/CHAPITRE_05.tex
@@ -7,19 +7,6 @@
 \chapter{Multiround Distributed Lifetime Coverage Optimization Protocol in Wireless Sensor Networks}
 \label{ch5}
 
-\iffalse
-
-\section{Summary}
-\label{ch5:sec:01}
-Coverage and lifetime are two paramount problems in Wireless  Sensor Networks (WSNs). In this paper, a method called Multiround Distributed Lifetime Coverage
-Optimization  protocol (MuDiLCO)  is proposed  to maintain  the coverage  and to improve the lifetime in wireless sensor  networks. The area of interest is first
-divided  into subregions and  then the  MuDiLCO protocol  is distributed  on the sensor nodes in each subregion. The proposed MuDiLCO protocol works in periods
-during which sets of sensor nodes are scheduled to remain active for a number of rounds  during the  sensing phase,  to ensure coverage  so as  to maximize the
-lifetime of  WSN. The decision process is  carried out by a  leader node, which solves an  integer program to  produce the best  representative sets to  be used
-during the rounds  of the sensing phase. Compared  with some existing protocols, simulation  results based  on  multiple criteria  (energy consumption,  coverage
-ratio, and  so on) show that  the proposed protocol can  prolong efficiently the network lifetime and improve the coverage performance.
-
-\fi
 
 \section{Introduction}
 \label{ch5:sec:01}
@@ -45,9 +32,10 @@ regions to turn-off redundant sensor nodes  and thus save energy. In this paper,
 we concentrate  on the area coverage  problem, with the  objective of maximizing
 the network lifetime by using an optimized multiround scheduling.
 
-We study the problem of designing an energy-efficient optimization algorithm that divides the sensors in a WSN into multiple cover sets such that the area of interest is monitored as long as possible. Providing multiple cover sets can be used to improve the energy efficiency of WSNs. Therefore, in order to increase the longevity of the WSN and conserve the energy, it can be useful to provide multiple cover sets in one time after that schedule them for multiple rounds, so that the battery life of a sensor is not wasted due to the repeated execution of the coverage optimization algorithm, as well as the information exchange and leader election.
+We study the problem of designing an energy-efficient optimization algorithm that divides the sensor nodes in a WSN into multiple cover sets such that the area of interest is monitored as long as possible. Providing multiple cover sets can be used to improve the energy efficiency of WSNs. Therefore, in order to increase the longevity of the WSN and conserve the energy, it can be useful to provide multiple cover sets in one time after that schedule them for multiple rounds, so that the battery life of a sensor is not wasted due to the repeated execution of the coverage optimization algorithm, as well as the information exchange and leader election.
+
+The MuDiLCO protocol (for Multiround Distributed Lifetime Coverage Optimization protocol) presented in this chapter is an extension of the approach introduced in chapter 4. Simulation results have shown that it was more interesting to divide the area into several subregions, given the computation complexity. Compared to our protocol in chapter 4, in this one we study the possibility of dividing the sensing phase into multiple rounds. In fact, in this chapter we make a multiround optimization while it was a single round optimization in our protocol in chapter 4.
 
-The MuDiLCO protocol (for Multiround Distributed Lifetime Coverage Optimization protocol) presented in this chapter is an extension of the approach introduced in chapter 4. Simulation results have shown that it was more interesting to divide the area into several subregions, given the computation complexity. Compared to our protocol in chapter 4, in this one we study the possibility of dividing the sensing phase into multiple rounds. In fact, in this chapter we make a multiround optimization, while it was a single round optimization in our protocol in chapter 4.
 
 The remainder of the chapter continues with section \ref{ch5:sec:02} where a detail of MuDiLCO Protocol is presented. The next section describes the Primary Points based Multiround Coverage Problem formulation  which is used to schedule the activation of sensors in T cover sets. Section \ref{ch5:sec:04} shows the simulation
 results. The chapter ends with a conclusion and some suggestions for further work.
@@ -56,10 +44,6 @@ results. The chapter ends with a conclusion and some suggestions for further wor
  
 
 
-
-
-
-
 \section{MuDiLCO Protocol Description}
 \label{ch5:sec:02}
 \noindent In this section, we introduce the MuDiLCO protocol which is distributed on each subregion in the area of interest. It is based on two energy-efficient
@@ -271,8 +255,7 @@ large compared to $W_{\theta}$.
 \label{ch5:sec:04:01}
 We  conducted  a  series of  simulations  to  evaluate  the efficiency  and  the
 relevance  of our  approach,  using  the  discrete   event  simulator  OMNeT++
-\cite{ref158}. The simulation  parameters are summarized in Table~\ref{table3}.  Each experiment  for  a network  is  run over  25~different random topologies and  the results presented hereafter are  the average of these
-25 runs.
+\cite{ref158}. The simulation  parameters are summarized in Table~\ref{table3}.  Each experiment  for  a network  is  run over  25~different random topologies and  the results presented hereafter are  the average of these 25 runs.
 %Based on the results of our proposed work in~\cite{idrees2014coverage}, we found as the region of interest are divided into larger subregions as the network lifetime increased. In this simulation, the network are divided into 16 subregions. 
 We  performed  simulations for  five  different  densities  varying from  50  to
 250~nodes deployed  over  a  $50 \times  25~m^2  $  sensing field.  More
