X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/Sensornets15.git/blobdiff_plain/c5d35ebf9a8ac33354f3f6514280bce5ec92a729..8abf40a6144c2ae97b77ec718fef360e652d01b9:/Example.tex?ds=sidebyside

diff --git a/Example.tex b/Example.tex
index c30cff5..38cc14f 100644
--- a/Example.tex
+++ b/Example.tex
@@ -293,10 +293,10 @@ and each sensor node will have five possible status in the network:
 An outline of the  protocol implementation is given by Algorithm~\ref{alg:DiLCO}
 which describes  the execution of  a period  by a node  (denoted by $s_j$  for a
 sensor  node indexed by  $j$). At  the beginning  a node  checks whether  it has
-enough energy to stay active during the next sensing phase. If yes, it exchanges
+enough energy \textcolor{blue}{(its energy should be greater than a fixed treshold $E_{th}$)} to stay active during the next sensing phase. If yes, it exchanges
 information  with  all the  other  nodes belonging  to  the  same subregion:  it
 collects from each node its position coordinates, remaining energy ($RE_j$), ID,
-and  the number  of  one-hop neighbors  still  alive. Once  the  first phase  is
+and  the number  of  one-hop neighbors  still  alive. \textcolor{blue}{INFO packet contains two parts: header and data payload. The sensor ID is included in the header, where the header size is 8 bits. The data part includes position coordinates (64 bits), remaining energy (32 bits), and the number of one-hop live neighbors (8 bits). Therefore the size of the INFO packet is 112 bits.} Once  the  first phase  is
 completed, the nodes  of a subregion choose a leader to  take the decision based
 on  the  following  criteria   with  decreasing  importance:  larger  number  of
 neighbors, larger remaining energy, and  then in case of equality, larger index.