Update By Ali 4/7/2014

diff --git a/article.tex b/article.tex
index 4a63d7d9be8077e2fc2eeedec2fe07db0f1fd835..f81734eb628f410cbbbd269773a3cc79ff4e5ef5 100644 (file)
--- a/article.tex
+++ b/article.tex
@@ -249,6 +249,10 @@ suggested another (LP)  technique to solve this problem.  A centralized solution
 based  on  the  Garg-K\"{o}nemann  algorithm~\cite{garg98},  provably  near  the
 optimal solution, is also proposed.
 
 based  on  the  Garg-K\"{o}nemann  algorithm~\cite{garg98},  provably  near  the
 optimal solution, is also proposed.
 

+In~\cite{yang2014maximum}, The authors are proposed a linear programming approach for selecting the minimum number of sensor nodes in working station so as to preserve a maximum coverage and extend lifetime of the network. Cheng et al.~\cite{cheng2014energy} are proposed a heuristic algorithm called Cover Sets Balance (CSB) algorithm to choose a set of active nodes using the tuple (data coverage range, residual energy). Then, they are introduced a new Correlated Node Set Computing (CNSC) algorithm to find the correlated node set for a given node.  After that, they are proposed a High Residual Energy First (HREF) node selection algorithm to minimize the number of active nodes so as to prolong the network lifetime. 
+In~\cite{castano2013column,rossi2012exact,deschinkel2012column}, The authors are proposed a centralized methods based on column generation approach to extend lifetime in wireless sensor networks while coverage preservation.
+
+

 \subsection{Distributed approaches}
 %{\bf Distributed approaches}
 In distributed  and localized coverage  algorithms, the required  computation to
 \subsection{Distributed approaches}
 %{\bf Distributed approaches}
 In distributed  and localized coverage  algorithms, the required  computation to


@@ -740,10 +744,11 @@ $w_{U}$ & $|P^2|$
 % is used to refer this table in the text
 \end{table}
   
 % is used to refer this table in the text
 \end{table}
   

-Our protocol  is declined into  four versions: MuDiLCO-1,  MuDiLCO-3, MuDiLCO-5,
+Our protocol is declined into four versions: MuDiLCO-1,  MuDiLCO-3, MuDiLCO-5,

 and  MuDiLCO-7, corresponding  respectively to  $T=1,3,5,7$ ($T$  the  number of
 rounds  in one  sensing period).  In  the following,  the general  case will  be
 and  MuDiLCO-7, corresponding  respectively to  $T=1,3,5,7$ ($T$  the  number of
 rounds  in one  sensing period).  In  the following,  the general  case will  be

-denoted by MuDiLCO-T.   We compare MuDiLCO-T with two  other methods.  The first
+denoted by MuDiLCO-T. We are studied the impact of dividing the sensing feild on the performance of our  MuDiLCO-T protocol with different network sizes using Divide and Conquer method, and we are found that as the number of subregions increase, the network lifetime increase and the MuDiLCO-T protocol become more powerful against the network disconnection.
+This subdivision should be stopped when there is no benefit from the optimization, therefore Our MuDiLCO-T protocol is distributed over 16 rather than 32 subregions because there is a balance between the benefit from the optimization and the execution time is needed to sove it.    We compare MuDiLCO-T with two  other methods.  The first

 method,  called  DESK and  proposed  by  \cite{ChinhVu}  is a  full  distributed
 coverage  algorithm.   The  second  method,  called  GAF~\cite{xu2001geography},
 consists in dividing the region  into fixed squares.  During the decision phase,
 method,  called  DESK and  proposed  by  \cite{ChinhVu}  is a  full  distributed
 coverage  algorithm.   The  second  method,  called  GAF~\cite{xu2001geography},
 consists in dividing the region  into fixed squares.  During the decision phase,


@@ -838,7 +843,7 @@ To evaluate our approach we consider the following performance metrics:
 \end{equation*}
 where $n^t$ is  the number of covered  grid points by the active  sensors of all
 subregions during round $t$ in the current sensing phase and $N$ is total number
 \end{equation*}
 where $n^t$ is  the number of covered  grid points by the active  sensors of all
 subregions during round $t$ in the current sensing phase and $N$ is total number

-of grid points in the sensing field of the network.
+of grid points in the sensing field of the network. In our simulation $N = 51 \times 26 = 1326$ grid points.

 %The accuracy of this method depends on the distance between grids. In our
 %simulations, the sensing field has been divided into 50 by 25 grid points, which means
 %there are $51 \times 26~ = ~ 1326$ points in total.
 %The accuracy of this method depends on the distance between grids. In our
 %simulations, the sensing field has been divided into 50 by 25 grid points, which means
 %there are $51 \times 26~ = ~ 1326$ points in total.


@@ -1122,7 +1127,9 @@ and thus to an excessive energy consumption.
 %In  future work, we plan  to study and propose adjustable sensing range coverage optimization protocol, which computes  all active sensor schedules in one time, by using
 %optimization  methods. This protocol can prolong the network lifetime by minimizing the number of the active sensor nodes near the borders by optimizing the sensing range of sensor nodes.
 % use section* for acknowledgement
 %In  future work, we plan  to study and propose adjustable sensing range coverage optimization protocol, which computes  all active sensor schedules in one time, by using
 %optimization  methods. This protocol can prolong the network lifetime by minimizing the number of the active sensor nodes near the borders by optimizing the sensing range of sensor nodes.
 % use section* for acknowledgement

-%\section*{Acknowledgment}
+
+\section*{Acknowledgment}
+As a Ph.D. student, Ali Kadhum IDREES would like to gratefully acknowledge the University of Babylon - IRAQ for the financial support and in the same time would like to acknowledge Campus France (The French national agency for the promotion of higher education, international student services, and international mobility) and University of Franche-Comt\'e - FRANCE for all the support in FRANCE.

 
 %% \linenumbers
 
 
 %% \linenumbers
 

diff --git a/biblio.bib b/biblio.bib
index aa94f0872274e8f72e2d31a7876856984f3ff7c0..d61f37439b945aa95ae70663d2feda3adb77bc30 100755 (executable)
--- a/biblio.bib
+++ b/biblio.bib
@@ -476,4 +476,53 @@ ISSN={1536-1276},
   pages={70--84},
   year={2001},
   organization={ACM}
   pages={70--84},
   year={2001},
   organization={ACM}

-}
\ No newline at end of file
+}
+
+@article{yang2014maximum,
+  title={A Maximum Lifetime Coverage Algorithm Based on Linear Programming},
+  author={Yang, Mengmeng and Liu, Jie},
+  journal={Journal of Information Hiding and Multimedia Signal Processing },
+  volume={5},
+  number={2},
+  pages={296--301},
+  year={2014}
+}
+
+@article{cheng2014energy,
+  title={Energy-Efficient Node Selection Algorithms with Correlation Optimization in Wireless Sensor Networks},
+  author={Cheng, Hongju and Su, Zhihuang and Zhang, Daqiang and Lloret, Jaime and Yu, Zhiyong},
+  journal={International Journal of Distributed Sensor Networks},
+  volume={2014},
+  year={2014},
+  publisher={Hindawi Publishing Corporation}
+}
+
+@article{castano2013column,
+  title={A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints},
+  author={Casta{\~n}o, Fabian and Rossi, Andr{\'e} and Sevaux, Marc and Velasco, Nubia},
+  journal={Computers \& Operations Research},
+  year={2013},
+  publisher={Elsevier}
+}
+
+@article{rossi2012exact,
+  title={An exact approach for maximizing the lifetime of sensor networks with adjustable sensing ranges},
+  author={Rossi, Andr{\'e} and Singh, Alok and Sevaux, Marc},
+  journal={Computers \& Operations Research},
+  volume={39},
+  number={12},
+  pages={3166--3176},
+  year={2012},
+  publisher={Elsevier}
+}
+
+@article{deschinkel2012column,
+  title={A Column Generation based Heuristic to Extend Lifetime in Wireless Sensor Network.},
+  author={Deschinkel, Karine},
+  journal={Sensors \& Transducers Journal},
+  volume={14-2},
+  pages={242--253},
+  year={2012}
+}
+
+