new

diff --git a/article.tex b/article.tex
index 384ab08d5b0965aa7b5769e68c488d5e1f9d90f3..1299026a35cc4c79a21957704e4d24582da37bb9 100644 (file)
--- a/article.tex
+++ b/article.tex
@@ -982,7 +982,7 @@ for different network sizes.
 As expected,  the execution time increases  with the number of  rounds $T$ taken
 into  account to  schedule  the sensing  phase. \textcolor{blue}{Obviously,  the
   number of variables and constraints of the integer program increases with $T$,
-  as was explained  in section~\ref{decision} The times obtained  for $T=1,3$ or
+  as  explained  in section~\ref{decision}, the times obtained  for $T=1,3$ or
   $5$ seem  bearable. But for  $T=7$, without any  limitation of the  time, they
   become  quickly unsuitable  for  a  sensor node,  especially  when the  sensor
   network size  increases as  demonstrated by Unlimited-MuDiLCO-7.   Notice that
@@ -1011,7 +1011,7 @@ lifetime for a coverage  over 95\%, and a network of  250~nodes, is greater than
 %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{blue}{Overall,  it appears  clearly that  computing a  scheduling for
+\textcolor{blue}{Overall,  it  clearly appears  that  computing a  scheduling for
   several rounds is possible and relevant,  providing that the execution time to
   solve the  optimization problem for  large instances is limited.   Notice that
   rather than limiting the execution time,  similar results might be obtained by