From: ali Date: Thu, 11 Jun 2015 16:04:51 +0000 (+0200) Subject: Update X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/ThesisAli.git/commitdiff_plain/527e2e13b134e5c86779182bc5756daa144161c2?hp=6a69f6fbd00159f3ee3efd2536815457a556b09a Update --- diff --git a/CHAPITRE_05.tex b/CHAPITRE_05.tex index c3839fc..94188d8 100644 --- a/CHAPITRE_05.tex +++ b/CHAPITRE_05.tex @@ -348,17 +348,12 @@ Obviously, in that case, DESK and GAF have fewer active nodes since they have a %\subsection{Stopped simulation runs} %\label{ch5:sec:03:02:03} -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. MuDiLCO overcomes -DESK and GAF because 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. +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. MuDiLCO overcomes DESK and GAF because 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. \\ -\begin{figure}[h!] +\begin{figure}[t] \centering \includegraphics[scale=0.8]{Figures/ch5/R1/SR.pdf} \caption{Cumulative percentage of stopped simulation runs for 150 deployed nodes } @@ -394,7 +389,7 @@ network sizes, for $Lifetime_{95}$ and $Lifetime_{50}$. The results show that MuDiLCO is 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, 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, the larger the time computation to solve the optimization problem. To improve the performances of MuDiLCO-7, we should increase the number of subregions in order to have fewer sensors to consider in the integer program. - +\\ \\ \\ \item {{\bf Execution time}} @@ -418,16 +413,11 @@ As expected, the execution time increases with the number of rounds $T$ taken we need to choose a relevant number of subregions in order to avoid a complicated and cumbersome optimization. On the one hand, a large value for $T$ permits to reduce the energy overhead due to the three pre-sensing phases, on the other hand a leader node may waste a considerable amount of energy to solve the optimization problem. \\ - \item {{\bf Network lifetime}} %\subsection{Network lifetime} %\label{ch5:sec:03:02:06} - The next two figures, Figures~\ref{fig8}(a) and \ref{fig8}(b), illustrate the network lifetime for different network sizes, respectively for $Lifetime_{95}$ and $Lifetime_{50}$. Both figures show that the network lifetime increases together with the number of sensor nodes, whatever the protocol, thanks to the node density which results in more and more redundant nodes that can be deactivated and thus save energy. Compared to the other approaches, our MuDiLCO -protocol maximizes the lifetime of the network. In particular, the gain in lifetime for a coverage over 95\% is greater than 38\% when switching from GAF to MuDiLCO-3. The slight decrease that can be observed for MuDiLCO-7 in case of $Lifetime_{95}$ with large wireless sensor networks results from the difficulty of the optimization problem to be solved by the integer program. -This point was already noticed in \ref{subsec:EC} devoted to the -energy consumption, since network lifetime and energy consumption are directly linked. - +protocol maximizes the lifetime of the network. In particular, the gain in lifetime for a coverage over 95\% is greater than 38\% when switching from GAF to MuDiLCO-3. \\ \\ \\ \begin{figure}[h!] \centering @@ -443,17 +433,18 @@ energy consumption, since network lifetime and energy consumption are directly \end{figure} - -\end{enumerate} - +\end{enumerate} +The slight decrease that can be observed for MuDiLCO-7 in case of $Lifetime_{95}$ with large wireless sensor networks results from the difficulty of the optimization problem to be solved by the integer program. +This point was already noticed in \ref{subsec:EC} devoted to the +energy consumption, since network lifetime and energy consumption are directly linked. \section{Conclusion} \label{ch5:sec:05} -We have addressed the problem of the coverage and of the lifetime optimization in wireless sensor networks. This is a key issue as sensor nodes have limited resources in terms of memory, energy, and computational power. To cope with this problem, the field of sensing is divided into smaller subregions using the concept of divide-and-conquer method, and then we propose a protocol which optimizes coverage and lifetime performances in each subregion. Our protocol, -called MuDiLCO (Multiround Distributed Lifetime Coverage Optimization) combines two efficient techniques: network leader election and sensor activity scheduling. The activity scheduling in each subregion works in periods, where each period consists of four phases: (i) Information Exchange, (ii) Leader Election, (iii) Decision Phase to plan the activity of the sensors over $T$ rounds, (iv) Sensing Phase itself divided into T rounds. +We have addressed the problem of the coverage and of the lifetime optimization in wireless sensor networks. This is a key issue as sensor nodes have limited resources in terms of memory, energy, and computational power. To cope with this problem, the field of sensing is divided into smaller subregions using the concept of divide-and-conquer method, and then we propose a protocol which optimizes coverage and lifetime performances in each subregion. Our protocol, +called MuDiLCO (Multiround Distributed Lifetime Coverage Optimization) combines two efficient techniques: network leader election and sensor activity scheduling. The activity scheduling in each subregion works in periods, where each period consists of four phases: (i) Information exchange, (ii) Leader election, (iii) Decision phase to plan the activity of the sensors over $T$ rounds, (iv) Sensing phase itself divided into T rounds. -Simulations results show the relevance of the proposed protocol in terms of lifetime, coverage ratio, active sensors ratio, energy consumption, execution time. Indeed, when dealing with large wireless sensor networks, a distributed approach, like the one we propose, allows to reduce the difficulty of a single global optimization problem by partitioning it into many smaller problems, one per subregion, that can be solved more easily. Nevertheless, results also show that it is not possible to plan the activity of sensors over too many rounds because the resulting optimization problem leads to too high-resolution times and thus to an excessive energy consumption. Compared with DiLCO, It is clear that MuDiLCO improves the network lifetime especially for the dense network, but it is less robust than DiLCO under sensor nodes failures. Therefore, choosing the number of rounds $T$ depends on the type of application the WSN is deployed for. +Simulations results show the relevance of the proposed protocol in terms of lifetime, coverage ratio, active sensors ratio, energy consumption, execution time. Indeed, when dealing with large wireless sensor networks, a distributed approach, like the one we propose, allows to reduce the difficulty of a single global optimization problem by partitioning it into many smaller problems, one per subregion, that can be solved more easily. Nevertheless, results also show that it is not possible to plan the activity of sensors over too many rounds because the resulting optimization problem leads to too high-resolution times and thus to an excessive energy consumption. Compared with DiLCO, it is clear that MuDiLCO improves the network lifetime especially for the dense network, but it is less robust than DiLCO under sensor nodes failures. Therefore, choosing the number of rounds $T$ depends on the type of application the WSN is deployed for. \ No newline at end of file