X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/ThesisAli.git/blobdiff_plain/ea03ef6a15b12c2b2cd5cdee7f72ca18a520c387..6d401cb266bc54619b552e898e3717db5c4b4f59:/CHAPITRE_04.tex?ds=sidebyside diff --git a/CHAPITRE_04.tex b/CHAPITRE_04.tex index c06ac21..07788db 100644 --- a/CHAPITRE_04.tex +++ b/CHAPITRE_04.tex @@ -8,25 +8,6 @@ \label{ch4} -\iffalse -\section{Summary} -\label{ch4:sec:01} -In this chapter, a Distributed Lifetime Coverage Optimization protocol (DiLCO) to maintain -the coverage and to improve the lifetime in wireless sensor networks is -proposed. The area of interest is first divided into subregions using a -divide-and-conquer method and then the DiLCO protocol is distributed on the -sensor nodes in each subregion. The DiLCO combines two efficient techniques: -leader election for each subregion, followed by an optimization-based planning -of activity scheduling decisions for each subregion. The proposed DiLCO works -into rounds during which a small number of nodes, remaining active for sensing, -is selected to ensure coverage so as to maximize the lifetime of wireless sensor -network. Each round consists of four phases: (i)~Information Exchange, -(ii)~Leader Election, (iii)~Decision, and (iv)~Sensing. The decision process is -carried out by a leader node, which solves an integer program. Compared with -some existing protocols, simulation results show that the proposed protocol can -prolong the network lifetime and improve the coverage performance effectively. - -\fi \section{Introduction} \label{ch4:sec:01} @@ -350,7 +331,7 @@ $w_{U}$ & $|P|^2$ % is used to refer this table in the text \end{table} -Simulations with five different node densities going from 50 to 250~nodes were +Simulations with five different node densities going from 50 to 250~nodes were performed considering each time 25~randomly generated networks, to obtain experimental results which are relevant. The nodes are deployed on a field of interest of $(50 \times 25)~m^2 $ in such a way that they cover the field with a