X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/UIC2013.git/blobdiff_plain/6b1de891e2849975795b04843f3bfe3d5e44b667..c174b7277e5ba9b166983f25094db53a92de21f2:/bare_conf.tex

diff --git a/bare_conf.tex b/bare_conf.tex
index 0804bff..c0cef5a 100755
--- a/bare_conf.tex
+++ b/bare_conf.tex
@@ -71,7 +71,7 @@ Election, (iii)~Decision,  and (iv)~Sensing.  The  decision process is
 carried  out  by  a  leader  node which  solves  an  integer  program.
 Simulation  results show that  the proposed  approach can  prolong the
 network lifetime and improve the coverage performance.
-\end{abstract}
+\end{abstract*&^@!U&*T@}
 
 %\keywords{Area Coverage, Wireless Sensor Networks, lifetime Optimization, Distributed Protocol.}
  
@@ -630,7 +630,7 @@ X_{j} \in \{0,1\}, &\forall j \in J
 The first group  of constraints indicates that some  primary point $p$
 should be covered by at least one  sensor and, if it is not always the
 case,  overcoverage  and  undercoverage  variables  help  balancing  the
-restriction  equation by taking  positive values.  There are  two main         %%RAPH restriction equations????
+restriction  equations by taking  positive values.  There are  two main         
 objectives.  First we limit the overcoverage of primary points in order to
 activate a minimum number of sensors.  Second we prevent the absence of monitoring on
  some parts of the subregion by  minimizing the undercoverage.   The
@@ -860,7 +860,7 @@ communications have a small impact on the network lifetime.
 A  sensor  node has  limited  energy  resources  and computing  power,
 therefore it is important that the proposed algorithm has the shortest
 possible execution  time. The energy of  a sensor node  must be mainly
-used   for  the  sensing   phase,  not   for  the   pre-sensing  ones.    %%RAPH: plusieurs phase de pre-sensing??
+used   for  the  sensing   phase,  not   for  the   pre-sensing  ones.   
 Table~\ref{table1} gives the average  execution times  in seconds
 on a laptop of the decision phase (solving of the optimization problem)
 during one  round.  They  are given for  the different  approaches and