X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/ThesisAli.git/blobdiff_plain/5c431ecbeda4acd97fad6b1e170d502ea11a2b3d..b526efd6a44846d1d89a70fedae4bf9bd2058885:/CHAPITRE_05.tex?ds=sidebyside diff --git a/CHAPITRE_05.tex b/CHAPITRE_05.tex index 66eadc1..2ee5579 100644 --- a/CHAPITRE_05.tex +++ b/CHAPITRE_05.tex @@ -474,7 +474,7 @@ called MuDiLCO (Multiround Distributed Lifetime Coverage Optimization) combines 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. +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.