o

diff --git a/reponse.tex b/reponse.tex
index a909f46d64924f1626daaf8434485c2294296dab..ac9ba0a869424d788b903a508dd9ed8b24e34f92 100644 (file)
--- a/reponse.tex
+++ b/reponse.tex
@@ -138,7 +138,7 @@ The paper addresses the problem of lifetime coverage in wireless sensor networks
 %Uniform graph partition is used by subdividing the sensing field into smaller subgraphs (subregion) using divide-and-conquer concept. The subgraph consists of sensor nodes which are previously deployed over the sensing field uniformly with high density to ensure that any primary point on the sensing field is covered by at least one sensor node. The graph partition problem has gained importance due to its application for clustering. The topology of the graph has important impact on the protocol performance. Random graph has negative  effect on our DiLCO protocol because we suppose that the sensing field is subdivided uniformly.  }}
 
 \noindent {\bf  3. In line 42 of section  3, why  do we need $R_c \geq 2R_s$ ? Isn't it sufficient to have $Rc  >  Rs$ ? What is the implication of a stronger hypothesis ? How realistic is it ? Again, this raised the question of the topology.}\\
 %Uniform graph partition is used by subdividing the sensing field into smaller subgraphs (subregion) using divide-and-conquer concept. The subgraph consists of sensor nodes which are previously deployed over the sensing field uniformly with high density to ensure that any primary point on the sensing field is covered by at least one sensor node. The graph partition problem has gained importance due to its application for clustering. The topology of the graph has important impact on the protocol performance. Random graph has negative  effect on our DiLCO protocol because we suppose that the sensing field is subdivided uniformly.  }}
 
 \noindent {\bf  3. In line 42 of section  3, why  do we need $R_c \geq 2R_s$ ? Isn't it sufficient to have $Rc  >  Rs$ ? What is the implication of a stronger hypothesis ? How realistic is it ? Again, this raised the question of the topology.}\\

-\textcolor{blue}{\textbf{\textsc{Answer :}   We assume that the communication range $R_c$ satisfies the condition $Rc \geq 2R_s$. In fact, Zhang and Hou ("Maintaining Sensing Coverage and. Connectivity in Large Sensor Networks",2005) proved that if the transmission range fulfills the previous hypothesis, the complete coverage of a convex area implies connectivity among active nodes. In this paper, communication ranges and sensing ranges of real sensors are given. Communication range is comprised between 30 and 300 meters. And the sensing range does not exceed 30m. In the case of MEDUSA II sensor node,...........}}\\
+\textcolor{blue}{\textbf{\textsc{Answer :}   We assume that the communication range $R_c$ satisfies the condition $Rc \geq 2R_s$. In fact, Zhang and Hou ("Maintaining Sensing Coverage and. Connectivity in Large Sensor Networks",2005) proved that if the transmission range fulfills the previous hypothesis, the complete coverage of a convex area implies connectivity among active nodes. In this paper, communication ranges and sensing ranges of real sensors are given. Communication range is comprised between 30 and 300 meters. And the sensing range does not exceed 30m. \textcolor{red}{In the case of MEDUSA II sensor node,...........}}}\\

 
 \noindent {\bf  4. In line 63 of subsection 3.2, it is not clear why the periodic scheduling is in favor of a more robust network. Please, explain.}    \\
 \textcolor{blue}{\textbf{\textsc{Answer :}  We explain it in the subsection 3.2. : " A periodic  scheduling  is
 
 \noindent {\bf  4. In line 63 of subsection 3.2, it is not clear why the periodic scheduling is in favor of a more robust network. Please, explain.}    \\
 \textcolor{blue}{\textbf{\textsc{Answer :}  We explain it in the subsection 3.2. : " A periodic  scheduling  is


@@ -200,7 +200,7 @@ needed for a node to stay active during one period, it will no longer take part
 \textcolor{blue}{\textbf{\textsc{Answer :}   it is important to mention a divide-and-conquer approach because of the subdivision of the sensing field is based on this concept.   }}\\
 
 \noindent {\bf  17. The connectivity among subregion should be studied too.}    \\
 \textcolor{blue}{\textbf{\textsc{Answer :}   it is important to mention a divide-and-conquer approach because of the subdivision of the sensing field is based on this concept.   }}\\
 
 \noindent {\bf  17. The connectivity among subregion should be studied too.}    \\

-\textcolor{blue}{\textbf{\textsc{Answer :}  Yes you are right, we will investigated in future.     }}\\\\
+\textcolor{blue}{\textbf{\textsc{Answer :}  Yes you are right, we will investigated it more precisely in future. Up to now, we make the assumption that the communication range $R_c$ satisfies the condition $Rc \geq 2R_s$. In fact, Zhang and Hou ("Maintaining Sensing Coverage and. Connectivity in Large Sensor Networks",2005) proved that if the transmission range fulfills the previous hypothesis, the complete coverage of a convex area implies connectivity among active nodes. Therefore, as long as the coverage ratio is greater than $95\%$, we can assume that the connectivity is maintained. And we check it this hypothesis by simulation with OMNET++.}}\\\\