From: Karine Deschinkel Date: Thu, 27 Aug 2015 09:57:49 +0000 (+0200) Subject: Merge branch 'master' of ssh://info.iut-bm.univ-fcomte.fr/JournalMultiPeriods X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/JournalMultiPeriods.git/commitdiff_plain/e922fb6744c31e70fef0af0686179ce3d60feae5?hp=-c Merge branch 'master' of ssh://info.iut-bm.univ-fcomte.fr/JournalMultiPeriods --- e922fb6744c31e70fef0af0686179ce3d60feae5 diff --combined article.tex index 29e8cb9,a60d560..520140e --- a/article.tex +++ b/article.tex @@@ -108,7 -108,7 +108,7 @@@ during which sets of sensor nodes are s rounds during the sensing phase, to ensure coverage so as to maximize the lifetime of WSN. \textcolor{green}{The decision process is carried out by a leader node, which solves an optimization problem to produce the best representative sets to be used -during the rounds of the sensing phase. The optimization problem formulated as an integer program is solved either to optimality through a branch-and-Bound method or to near-optimality using a genetic algorithm-based heuristic. } +during the rounds of the sensing phase. The optimization problem formulated as an integer program is solved to optimality through a branch-and-Bound method for small instances. For larger instances, the best feasible solution found by the solver after a given time limit threshold is considered. } %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. @@@ -306,7 -306,7 +306,7 @@@ possibility of dividing the sensing ph an improved model of energy consumption to assess the efficiency of our approach. In fact, in this paper we make a multiround optimization, while it was a single round optimization in our previous work. \textcolor{green}{The idea is to take advantage of the pre-sensing phase - to plan the sensor's activity for several rounds instead of one, thus saving energy. In addition, as the optimization problem has become more complex, a GA-based heuristic is proposed to solve it}. + to plan the sensor's activity for several rounds instead of one, thus saving energy. In addition, when the optimization problem becomes more complex, its resolution is stopped after a given time threshold}. \iffalse @@@ -538,10 -538,64 +538,64 @@@ Zhou~\cite{Zhang05} proved that if th hypothesis, a complete coverage of a convex area implies connectivity among the active nodes. - Instead of working with a continuous coverage area, we make it discrete by - considering for each sensor a set of points called primary points. Consequently, - we assume that the sensing disk defined by a sensor is covered if all of its - primary points are covered. The choice of number and locations of primary points is the subject of another study not presented here. + %Instead of working with a continuous coverage area, we make it discrete by considering for each sensor a set of points called primary points. Consequently, we assume that the sensing disk defined by a sensor is covered if all of its primary points are covered. The choice of number and locations of primary points is the subject of another study not presented here. + + + \indent Instead of working with the coverage area, we consider for each sensor a set of points called primary points~\cite{idrees2014coverage}. We also assume that the sensing disk defined by a sensor is covered if all the primary points of this sensor are covered. By knowing the position (point center: ($p_x,p_y$)) of a wireless sensor node and it's sensing range $R_s$, we calculate the primary points directly based on the proposed model. We use these primary points (that can be increased or decreased if necessary) as references to ensure that the monitored region of interest is covered by the selected set of sensors, instead of using all the points in the area. + We can calculate the positions of the selected primary + points in the circle disk of the sensing range of a wireless sensor + node (see Figure~\ref{fig1}) as follows:\\ + Assuming that the point center of a wireless sensor node is located at $(p_x,p_y)$, we can define up to 25 primary points $X_1$ to $X_{25}$.\\ + %$(p_x,p_y)$ = point center of wireless sensor node\\ + $X_1=(p_x,p_y)$ \\ + $X_2=( p_x + R_s * (1), p_y + R_s * (0) )$\\ + $X_3=( p_x + R_s * (-1), p_y + R_s * (0)) $\\ + $X_4=( p_x + R_s * (0), p_y + R_s * (1) )$\\ + $X_5=( p_x + R_s * (0), p_y + R_s * (-1 )) $\\ + $X_6= ( p_x + R_s * (\frac{-\sqrt{2}}{2}), p_y + R_s * (0)) $\\ + $X_7=( p_x + R_s * (\frac{\sqrt{2}}{2}), p_y + R_s * (0))$\\ + $X_8=( p_x + R_s * (\frac{-\sqrt{2}}{2}), p_y + R_s * (\frac{-\sqrt{2}}{2})) $\\ + $X_9=( p_x + R_s * (\frac{\sqrt{2}}{2}), p_y + R_s * (\frac{-\sqrt{2}}{2})) $\\ + $X_{10}=( p_x + R_s * (\frac{-\sqrt{2}}{2}), p_y + R_s * (\frac{\sqrt{2}}{2})) $\\ + $X_{11}=( p_x + R_s * (\frac{\sqrt{2}}{2}), p_y + R_s * (\frac{\sqrt{2}}{2})) $\\ + $X_{12}=( p_x + R_s * (0), p_y + R_s * (\frac{\sqrt{2}}{2})) $\\ + $X_{13}=( p_x + R_s * (0), p_y + R_s * (\frac{-\sqrt{2}}{2})) $\\ + $X_{14}=( p_x + R_s * (\frac{\sqrt{3}}{2}), p_y + R_s * (\frac{1}{2})) $\\ + $X_{15}=( p_x + R_s * (\frac{-\sqrt{3}}{2}), p_y + R_s * (\frac{1}{2})) $\\ + $X_{16}=( p_x + R_s * (\frac{\sqrt{3}}{2}), p_y + R_s * (\frac{- 1}{2})) $\\ + $X_{17}=( p_x + R_s * (\frac{-\sqrt{3}}{2}), p_y + R_s * (\frac{- 1}{2})) $\\ + $X_{18}=( p_x + R_s * (\frac{\sqrt{3}}{2}), p_y + R_s * (0) $\\ + $X_{19}=( p_x + R_s * (\frac{-\sqrt{3}}{2}), p_y + R_s * (0) $\\ + $X_{20}=( p_x + R_s * (0), p_y + R_s * (\frac{1}{2})) $\\ + $X_{21}=( p_x + R_s * (0), p_y + R_s * (-\frac{1}{2})) $\\ + $X_{22}=( p_x + R_s * (\frac{1}{2}), p_y + R_s * (\frac{\sqrt{3}}{2})) $\\ + $X_{23}=( p_x + R_s * (\frac{- 1}{2}), p_y + R_s * (\frac{\sqrt{3}}{2})) $\\ + $X_{24}=( p_x + R_s * (\frac{- 1}{2}), p_y + R_s * (\frac{-\sqrt{3}}{2})) $\\ + $X_{25}=( p_x + R_s * (\frac{1}{2}), p_y + R_s * (\frac{-\sqrt{3}}{2})) $. + + + + \begin{figure} %[h!] + \centering + \begin{multicols}{2} + \centering + \includegraphics[scale=0.28]{fig21.pdf}\\~ (a) + \includegraphics[scale=0.28]{principles13.pdf}\\~(c) + \hfill \hfill + \includegraphics[scale=0.28]{fig25.pdf}\\~(e) + \includegraphics[scale=0.28]{fig22.pdf}\\~(b) + \hfill \hfill + \includegraphics[scale=0.28]{fig24.pdf}\\~(d) + \includegraphics[scale=0.28]{fig26.pdf}\\~(f) + \end{multicols} + \caption{Wireless Sensor Node represented by (a) 5, (b) 9, (c) 13, (d) 17, (e) 21 and (f) 25 primary points respectively} + \label{fig1} + \end{figure} + + + + + %By knowing the position (point center: ($p_x,p_y$)) of a wireless %sensor node and its $R_s$, we calculate the primary points directly @@@ -658,26 -712,70 +712,26 @@@ consumption due to the communications \subsection{Decision phase} -Each WSNL will \textcolor{red}{ execute an optimization algorithm (see section \ref{oa})} to select which cover sets will be +Each WSNL will \textcolor{green}{ solve an integer program to select which cover sets will be activated in the following sensing phase to cover the subregion to which it -belongs. The \textcolor{red}{optimization algorithm} will produce $T$ cover sets, one for each round. The WSNL will send an Active-Sleep packet to each sensor in the subregion based on the algorithm's results, indicating if the sensor should be active or not in -each round of the sensing phase. +belongs. $T$ cover sets will be produced, one for each round. The WSNL will send an Active-Sleep packet to each sensor in the subregion based on the algorithm's results, indicating if the sensor should be active or not in +each round of the sensing phase. } +%Each WSNL will \textcolor{red}{ execute an optimization algorithm (see section \ref{oa})} to select which cover sets will be +%activated in the following sensing phase to cover the subregion to which it +%belongs. The \textcolor{red}{optimization algorithm} will produce $T$ cover sets, one for each round. The WSNL will send an Active-Sleep packet to each sensor in the subregion based on the algorithm's results, indicating if the sensor should be active or not in +%each round of the sensing phase. -%solve an integer program - -\subsection{Sensing phase} - -The sensing phase consists of $T$ rounds. Each sensor node in the subregion will -receive an Active-Sleep packet from WSNL, informing it to stay awake or to go to -sleep for each round of the sensing phase. Algorithm~\ref{alg:MuDiLCO}, which -will be executed by each node at the beginning of a period, explains how the -Active-Sleep packet is obtained. - -% In each round during the sensing phase, there is a cover set of sensor nodes, in which the active sensors will execute their sensing task to preserve maximal coverage and lifetime in the subregion and this will continue until finishing the round $T$ and starting new period. -\begin{algorithm}[h!] - % \KwIn{all the parameters related to information exchange} -% \KwOut{$winer-node$ (: the id of the winner sensor node, which is the leader of current round)} - \BlankLine - %\emph{Initialize the sensor node and determine it's position and subregion} \; - - \If{ $RE_j \geq E_{R}$ }{ - \emph{$s_j.status$ = COMMUNICATION}\; - \emph{Send $INFO()$ packet to other nodes in the subregion}\; - \emph{Wait $INFO()$ packet from other nodes in the subregion}\; - %\emph{UPDATE $RE_j$ for every sent or received INFO Packet}\; - %\emph{ Collect information and construct the list L for all nodes in the subregion}\; - - %\If{ the received INFO Packet = No. of nodes in it's subregion -1 }{ - \emph{LeaderID = Leader election}\; - \If{$ s_j.ID = LeaderID $}{ - \emph{$s_j.status$ = COMPUTATION}\; - \emph{$\left\{\left(X_{1,k},\dots,X_{T,k}\right)\right\}_{k \in J}$ = - Execute \textcolor{red}{Optimization Algorithm}($T,J$)}\; - \emph{$s_j.status$ = COMMUNICATION}\; - \emph{Send $ActiveSleep()$ to each node $k$ in subregion a packet \\ - with vector of activity scheduling $(X_{1,k},\dots,X_{T,k})$}\; - \emph{Update $RE_j $}\; - } - \Else{ - \emph{$s_j.status$ = LISTENING}\; - \emph{Wait $ActiveSleep()$ packet from the Leader}\; - % \emph{After receiving Packet, Retrieve the schedule and the $T$ rounds}\; - \emph{Update $RE_j $}\; - } - % } - } - \Else { Exclude $s_j$ from entering in the current sensing phase} - - % \emph{return X} \; -\caption{MuDiLCO($s_j$)} -\label{alg:MuDiLCO} +%solve an integer program -\end{algorithm} -\section{\textcolor{red}{ Optimization Algorithm for Multiround Lifetime Coverage Optimization}} -\label{oa} +%\section{\textcolor{red}{ Optimization Algorithm for Multiround Lifetime Coverage Optimization}} +%\label{oa} As shown in Algorithm~\ref{alg:MuDiLCO}, the leader will execute an optimization algorithm based on an integer program. The integer program is based on the model proposed by \cite{pedraza2006} with some modifications, where the objective is to find a maximum number of disjoint cover sets. To fulfill this goal, the @@@ -797,66 -895,14 +851,66 @@@ In our simulations priority is given t large compared to $W_{\theta}$. %The Active-Sleep packet includes the schedule vector with the number of rounds that should be applied by the receiving sensor node during the sensing phase. + +\subsection{Sensing phase} + +The sensing phase consists of $T$ rounds. Each sensor node in the subregion will +receive an Active-Sleep packet from WSNL, informing it to stay awake or to go to +sleep for each round of the sensing phase. Algorithm~\ref{alg:MuDiLCO}, which +will be executed by each node at the beginning of a period, explains how the +Active-Sleep packet is obtained. + +% In each round during the sensing phase, there is a cover set of sensor nodes, in which the active sensors will execute their sensing task to preserve maximal coverage and lifetime in the subregion and this will continue until finishing the round $T$ and starting new period. + +\begin{algorithm}[h!] + % \KwIn{all the parameters related to information exchange} +% \KwOut{$winer-node$ (: the id of the winner sensor node, which is the leader of current round)} + \BlankLine + %\emph{Initialize the sensor node and determine it's position and subregion} \; + + \If{ $RE_j \geq E_{R}$ }{ + \emph{$s_j.status$ = COMMUNICATION}\; + \emph{Send $INFO()$ packet to other nodes in the subregion}\; + \emph{Wait $INFO()$ packet from other nodes in the subregion}\; + %\emph{UPDATE $RE_j$ for every sent or received INFO Packet}\; + %\emph{ Collect information and construct the list L for all nodes in the subregion}\; + + %\If{ the received INFO Packet = No. of nodes in it's subregion -1 }{ + \emph{LeaderID = Leader election}\; + \If{$ s_j.ID = LeaderID $}{ + \emph{$s_j.status$ = COMPUTATION}\; + \emph{$\left\{\left(X_{1,k},\dots,X_{T,k}\right)\right\}_{k \in J}$ = + Execute \textcolor{red}{Optimization Algorithm}($T,J$)}\; + \emph{$s_j.status$ = COMMUNICATION}\; + \emph{Send $ActiveSleep()$ to each node $k$ in subregion a packet \\ + with vector of activity scheduling $(X_{1,k},\dots,X_{T,k})$}\; + \emph{Update $RE_j $}\; + } + \Else{ + \emph{$s_j.status$ = LISTENING}\; + \emph{Wait $ActiveSleep()$ packet from the Leader}\; + % \emph{After receiving Packet, Retrieve the schedule and the $T$ rounds}\; + \emph{Update $RE_j $}\; + } + % } + } + \Else { Exclude $s_j$ from entering in the current sensing phase} + + % \emph{return X} \; +\caption{MuDiLCO($s_j$)} +\label{alg:MuDiLCO} + +\end{algorithm} + +\iffalse \textcolor{red}{This integer program can be solved using two approaches:} \subsection{\textcolor{red}{Optimization solver for Multiround Lifetime Coverage Optimization}} \label{glpk} \textcolor{red}{The modeling language for Mathematical Programming (AMPL)~\cite{AMPL} is employed to generate the integer program instance in a standard format, which is then read and solved by the optimization solver GLPK (GNU linear Programming Kit available in the public domain) \cite{glpk} through a Branch-and-Bound method. We named the protocol which is based on GLPK solver in the decision phase as MuDiLCO.} +\fi - - +\iffalse \subsection{\textcolor{red}{Genetic Algorithm for Multiround Lifetime Coverage Optimization}} \label{GA} @@@ -1014,7 -1060,7 +1068,7 @@@ The proposed GA-MuDiLCO stops when the \end{enumerate} - +\fi \section{Experimental study} \label{exp} @@@ -1067,9 -1113,9 +1121,9 @@@ $W_{\theta}$ & 1 \ % [1ex] adds vertical space %\hline $W_{U}$ & $|P|^2$ \\ -$P_c$ & 0.95 \\ -$P_m$ & 0.6 \\ -$S_{pop}$ & 50 +%$P_c$ & 0.95 \\ +%$P_m$ & 0.6 \\ +%$S_{pop}$ & 50 %inserts single line \end{tabular} \label{table3} @@@ -1078,10 -1124,8 +1132,10 @@@ \textcolor{red}{Our first protocol based GLPK optimization solver is declined into four versions: MuDiLCO-1, MuDiLCO-3, MuDiLCO-5, and MuDiLCO-7, corresponding respectively to $T=1,3,5,7$ ($T$ the number of -rounds in one sensing period). The second protocol based GA is declined into four versions: GA-MuDiLCO-1, GA-MuDiLCO-3, GA-MuDiLCO-5, -and GA-MuDiLCO-7 for the same reason of the first protocol. After extensive experiments, we chose the dedicated values for the parameters $P_c$, $P_m$, and $S_{pop}$ because they gave the best results}. In the following, we will make comparisons with +rounds in one sensing period). } +%The second protocol based GA is declined into four versions: GA-MuDiLCO-1, GA-MuDiLCO-3, GA-MuDiLCO-5, +%and GA-MuDiLCO-7 for the same reason of the first protocol. After extensive experiments, we chose the dedicated values for the parameters $P_c$, $P_m$, and $S_{pop}$ because they gave the best results}. + In the following, we will make comparisons with two other methods. The first method, called DESK and proposed by \cite{ChinhVu}, is a full distributed coverage algorithm. The second method, called GAF~\cite{xu2001geography}, consists in dividing the region into fixed squares. @@@ -1267,6 -1311,117 +1321,117 @@@ indicate the energy consumed by the who \end{enumerate} + \subsection{Performance Analysis for Different Number of Primary Points} + \label{ch4:sec:04:06} + + In this section, we study the performance of MuDiLCO-1 approach for different numbers of primary points. The objective of this comparison is to select the suitable primary point model to be used by a MuDiLCO protocol. In this comparison, MuDiLCO-1 protocol is used with five models, which are called Model-5 (it uses 5 primary points), Model-9, Model-13, Model-17, and Model-21. + + + %\begin{enumerate}[i)] + + %\item {{\bf Coverage Ratio}} + \subsubsection{Coverage Ratio} + + Figure~\ref{Figures/ch4/R2/CR} shows the average coverage ratio for 150 deployed nodes. + \parskip 0pt + \begin{figure}[h!] + \centering + \includegraphics[scale=0.5] {R2/CR.pdf} + \caption{Coverage ratio for 150 deployed nodes} + \label{Figures/ch4/R2/CR} + \end{figure} + As can be seen in Figure~\ref{Figures/ch4/R2/CR}, at the beginning the models which use a larger number of primary points provide slightly better coverage ratios, but latter they are the worst. + %Moreover, when the number of periods increases, coverage ratio produced by Model-9, Model-13, Model-17, and Model-21 decreases in comparison with Model-5 due to a larger time computation for the decision process for larger number of primary points. + Moreover, when the number of periods increases, coverage ratio produced by all models decrease, but Model-5 is the one with the slowest decrease due to a smaller time computation of decision process for a smaller number of primary points. + As shown in Figure ~\ref{Figures/ch4/R2/CR}, coverage ratio decreases when the number of periods increases due to dead nodes. Model-5 is slightly more efficient than other models, because it offers a good coverage ratio for a larger number of periods in comparison with other models. + + %\item {{\bf Active Sensors Ratio}} + \subsubsection{Active Sensors Ratio} + + Figure~\ref{Figures/ch4/R2/ASR} shows the average active nodes ratio for 150 deployed nodes. + \begin{figure}[h!] + \centering + \includegraphics[scale=0.5]{R2/ASR.pdf} + \caption{Active sensors ratio for 150 deployed nodes } + \label{Figures/ch4/R2/ASR} + \end{figure} + The results presented in Figure~\ref{Figures/ch4/R2/ASR} show the superiority of the proposed Model-5, in comparison with the other models. The model with fewer number of primary points uses fewer active nodes than the other models. + According to the results presented in Figure~\ref{Figures/ch4/R2/CR}, we observe that Model-5 continues for a larger number of periods with a better coverage ratio compared with other models. The advantage of Model-5 is to use fewer number of active nodes for each period compared with Model-9, Model-13, Model-17, and Model-21. This led to continuing for a larger number of periods and thus extending the network lifetime. + + + %\item {{\bf Stopped simulation runs}} + \subsubsection{Stopped simulation runs} + + Figure~\ref{Figures/ch4/R2/SR} illustrates the percentage of stopped simulation runs per period for 150 deployed nodes. + + \begin{figure}[h!] + \centering + \includegraphics[scale=0.5]{R2/SR.pdf} + \caption{Percentage of stopped simulation runs for 150 deployed nodes } + \label{Figures/ch4/R2/SR} + \end{figure} + + When the number of primary points is increased, the percentage of the stopped simulation runs per period is increased. The reason behind the increase is the increasing number of dead sensors when the primary points increase. Model-5 is better than other models because it conserves more energy by turning on less sensors during the sensing phase and in the same time it preserves a good coverage for a larger number of periods in comparison with other models. Model~5 seems to be more suitable to be used in wireless sensor networks. \\ + + + %\item {{\bf Energy Consumption}} + \subsubsection{Energy Consumption} + + In this experiment, we study the effect of increasing the primary points to represent the area of the sensor on the energy consumed by the wireless sensor network for different network densities. Figures~\ref{Figures/ch4/R2/EC}(a) and~\ref{Figures/ch4/R2/EC}(b) illustrate the energy consumption for different network sizes for $Lifetime_{95}$ and $Lifetime_{50}$. + + \begin{figure}[h!] + \centering + %\begin{multicols}{1} + \centering + \includegraphics[scale=0.5]{R2/EC95.pdf}\\~ ~ ~ ~ ~(a) \\ + %\vfill + \includegraphics[scale=0.5]{R2/EC50.pdf}\\~ ~ ~ ~ ~(b) + + %\end{multicols} + \caption{Energy consumption for (a) $Lifetime_{95}$ and (b) $Lifetime_{50}$} + \label{Figures/ch4/R2/EC} + \end{figure} + + We see from the results presented in both figures that the energy consumed by the network for each period increases when the number of primary points increases. Indeed, the decision for the optimization process requires more time, which leads to consuming more energy during the listening mode. The results show that Model-5 is the most competitive from the energy consumption point of view and the coverage ratio point of view. The other models have a high energy consumption due to the increase in the primary points. In fact, Model-5 is a good candidate to be used by wireless sensor network because it preserves a good coverage ratio with a suitable energy consumption in comparison with other models. + + %\item {{\bf Execution Time}} + \subsubsection{Execution Time} + + In this experiment, we study the impact of the increase in primary points on the execution time of DiLCO protocol. Figure~\ref{Figures/ch4/R2/T} gives the average execution times in seconds for the decision phase (solving of the optimization problem) during one period. The original execution time is computed as described in section \ref{et}. + + \begin{figure}[h!] + \centering + \includegraphics[scale=0.5]{R2/T.pdf} + \caption{Execution Time (in seconds)} + \label{Figures/ch4/R2/T} + \end{figure} + + They are given for the different primary point models and various numbers of sensors. We can see from Figure~\ref{Figures/ch4/R2/T}, that Model-5 has lower execution time in comparison with other models because it uses the smaller number of primary points to represent the area of the sensor. Conversely, the other primary point models have presented higher execution times. + Moreover, Model-5 has more suitable execution times and coverage ratio that lead to continue for a larger number of period extending the network lifetime. We think that a good primary point model is one that balances between the coverage ratio and the number of periods during the lifetime of the network. + + %\item {{\bf Network Lifetime}} + \subsubsection{Network Lifetime} + + Finally, we study the effect of increasing the primary points on the lifetime of the network. + %In Figure~\ref{Figures/ch4/R2/LT95} and in Figure~\ref{Figures/ch4/R2/LT50}, network lifetime, $Lifetime95$ and $Lifetime50$ respectively, are illustrated for different network sizes. + As highlighted by Figures~\ref{Figures/ch4/R2/LT}(a) and \ref{Figures/ch4/R2/LT}(b), the network lifetime obviously increases when the size of the network increases, with Model-5 that leads to the larger lifetime improvement. + + \begin{figure}[h!] + \centering + \centering + \includegraphics[scale=0.5]{R2/LT95.pdf}\\~ ~ ~ ~ ~(a) \\ + + \includegraphics[scale=0.5]{R2/LT50.pdf}\\~ ~ ~ ~ ~(b) + + \caption{Network lifetime for (a) $Lifetime_{95}$ and (b) $Lifetime_{50}$} + \label{Figures/ch4/R2/LT} + \end{figure} + + Comparison shows that Model-5, which uses less number of primary points, is the best one because it is less energy consuming during the network lifetime. It is also the better one from the point of view of coverage ratio. Our proposed Model-5 efficiently prolongs the network lifetime with a good coverage ratio in comparison with other models. Therefore, we have chosen Model-5 for all the experiments presented thereafter. + + %\end{enumerate} + + \subsection{Results and analysis} \subsubsection{Coverage ratio} @@@ -1295,12 -1450,11 +1460,12 @@@ rounds, and thus should extend the netw \label{fig3} \end{figure} +\iffalse \textcolor{red}{ We can see that for the first thirty nine rounds GA-MuDiLCO provides a little bit better coverage ratio than MuDiLCO. Both DESK and GAF provide a coverage which is a little bit better than the one of MuDiLCO and GA-MuDiLCO for the first thirty rounds because they activate a larger number of nodes during sensing phase. After that GA-MuDiLCO provides a coverage ratio near to the MuDiLCO and better than DESK and GAF. GA-MuDiLCO gives approximate solution with activation a larger number of nodes than MuDiLCO during sensing phase while it activates a less number of nodes in comparison with both DESK and GAF. MuDiLCO and GA-MuDiLCO clearly outperform DESK and GAF for a number of periods between 31 and 103. This is because they optimize the coverage and the lifetime in a wireless sensor network by selecting the best representative sensor nodes to take the responsibility of coverage during the sensing phase.} - +\fi \subsubsection{Active sensors ratio} @@@ -1309,10 -1463,8 +1474,10 @@@ It is crucial to have as few active nod minimize the communication overhead and maximize the network lifetime. Figure~\ref{fig4} presents the active sensor ratio for 150 deployed nodes all along the network lifetime. It appears that up to round thirteen, DESK and GAF have respectively 37.6\% and 44.8\% of nodes in ACTIVE status, whereas -MuDiLCO clearly outperforms them with only 24.8\% of active nodes. \textcolor{red}{GA-MuDiLCO activates a number of sensor nodes larger than MuDiLCO but lower than both DESK and GAF. GA-MuDiLCO-1, GA-MuDiLCO-3, and GA-MuDiLCO-5 continue in providing a larger number of active sensors until the forty-sixth round after that it provides less number of active nodes due to the died nodes. GA-MuDiLCO-7 provides a larger number of sensor nodes and maintains a better coverage ratio compared to MuDiLCO-7 until the fifty-seventh round. After the thirty-fifth round, MuDiLCO exhibits larger numbers of active nodes compared with DESK and GAF, which agrees with the dual observation of higher level of coverage made previously}. -Obviously, in that case DESK and GAF have less active nodes, since they have activated many nodes at the beginning. Anyway, MuDiLCO activates the available nodes in a more efficient manner. \textcolor{red}{GA-MuDiLCO activates near optimal number of sensor nodes also in efficient manner compared with both DESK and GAF}. +MuDiLCO clearly outperforms them with only 24.8\% of active nodes. +%\textcolor{red}{GA-MuDiLCO activates a number of sensor nodes larger than MuDiLCO but lower than both DESK and GAF. GA-MuDiLCO-1, GA-MuDiLCO-3, and GA-MuDiLCO-5 continue in providing a larger number of active sensors until the forty-sixth round after that it provides less number of active nodes due to the died nodes. GA-MuDiLCO-7 provides a larger number of sensor nodes and maintains a better coverage ratio compared to MuDiLCO-7 until the fifty-seventh round. After the thirty-fifth round, MuDiLCO exhibits larger numbers of active nodes compared with DESK and GAF, which agrees with the dual observation of higher level of coverage made previously}. +Obviously, in that case DESK and GAF have less active nodes, since they have activated many nodes at the beginning. Anyway, MuDiLCO activates the available nodes in a more efficient manner. +%\textcolor{red}{GA-MuDiLCO activates near optimal number of sensor nodes also in efficient manner compared with both DESK and GAF}. \begin{figure}[ht!] \centering @@@ -1331,9 -1483,8 +1496,9 @@@ Figure~\ref{fig6} reports the cumulative percentage of stopped simulations runs per round for 150 deployed nodes. This figure gives the breakpoint for each method. DESK stops first, after approximately 45~rounds, because it consumes the more energy by turning on a large number of redundant nodes during the sensing -phase. GAF stops secondly for the same reason than DESK. \textcolor{red}{GA-MuDiLCO stops thirdly for the same reason than DESK and GAF.} \textcolor{red}{MuDiLCO and GA-MuDiLCO overcome} -DESK and GAF because \textcolor{red}{they activate less number of sensor nodes, as well as }the optimization process distributed on several subregions leads to coverage preservation and so extends the network lifetime. +phase. GAF stops secondly for the same reason than DESK. +%\textcolor{red}{GA-MuDiLCO stops thirdly for the same reason than DESK and GAF.} \textcolor{red}{MuDiLCO and GA-MuDiLCO overcome} +%DESK and GAF because \textcolor{red}{they activate less number of sensor nodes, as well as }the optimization process distributed on several subregions leads to coverage preservation and so extends the network lifetime. Let us emphasize that the simulation continues as long as a network in a subregion is still connected. %%% The optimization effectively continues as long as a network in a subregion is still connected. A VOIR %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @@@ -1369,14 -1520,14 +1534,14 @@@ The results show that MuDiLCO is consumption point of view. The other approaches have a high energy consumption due to activating a larger number of redundant nodes as well as the energy consumed during the different status of the sensor node. Among the different versions of our protocol, the MuDiLCO-7 one consumes more energy than the other versions. This is easy to understand since the bigger the number of rounds and the number of sensors involved in the integer program are, the larger the time computation to solve the optimization problem is. To improve the performances of MuDiLCO-7, we should increase the number of subregions in order to have less sensors to consider in the integer program. -\textcolor{red}{As shown in Figure~\ref{fig7}, GA-MuDiLCO consumes less energy than both DESK and GAF, but a little bit higher than MuDiLCO because it provides a near optimal solution by activating a larger number of nodes during the sensing phase. GA-MuDiLCO consumes less energy in comparison with MuDiLCO-7 version, especially for the dense networks. However, MuDiLCO protocol and GA-MuDiLCO protocol are the most competitive from the energy -consumption point of view. The other approaches have a high energy consumption -due to activating a larger number of redundant nodes.} +%\textcolor{red}{As shown in Figure~\ref{fig7}, GA-MuDiLCO consumes less energy than both DESK and GAF, but a little bit higher than MuDiLCO because it provides a near optimal solution by activating a larger number of nodes during the sensing phase. GA-MuDiLCO consumes less energy in comparison with MuDiLCO-7 version, especially for the dense networks. However, MuDiLCO protocol and GA-MuDiLCO protocol are the most competitive from the energy +%consumption point of view. The other approaches have a high energy consumption +%due to activating a larger number of redundant nodes.} %In fact, a distributed optimization decision, which produces T rounds, on the subregions is greatly reduced the cost of communications and the time of listening as well as the energy needed for sensing phase and computation so thanks to the partitioning of the initial network into several independent subnetworks and producing T rounds for each subregion periodically. \subsubsection{Execution time} - + \label{et} We observe the impact of the network size and of the number of rounds on the computation time. Figure~\ref{fig77} gives the average execution times in seconds (needed to solve optimization problem) for different values of $T$. The modeling language for Mathematical Programming (AMPL)~\cite{AMPL} is employed to generate the Mixed Integer Linear Program instance in a standard format, which is then read and solved by the optimization solver GLPK (GNU linear Programming Kit available in the public domain) \cite{glpk} through a Branch-and-Bound method. The @@@ -1423,9 -1574,8 +1588,9 @@@ of $Lifetime_{95}$ with large wirel difficulty of the optimization problem to be solved by the integer program. This point was already noticed in subsection \ref{subsec:EC} devoted to the energy consumption, since network lifetime and energy consumption are directly -linked. \textcolor{red}{As can be seen in these figures, the lifetime increases with the size of the network, and it is clearly largest for the MuDiLCO -and the GA-MuDiLCO protocols. GA-MuDiLCO prolongs the network lifetime obviously in comparison with both DESK and GAF, as well as the MuDiLCO-7 version for $lifetime_{95}$. However, comparison shows that MuDiLCO protocol and GA-MuDiLCO protocol, which use distributed optimization over the subregions are the best ones because they are robust to network disconnection during the network lifetime as well as they consume less energy in comparison with other approaches.} +linked. +%\textcolor{red}{As can be seen in these figures, the lifetime increases with the size of the network, and it is clearly largest for the MuDiLCO +%and the GA-MuDiLCO protocols. GA-MuDiLCO prolongs the network lifetime obviously in comparison with both DESK and GAF, as well as the MuDiLCO-7 version for $lifetime_{95}$. However, comparison shows that MuDiLCO protocol and GA-MuDiLCO protocol, which use distributed optimization over the subregions are the best ones because they are robust to network disconnection during the network lifetime as well as they consume less energy in comparison with other approaches.} \begin{figure}[t!] \centering \begin{tabular}{cl}