ameliorations

diff --git a/LiCO_Journal.tex b/LiCO_Journal.tex
index 99f420bac259e763d4a07db92405bf420a269df6..780d151756210b2d3e31be4ffe2cbf5f9a047eb9 100755 (executable)
--- a/LiCO_Journal.tex
+++ b/LiCO_Journal.tex
@@ -61,7 +61,7 @@
 \begin{abstract}
 
 
 \begin{abstract}
 
 

- One fundamental issue in Wireless Sensor Networks (WSNs) is the lifetime coverage optimization, which reflects how well a WSN is covered by a wireless sensors so that the network lifetime can be maximized. In this paper, a Lifetime Coverage Optimization Protocol (LiCO) in WSNs is proposed. The network is logically divided into subregions using divide-and-conquer method. LiCO protocol is distributed in each sensor node in the subregion. The lifetime coverage is divided into four stages: Information exchange, Leader Election, Optimization Decision, and Sensing. The optimization decision is made at each subregion, by a leader, who his election comes from the cooperation of the sensor nodes within the same subregion of WSN. A new mathematical optimization model is proposed to optimize the lifetime coverage in each subregion. Extensive simulation experiments have been performed using OMNeT++,  the discrete event simulator,  to demonstrate that LiCO is capable to extend the lifetime coverage of WSN as longer time as possible in comparison with some other protocols.
+ One fundamental issue in Wireless Sensor Networks (WSNs) is the lifetime coverage optimization, which reflects how well a WSN is covered by a wireless sensors so that the network lifetime can be maximized. In this paper, a Lifetime Coverage Optimization Protocol (LiCO) in WSNs is proposed. The surveillance region is divided into subregions and LiCO protocol is distributed among sensor nodes in each subregion. LiC0 protocols works into periods, each period is divided into four stages: Information exchange, Leader Election, Optimization Decision, and Sensing. Schedules node activities (wakeup and sleep of sensors) is performed in each subregion by a leader whose selection is the result of cooperation between nodes within the same subregion. The novelty of the approach lies essentially in the formulation of a new mathematical optimization model based on perimeter coverage level to schedule sensors activities. Extensive simulation experiments have been performed using OMNeT++, the discrete event simulator, to demonstrate that LiCO is capable to extend the lifetime coverage of WSN as longer time as possible in comparison with some other protocols.

 
 \end{abstract}
 
 
 \end{abstract}
 


@@ -80,70 +80,161 @@ Wireless Sensor Networks, Area Coverage, Network lifetime, Optimization, Schedul
 
 \section{\uppercase{Introduction}}
 \label{sec:introduction}
 
 \section{\uppercase{Introduction}}
 \label{sec:introduction}

-\noindent The great development in  Micro Electro-Mechanical Systems (MEMS) and wireless communication hardware are being led to emerge networks of tiny distributed sensors called WSN~\cite{akyildiz2002wireless,puccinelli2005wireless}. WSN comprises of small, low-powered sensors working together for perform a typical mission by communicating with one another through multihop wireless connections. They can send the sensed measurements based on local decisions to the user by means of sink nodes. WSN has been used in many applications such as Military, Habitat, Environment, Health, industrial, and Business~\cite{yick2008wireless}.Typically, a sensor node contains three main parts~\cite{anastasi2009energy}: a sensing subsystem, for sense, measure, and gather the measurements from the real environment; processing subsystem, for measurements processing and storage; a communication subsystem, for data transmission and receiving. Moreover,  the energy needed by the sensor node is supplied by a power supply, to accomplish the Scheduled task. This power supply is composed of a battery with a limited lifetime. Furthermore, it maybe be unsuitable or impossible to replace or recharge the batteries, since sensor nodes may be deployed in a hostile or unpractical environment. The sensor system ought to have a lifetime long enough to satisfy the application necessities. The lifetime coverage maximization is one of the fundamental requirements of any area coverage protocol in WSN implementation~\cite{nayak2010wireless}. In order to increase the reliability and prevent the possession of coverage holes (some parts are not covered in the area of interest) in the WSN, it is necessary to deploy the WSN with high density so as to increase the reliability and to exploit redundancy by using energy-efficient activity scheduling approaches.
+\noindent The great development in  Micro Electro-Mechanical Systems (MEMS) and wireless communication hardware are being led to emerge networks of tiny distributed sensors called WSN~\cite{akyildiz2002wireless,puccinelli2005wireless}. WSN comprises of small, low-powered sensors working together for perform a typical mission by communicating with one another through multihop wireless connections. They can send the sensed measurements based on local decisions to the user by means of sink nodes. WSN has been used in many applications such as Military, Habitat, Environment, Health, industrial, and Business~\cite{yick2008wireless}.Typically, a sensor node contains three main parts~\cite{anastasi2009energy}: a sensing subsystem, for sense, measure, and gather the measurements from the real environment; processing subsystem, for measurements processing and storage; a communication subsystem, for data transmission and receiving. Moreover,  the energy needed by the sensor node is supplied by a power supply, to accomplish the scheduled task. This power supply is composed of a battery with a limited lifetime. And it maybe be unsuitable or impossible to replace or recharge the batteries in most applications. It is then necessary to deploy the WSN with high density so as to increase the reliability and to exploit redundancy by using energy-efficient activity scheduling approaches. So, the main question is: how to extend the lifetime coverage of WSN as long time as possible while ensuring a high level of coverage? Many energy-efficient mechanisms have been suggested to retain energy and extend the lifetime of the WSNs~\cite{rault2014energy}. 

 
 

-From a certain standpoint, the high coverage ratio is required by many applications such as military and health-care. Therefore, a suitable number of sensors are being chosen so as to cover the area of interest, is the first challenge. Meanwhile, the sensor nodes have a limited capabilities in terms of memory, processing, communication, and battery power being the most important and critical one.  So, the main question is: how to extend the lifetime coverage of WSN as long time as possible?. There are many energy-efficient mechanisms have been suggested to retain energy and extend the lifetime of the WSNs~\cite{rault2014energy}.
+%The sensor system ought to have a lifetime long enough to satisfy the application necessities. The lifetime coverage maximization is one of the fundamental requirements of any area coverage protocol in WSN implementation~\cite{nayak2010wireless}. In order to increase the reliability and prevent the possession of coverage holes (some parts are not covered in the area of interest) in the WSN, it is necessary to deploy the WSN with high density so as to increase the reliability and to exploit redundancy by using energy-efficient activity scheduling approaches.

 
 

-\uppercase{\textbf{Our contributions.}} Two combined integrated energy-efficient techniques have been used by LiCO protocol in order to maximize the lifetime coverage in WSN: the first, by dividing the area of interest into several smaller subregions based on divide-and-conquer method and then one leader elected for each subregion in an independent, distributed, and simultaneous way by the cooperation among the sensor nodes within each subregion, and this similar to cluster architecture; the second, activity scheduling based new optimization model has been used to provide the optimal cover set that will take the mission of sensing during current period. This optimization algorithm is based on a perimeter-coverage model so as to optimize the shared perimeter among the sensors in each subregion, and this represents as a energu-efficient control topology mechanism in WSN.
+%From a certain standpoint, the high coverage ratio is required by many applications such as military and health-care. Therefore, a suitable number of sensors are being chosen so as to cover the area of interest, is the first challenge. Meanwhile, the sensor nodes have a limited capabilities in terms of memory, processing, communication, and battery power being the most important and critical one.  So, the main question is: how to extend the lifetime coverage of WSN as long time as possible?. There are many energy-efficient mechanisms have been suggested to retain energy and extend the lifetime of the WSNs~\cite{rault2014energy}.
+
+%\uppercase{\textbf{Our contributions.}} 
+This paper makes the following contributions.\\
+\begin{enumerate}
+\item We devise a framework to schedules nodes to be activated alternatively, such that the network lifetime may be prolonged ans certain coverage reuirement can still be met. 
+This framework is based on the division of the area of interest into several smaller subregions; on the division of timeline into periods of equal length. 
+One leader elected for each subregion in an independent, distributed, and simultaneous way by the cooperation among the sensor nodes within each subregion, and this similar to cluster architecture
+\item We propose a new mathematical optimization model. Instead of trying to cover a set of specified points/targets as in most of the methods proposed in the literature, 
+we formulate an integer program based on perimeter coverage of each sensor. The model involves integer variables to capture the deviations between the 
+actual level of coverage and the required level. And a weighted sum of these deviations is minimized. 
+\item We conducted extensive simulation experiments using the discrete event simulator OMNeT++, to demonstrate the efficiency of our protocol, compared to two approaches found in the literature, DESK \ref{} and  GAF \ref{}, and compared to our previous work using another optimization model for sensor scheduling. 
+\end{enumerate}
+
+
+%Two combined integrated energy-efficient techniques have been used by LiCO protocol in order to maximize the lifetime coverage in WSN: the first, by dividing the area of interest into several smaller subregions based on divide-and-conquer method and then one leader elected for each subregion in an independent, distributed, and simultaneous way by the cooperation among the sensor nodes within each subregion, and this similar to cluster architecture;
+% the second, activity scheduling based new optimization model has been used to provide the optimal cover set that will take the mission of sensing during current period. This optimization algorithm is based on a perimeter-coverage model so as to optimize the shared perimeter among the sensors in each subregion, and this represents as a energu-efficient control topology mechanism in WSN.

 
 
 The remainder of the paper is organized as follows. The next section reviews  the related  work  in  the field.  Section~\ref{sec:The LiCO Protocol Description} is devoted to the LiCO protocol Description. Section~\ref{cp}  gives the coverage model
 formulation which is used to schedule the activation of sensors.
 
 
 The remainder of the paper is organized as follows. The next section reviews  the related  work  in  the field.  Section~\ref{sec:The LiCO Protocol Description} is devoted to the LiCO protocol Description. Section~\ref{cp}  gives the coverage model
 formulation which is used to schedule the activation of sensors.

-Section~\ref{sec:Simulation Results and Analysis} shows the simulation results.  Finally, we give concluding remarks and some suggestions for
+Section~\ref{sec:Simulation Results and Analysis} presents simulations results. Finally, we give concluding remarks and some suggestions for

 future works in Section~\ref{sec:Conclusion and Future Works}.
 
 future works in Section~\ref{sec:Conclusion and Future Works}.
 

+% that show that our protocol outperforms others protocols.

 \section{\uppercase{Related Literature}}
 \label{sec:Literature Review}
 \section{\uppercase{Related Literature}}
 \label{sec:Literature Review}

-\noindent Recently, the coverage problem has been received a high attention, which concentrates on how the physical space could be well monitored  after the deployment. Coverage is one of the Quality of Service (QoS) parameters in WSNs, which is highly concerned with power depletion~\cite{zhu2012survey}. Most of the works about the coverage protocols have been suggested in the literature focused on three types of the coverage in WSNs~\cite{mulligan2010coverage}: the first, area coverage means that each point in the area of interest within the sensing range of at least one sensor node; the second, target coverage in which a fixed set of targets need to be monitored; the third, barrier coverage refers to detect the intruders crossing a boundary of WSN. The work in this paper emphasized on the area coverage, so,  some area coverage protocols have been reviewed in this section, and the shortcomings of reviewed approaches are being summarized.

 
 

-The problem of k-coverage in WSNs was addressed~\cite{ammari2012centralized}. It mathematically formulated and the spacial sensor density for full k-coverage determined, where the relation between the communication range and the sensing range constructed by this work to retain the k-coverage and connectivity in WSN. After that, a four configuration protocols have proposed for treating the k-coverage in WSNs.  

 
 

-In~\cite{rebai2014branch}, the problem of full grid coverage is formulated using two integer linear programming models: the first, a model that takes into account only the overall coverage constraint; the second, both the connectivity and the full grid coverage constraints have taken into consideration. This work did not take into account the energy constraint.
-
-Li et al.~\cite{li2011transforming} presented a framework to convert any complete coverage problem to a partial coverage one with any coverage ratio by means of executing a complete coverage algorithm to find a full coverage sets with virtual radii and transforming the coverage sets to a partial coverage sets by adjusting sensing radii.  The properties of the original algorithms can be maintained by this framework and the transformation process has a low execution time.
-
-The authors in~\cite{liu2014generalized} explained that in some applications of WSNs such as structural health monitoring (SHM) and volcano monitoring, the traditional coverage model which is a geographic area defined for individual sensors is not always valid. For this reason, they define a generalized coverage model, which is not need to have the coverage area of individual nodes, but only based on a function to determine whether a set of
-sensor nodes is capable of satisfy the requested monitoring task for a certain area. They have proposed two approaches to divide the deployed nodes into suitable cover sets, which can be used to prolong the network lifetime. 
+\noindent  In  this section,  we  summarize  some  related works  regarding  the
+coverage problem and distinguish our  LiCO protocol from the works presented in
+the literature.
+
+The most discussed coverage problems  in literature can be classified into three
+types \cite{li2013survey}:  area coverage \cite{Misra} where  every point inside
+an area is to be  monitored, target coverage \cite{yang2014novel} where the main
+objective is  to cover only a  finite number of discrete  points called targets,
+and barrier coverage \cite{Kumar:2005}\cite{kim2013maximum} to prevent intruders
+from entering into the region  of interest. In \cite{Deng2012} authors transform
+the area coverage problem to the target coverage problem taking into account the
+intersection points among disks of sensors nodes or between disk of sensor nodes
+and boundaries. In \cite{Huang:2003:CPW:941350.941367} authors prove that if the perimeters of sensors are sufficiently covered, the whole area is sufficiently covered and they provide an algorithm in $O(n d \quad log d)$ time to compute the perimeter-coverage of each sensor ($d$ the maixmum number of sensors that are neighboring to a sensor, $n$ the total number of sensors in teh network). {\it In LiCO protocol, rather than determining the level of coverage of a set of discrete points, our optimization model is based on checking the perimeter-coverage of each sensor to activate a minimal number of sensors.}
+
+The major  approach to extend network  lifetime while preserving  coverage is to
+divide/organize the  sensors into a suitable  number of set  covers (disjoint or
+non-disjoint), where  each set  completely covers a  region of interest,  and to
+activate these set  covers successively. The network activity  can be planned in
+advance and scheduled  for the entire network lifetime  or organized in periods,
+and the set  of active sensor nodes  is decided at the beginning  of each period
+\cite{ling2009energy}.  Active node selection is determined based on the problem
+requirements  (e.g.  area   monitoring,  connectivity,  power  efficiency).  For
+instance,  Jaggi  et al.  \cite{jaggi2006}  address  the  problem of  maximizing
+network lifetime by dividing sensors into the maximum number of disjoint subsets
+such  that each  subset  can ensure  both  coverage and  connectivity. A  greedy
+algorithm  is applied  once to  solve  this problem  and the  computed sets  are
+activated  in   succession  to  achieve   the  desired  network   lifetime.   Vu
+\cite{chin2007}, Padmatvathy et al. \cite{pc10}, propose algorithms working in a
+periodic fashion where a cover set  is computed at the beginning of each period.
+{\it  Motivated by  these works,  LiCO protocol  works in  periods,  where each
+  period contains  a preliminary phase  for information exchange  and decisions,
+  followed by a  sensing phase where one  cover set is in charge  of the sensing
+  task.}
+
+Various approaches, including centralized,  or distributed algorithms, have been
+proposed     to    extend    the     network    lifetime.      In    distributed
+algorithms~\cite{yangnovel,ChinhVu,qu2013distributed},       information      is
+disseminated  throughout  the  network   and  sensors  decide  cooperatively  by
+communicating with their neighbors which of them will remain in sleep mode for a
+certain         period         of         time.          The         centralized
+algorithms~\cite{cardei2005improving,zorbas2010solving,pujari2011high}     always
+provide nearly or close to optimal  solution since the algorithm has global view
+of the whole  network. But such a method has the  disadvantage of requiring high
+communication costs,  since the  node (located at  the base station)  making the
+decision needs information from all the  sensor nodes in the area and the amount
+of  information can  be huge.   {\it  In order  to be  suitable for  large-scale
+  network,  in the LiCO  protocol, the  area of interest is divided  into several
+  smaller subregions, and in each one, a node called the leader is in charge for
+  selecting the active sensors for the current period.}
+
+A large  variety of coverage scheduling  algorithms has been  developed. Many of
+the existing  algorithms, dealing with the  maximization of the  number of cover
+sets, are heuristics.  These heuristics  involve the construction of a cover set
+by including in priority the sensor  nodes which cover critical targets, that is
+to  say   targets  that   are  covered  by   the  smallest  number   of  sensors
+\cite{berman04,zorbas2010solving}.  Other  approaches are based  on mathematical
+programming formulations~\cite{cardei2005energy,5714480,pujari2011high,Yang2014}
+and dedicated  techniques (solving with a  branch-and-bound algorithms available
+in optimization solver).   The problem is formulated as  an optimization problem
+(maximization of the lifetime or number of cover sets) under target coverage and
+energy  constraints.   Column   generation  techniques,  well-known  and  widely
+practiced techniques for  solving linear programs with too  many variables, have
+also                                                                        been
+used~\cite{castano2013column,rossi2012exact,deschinkel2012column}. {\it In LiCO
+  protocol, each  leader, in  each subregion, solves  an integer program  with 
+the double objective  consisting in minimizing  the overcoverage and the
+  undercoverage of the perimeter of each sensor.  
+
+}
+
+
+%\noindent Recently, the coverage problem has been received a high attention, which concentrates on how the physical space could be well monitored  after the deployment. Coverage is one of the Quality of Service (QoS) parameters in WSNs, which is highly concerned with power depletion~\cite{zhu2012survey}. Most of the works about the coverage protocols have been suggested in the literature focused on three types of the coverage in WSNs~\cite{mulligan2010coverage}: the first, area coverage means that each point in the area of interest within the sensing range of at least one sensor node; the second, target coverage in which a fixed set of targets need to be monitored; the third, barrier coverage refers to detect the intruders crossing a boundary of WSN. The work in this paper emphasized on the area coverage, so,  some area coverage protocols have been reviewed in this section, and the shortcomings of reviewed approaches are being summarized.
+
+%The problem of k-coverage in WSNs was addressed~\cite{ammari2012centralized}. It mathematically formulated and the spacial sensor density for full k-coverage determined, where the relation between the communication range and the sensing range constructed by this work to retain the k-coverage and connectivity in WSN. After that, a four configuration protocols have proposed for treating the k-coverage in WSNs.  
+
+%In~\cite{rebai2014branch}, the problem of full grid coverage is formulated using two integer linear programming models: the first, a model that takes into account only the overall coverage constraint; the second, both the connectivity and the full grid coverage constraints have taken into consideration. This work did not take into account the energy constraint.
+
+%Li et al.~\cite{li2011transforming} presented a framework to convert any complete coverage problem to a partial coverage one with any coverage ratio by means of executing a complete coverage algorithm to find a full coverage sets with virtual radii and transforming the coverage sets to a partial coverage sets by adjusting sensing radii.  The properties of the original algorithms can be maintained by this framework and the transformation process has a low execution time.
+
+%The authors in~\cite{liu2014generalized} explained that in some applications of WSNs such as structural health monitoring (SHM) and volcano monitoring, the traditional coverage model which is a geographic area defined for individual sensors is not always valid. For this reason, they define a generalized coverage model, which is not need to have the coverage area of individual nodes, but only based on a function to determine whether a set of
+%sensor nodes is capable of satisfy the requested monitoring task for a certain area. They have proposed two approaches to divide the deployed nodes into suitable cover sets, which can be used to prolong the network lifetime. 

  
  

-The work in~\cite{wang2010preserving} addressed the target area coverage problem by proposing a geometric-based activity scheduling scheme, named GAS, to fully cover the target area in WSNs. The authors deals with small area (target area coverage), which can be monitored by a single sensor instead of area coverage, which focuses on a large area that should be monitored by many sensors cooperatively. They explained that GAS is capable to monitor the target area by using a few sensors as possible and it can produce as many cover sets as possible.
+%The work in~\cite{wang2010preserving} addressed the target area coverage problem by proposing a geometric-based activity scheduling scheme, named GAS, to fully cover the target area in WSNs. The authors deals with small area (target area coverage), which can be monitored by a single sensor instead of area coverage, which focuses on a large area that should be monitored by many sensors cooperatively. They explained that GAS is capable to monitor the target area by using a few sensors as possible and it can produce as many cover sets as possible.

 
 

-Cho et al.~\cite{cho2007distributed} proposed a distributed node scheduling protocol, which can retain sensing coverage needed by applications
-and increase network lifetime via putting in sleep mode some redundant nodes. In this work, the effective sensing area (ESA) concept of a sensor node is used, which refers to the sensing area that is not overlapping with another sensor's sensing area. A sensor node and by compute it's ESA can be determine whether it will be active or sleep. The suggested  work permits to sensor nodes to be in sleep mode opportunistically whilst fulfill the needed sensing coverage.
+%Cho et al.~\cite{cho2007distributed} proposed a distributed node scheduling protocol, which can retain sensing coverage needed by applications
+%and increase network lifetime via putting in sleep mode some redundant nodes. In this work, the effective sensing area (ESA) concept of a sensor node is used, which refers to the sensing area that is not overlapping with another sensor's sensing area. A sensor node and by compute it's ESA can be determine whether it will be active or sleep. The suggested  work permits to sensor nodes to be in sleep mode opportunistically whilst fulfill the needed sensing coverage.

  
  

-In~\cite{quang2008algorithm}, the authors defined a maximum sensing coverage region problem (MSCR) in WSNs and then proposed an algorithm to solve it. The
-maximum observed area fully covered by a minimum active sensors. In this work, the major property is to getting rid from the redundant sensors  in high-density WSNs and putting them in sleep mode, and choosing a smaller number of active sensors so as to be sure  that the full area is k-covered, and all events appeared in that area can be precisely and timely detected. This algorithm minimized the total energy consumption and increased the lifetime.
+%In~\cite{quang2008algorithm}, the authors defined a maximum sensing coverage region problem (MSCR) in WSNs and then proposed an algorithm to solve it. The
+%maximum observed area fully covered by a minimum active sensors. In this work, the major property is to getting rid from the redundant sensors  in high-density WSNs and putting them in sleep mode, and choosing a smaller number of active sensors so as to be sure  that the full area is k-covered, and all events appeared in that area can be precisely and timely detected. This algorithm minimized the total energy consumption and increased the lifetime.

 
 

-A novel method to divide the sensors in the WSN, called node coverage grouping (NCG) suggested~\cite{lin2010partitioning}. The sensors in the connectivity group are within sensing range of each other, and the data collected by them in the same group are supposed to be similar. They are proved that dividing n sensors via NCG into connectivity groups is a NP-hard problem. So, a heuristic algorithm of NCG with time complexity of $O(n^3)$ is proposed.
-For some applications, such as monitoring an ecosystem with extremely diversified environment, It might be premature assumption that sensors near to each other sense similar data.
+%A novel method to divide the sensors in the WSN, called node coverage grouping (NCG) suggested~\cite{lin2010partitioning}. The sensors in the connectivity group are within sensing range of each other, and the data collected by them in the same group are supposed to be similar. They are proved that dividing n sensors via NCG into connectivity groups is a NP-hard problem. So, a heuristic algorithm of NCG with time complexity of $O(n^3)$ is proposed.
+%For some applications, such as monitoring an ecosystem with extremely diversified environment, It might be premature assumption that sensors near to each other sense similar data.

 
 

-In~\cite{zaidi2009minimum}, the problem of minimum cost coverage in which full coverage is performed by using the minimum number of sensors for an arbitrary geometric shape region is addressed.  a geometric solution to the minimum cost coverage problem under a deterministic deployment is proposed. The probabilistic coverage solution which provides a relationship between the probability of coverage and the number of randomly deployed sensors in an arbitrarily-shaped region is suggested. The authors are clarified that with a random deployment about seven times more nodes are required to supply full coverage.
+%In~\cite{zaidi2009minimum}, the problem of minimum cost coverage in which full coverage is performed by using the minimum number of sensors for an arbitrary geometric shape region is addressed.  a geometric solution to the minimum cost coverage problem under a deterministic deployment is proposed. The probabilistic coverage solution which provides a relationship between the probability of coverage and the number of randomly deployed sensors in an arbitrarily-shaped region is suggested. The authors are clarified that with a random deployment about seven times more nodes are required to supply full coverage.

 
 

-A graph theoretical framework for connectivity-based coverage with configurable coverage granularity was proposed~\cite{dong2012distributed}. A new coverage criterion and scheduling approach is proposed based on cycle partition. This method is capable of build a sparse coverage set in distributed way by means of only connectivity information. This work considers only the communication range of the sensor is smaller two times the sensing range of sensor.
+%A graph theoretical framework for connectivity-based coverage with configurable coverage granularity was proposed~\cite{dong2012distributed}. A new coverage criterion and scheduling approach is proposed based on cycle partition. This method is capable of build a sparse coverage set in distributed way by means of only connectivity information. This work considers only the communication range of the sensor is smaller two times the sensing range of sensor.

 
 

-Liu et al.~\cite{liu2010energy} formulated maximum disjoint sets problem for retaining coverage and connectivity in WSN. Two algorithms are proposed for solving this problem, heuristic algorithm and network flow algorithm. This work did not take into account the sensor node failure, which is an unpredictable event because the two solutions are full centralized algorithms.
+%Liu et al.~\cite{liu2010energy} formulated maximum disjoint sets problem for retaining coverage and connectivity in WSN. Two algorithms are proposed for solving this problem, heuristic algorithm and network flow algorithm. This work did not take into account the sensor node failure, which is an unpredictable event because the two solutions are full centralized algorithms.

 
 

-The work that presented in~\cite{aslanyan2013optimal} solved the coverage and connectivity problem in sensor networks in
-an integrated way. The network lifetime is divided in a fixed number of rounds. A coverage bitmap of sensors of the domain has been generated in each round and based on this bitmap,  it has been decided which sensors
-stay active or turn it to sleep. They checked the connection of the graph via laplacian of adjancy graph of active sensors in each round.  the generation of coverage bitmap by using  Minkowski technique, the network is able to providing the desired ratio of coverage. They have been defined the  connected coverage problem as an optimization problem and a centralized genetic algorithm is used to find the solution.
+%The work that presented in~\cite{aslanyan2013optimal} solved the coverage and connectivity problem in sensor networks in
+%an integrated way. The network lifetime is divided in a fixed number of rounds. A coverage bitmap of sensors of the domain has been generated in each round and based on this bitmap,  it has been decided which sensors
+%stay active or turn it to sleep. They checked the connection of the graph via laplacian of adjancy graph of active sensors in each round.  the generation of coverage bitmap by using  Minkowski technique, the network is able to providing the desired ratio of coverage. They have been defined the  connected coverage problem as an optimization problem and a centralized genetic algorithm is used to find the solution.

 
 

-Several algorithms to retain the coverage and maximize the network lifetime were proposed in~\cite{cardei2006energy,wang2011coverage}. 
+%Several algorithms to retain the coverage and maximize the network lifetime were proposed in~\cite{cardei2006energy,wang2011coverage}. 

 
 

-\uppercase{\textbf{shortcomings}}. In spite of many energy-efficient protocols for maintaining the coverage and improving the network lifetime in WSNs were proposed, non of them ensure the coverage for the sensing field with optimal minimum number of active sensor nodes, and for a long time as possible. For example, in a full centralized algorithms, an optimal solutions can be given by using optimization approaches, but in the same time, a high energy is consumed for the execution time of the algorithm and the communications among the sensors in the sensing field, so, the  full centralized approaches are not good candidate to use it especially in large WSNs. Whilst, a full distributed algorithms can not give optimal solutions because this algorithms use only local information of the neighboring sensors, but in the same time, the energy consumption during the communications and executing the algorithm is highly lower. Whatever the case, this would result in a shorter lifetime coverage in WSNs.
+%\uppercase{\textbf{shortcomings}}. In spite of many energy-efficient protocols for maintaining the coverage and improving the network lifetime in WSNs were proposed, non of them ensure the coverage for the sensing field with optimal minimum number of active sensor nodes, and for a long time as possible. For example, in a full centralized algorithms, an optimal solutions can be given by using optimization approaches, but in the same time, a high energy is consumed for the execution time of the algorithm and the communications among the sensors in the sensing field, so, the  full centralized approaches are not good candidate to use it especially in large WSNs. Whilst, a full distributed algorithms can not give optimal solutions because this algorithms use only local information of the neighboring sensors, but in the same time, the energy consumption during the communications and executing the algorithm is highly lower. Whatever the case, this would result in a shorter lifetime coverage in WSNs.

 
 

-\uppercase{\textbf{Our Protocol}}. In this paper, a Lifetime Coverage Optimization Protocol, called (LiCO) in WSNs is suggested. The sensing field is divided into smaller subregions by means of divide-and-conquer method, and a LiCO protocol is distributed in each sensor in the subregion. The network lifetime in each subregion is divided into periods, each period includes 4 stages: Information Exchange, Leader election, decision based activity scheduling optimization, and sensing. The leaders are elected in an independent, asynchronous, and distributed way in all the subregions of the WSN. After that, energy-efficient activity scheduling mechanism based new optimization model is performed by each leader in the subregions. This optimization model is based on the perimeter coverage model in order to producing the optimal cover set of active sensors, which are taken the responsibility of sensing during the current period. LiCO protocol merges between two energy efficient mechanisms, which are used the main advantages of the centralized and distributed approaches and avoids the most of their disadvantages.
+%\uppercase{\textbf{Our Protocol}}. In this paper, a Lifetime Coverage Optimization Protocol, called (LiCO) in WSNs is suggested. The sensing field is divided into smaller subregions by means of divide-and-conquer method, and a LiCO protocol is distributed in each sensor in the subregion. The network lifetime in each subregion is divided into periods, each period includes 4 stages: Information Exchange, Leader election, decision based activity scheduling optimization, and sensing. The leaders are elected in an independent, asynchronous, and distributed way in all the subregions of the WSN. After that, energy-efficient activity scheduling mechanism based new optimization model is performed by each leader in the subregions. This optimization model is based on the perimeter coverage model in order to producing the optimal cover set of active sensors, which are taken the responsibility of sensing during the current period. LiCO protocol merges between two energy efficient mechanisms, which are used the main advantages of the centralized and distributed approaches and avoids the most of their disadvantages.

 
 
 \section{ The LiCO Protocol Description}
 \label{sec:The LiCO Protocol Description}
 
 
 \section{ The LiCO Protocol Description}
 \label{sec:The LiCO Protocol Description}

-\noindent In this section, we describe our Lifetime Coverage Optimization Protocol which is called LiCO in more detail. It is based on two efficient-energy mechanisms: the first, is partitioning the sensing field into smaller subregions, and one leader is elected for each subregion;  the second, a sensor activity scheduling based new optimization model so as to produce the optimal cover set of active sensors for the sensing stage during the period.  Obviously, these two mechanisms can be contribute in extend the network lifetime coverage efficiently. 
+\noindent In this section, we describe our Lifetime Coverage Optimization Protocol which is called LiCO in more detail.
+% It is based on two efficient-energy mechanisms: the first, is partitioning the sensing field into smaller subregions, and one leader is elected for each subregion;  the second, a sensor activity scheduling based new optimization model so as to produce the optimal cover set of active sensors for the sensing stage during the period.  Obviously, these two mechanisms can be contribute in extend the network lifetime coverage efficiently. 

 %Before proceeding in the presentation of the main ideas of the protocol, we will briefly describe the perimeter coverage model and give some necessary assumptions and definitions.
 
 \subsection{ Assumptions and Models}
 %Before proceeding in the presentation of the main ideas of the protocol, we will briefly describe the perimeter coverage model and give some necessary assumptions and definitions.
 
 \subsection{ Assumptions and Models}

-\noindent A WSN consisting of $J$ stationary sensor nodes randomly and uniformly distributed in a bounded sensor field is considered. The  wireless sensors  are deployed in high density to ensure initially a high coverage ratio of the interested area. We assume that all the sensor nodes are homogeneous in terms of  communication, sensing, and processing capabilities and heterogeneous in term of energy supply. The  location  information is available to the  sensor node  either through hardware such as embedded GPS or through location discovery algorithms. We assume that each sensor node can directly transmit its measurements to a mobile sink node. For example, a sink can be an unmanned aerial vehicle (UAV) is flying regularly over the sensor field to collect measurements from sensor nodes. A mobile sink node collects the measurements and transmits them to the base station.  We consider a boolean  disk coverage model which is the most widely used sensor coverage model in the literature. Each sensor has a constant sensing range $R_s$. All space points within a disk centered at the sensor with the radius of the sensing range is said to be covered by this sensor. We also assume that the communication range $R_c \geq 2R_s$. In  fact,   Zhang  and Zhou~\cite{Zhang05} proved that if the transmission range fulfills the previous hypothesis, a complete coverage of a convex area implies connectivity among the working nodes in the active mode.
+\noindent A WSN consisting of $J$ stationary sensor nodes randomly and uniformly distributed in a bounded sensor field is considered. The  wireless sensors  are deployed in high density to ensure initially a high coverage ratio of the interested area. We assume that all the sensor nodes are homogeneous in terms of  communication, sensing, and processing capabilities and heterogeneous in term of energy supply. The  location  information is available to the  sensor node  either through hardware such as embedded GPS or through location discovery algorithms. We assume that each sensor node can directly transmit its measurements to a mobile sink node. For example, a sink can be an unmanned aerial vehicle (UAV) flying regularly over the sensor field to collect measurements from sensor nodes. A mobile sink node collects the measurements and transmits them to the base station.  We consider a boolean  disk coverage model which is the most widely used sensor coverage model in the literature. Each sensor has a constant sensing range $R_s$. All space points within a disk centered at the sensor with the radius of the sensing range is said to be covered by this sensor. We also assume that the communication range $R_c \geq 2R_s$. In  fact,   Zhang  and Zhou~\cite{Zhang05} proved that if the transmission range fulfills the previous hypothesis, a complete coverage of a convex area implies connectivity among the working nodes in the active mode.

 
 

-\indent LiCO protocol is used the perimeter-coverage model which stated in ~\cite{huang2005coverage} as following: The sensor is said to be perimeter covered if all the points on its perimeter are covered by at least one sensor other than itself. 
+\indent LiCO protocol uses the perimeter-coverage model which states in ~\cite{huang2005coverage} as following: The sensor is said to be perimeter covered if all the points on its perimeter are covered by at least one sensor other than itself. Huang and Tseng in \cite{huang2005coverage} proves that a network area is $k-covered$ if and only if each sensor in the network is $k-perimeter-covered$.

 %According to this model, we named the intersections among the sensor nodes in the sensing field as intersection points. Instead of working with the coverage area, we consider for each sensor a set of intersection points which are determined by using perimeter-coverage model. 
 %According to this model, we named the intersections among the sensor nodes in the sensing field as intersection points. Instead of working with the coverage area, we consider for each sensor a set of intersection points which are determined by using perimeter-coverage model. 

-Figure~\ref{pcmfig} illuminates the perimeter coverage of the sensor node 0, where L refers to left point of the segment and R refers to right point of the segment. 
+Figure~\ref{pcmfig} illuminates the perimeter coverage of the sensor node $0$. On this figure, sensor $0$ has $9$ neighbors. We report for each sensor $i$ having an intersection with sensor $0$, the two intersection points,  $i\quad L$ for left point and $i\quad R$ for right point. These intersections points subdivide the perimeter of the sensor $0$ (the perimeter of the disk covered by the sensor)  into portions called segments.

 
 \begin{figure}[ht!]
 \centering
 
 \begin{figure}[ht!]
 \centering


@@ -152,51 +243,55 @@ Figure~\ref{pcmfig} illuminates the perimeter coverage of the sensor node 0, whe
 \label{pcmfig}
 \end{figure} 
 
 \label{pcmfig}
 \end{figure} 
 

-In order to determine the segments of each sensor node, which are perimeter covered by the neighboring sensors, figure~\ref{twosensors} demonstrates the way of locating the left and right points of a segment of the sensor node I covered by a sensor node J. This figure supposed that the neighbor sensor node J is located on the west of a sensor I. It Supposed that the two sensor nodes I and J are located in the positions $(I_x,I_y)$ and $(J_x,J_y)$, respectively. The distance between I and J is computed by $Dist(I,J) = \sqrt{\vert I_x - J_x \vert^2 + \vert I_y - J_y \vert^2}$ . The angle $\alpha = arccos \left(\dfrac{Dist(I,J)}{2R_s} \right) $. So, the $\pi - \alpha$ and the $\pi + \alpha$ of sensor I refers to the left and right points of the segment, which is perimeter covered by sensor node J. If the arch segment of sensor I is located within the angle $[\pi - \alpha,\pi + \alpha]$, this means it is perimeter covered by sensor node J. The left and right points of each segment are put it on the line segment $[0,2\pi]$ and then are sorted in an ascending order so as to determine the level of the perimeter coverage for each left and right point of a segment.
+Figure~\ref{twosensors} demonstrates the way of locating the left and right points of a segment for a sensor node $u$ covered by a sensor node $v$. This figure supposed that the neighbor sensor node $v$ is located on the west of a sensor $u$. It is assumed  that the two sensor nodes $v$ and $u$ are located in the positions $(v_x,v_y)$ and $(u_x,u_y)$, respectively. The distance between $v$ and $u$ is computed by $Dist(u,v) = \sqrt{\vert u_x - v_x \vert^2 + \vert u_y - v_y \vert^2}$ . The angle $\alpha$ is computed through the formula $\alpha = arccos \left(\dfrac{Dist(u,v)}{2R_s} \right) $. So, the arch of sensor $u$ falling in the angle $[\pi - \alpha,\pi + \alpha]$, is said to be perimeter-covered by sensor node $v$. 
+
+The left and right points of each segment are placed on the line segment $[0,2\pi]$. Figure~\ref{pcmfig} illustrates the segments for the 9 neighbors of sensor $0$. The points reported on the line segment separates it in intervals. For each interval, we sump up the number of parts of segments, and we deduce a level of coverage for each interval. For instance, the interval delimited by the points $5L$ and $6L$ contains three parts of segments. That means that this part of the perimeter of the sensor $0$ may be covered by three sensors, sensor $0$ itself and sensors $2$ and $5$. The level of coverage of this interval may reach $3$ if all previously mentioned sensors are active. Let say that sensors $0$, $2$ and $5$ are involved in the coverage of this interval. The table in figure~\ref{expcm} summarizes the level of coverage for each interval and the sensors involved in.  
+% to determine the level of the perimeter coverage for each left and right point of a segment.

 \begin{figure}[ht!]
 \centering
 \includegraphics[width=75mm]{twosensors.jpg}  
 \begin{figure}[ht!]
 \centering
 \includegraphics[width=75mm]{twosensors.jpg}  

-\caption{Locating the segment of I$\rq$s perimeter covered by J.}
+\caption{Locating the segment of $u$$\rq$s perimeter covered by $v$.}

 \label{twosensors}
 \end{figure} 
 
 \begin{figure}[ht!]
 \centering
 \includegraphics[width=75mm]{expcm.pdf}  
 \label{twosensors}
 \end{figure} 
 
 \begin{figure}[ht!]
 \centering
 \includegraphics[width=75mm]{expcm.pdf}  

-\caption{Perimeter segment coverage levels for sensor node 0.}
+\caption{ Coverage levels for sensor node $0$.}

 \label{expcm}
 \end{figure} 
 
 \label{expcm}
 \end{figure} 
 

-For example, consider the sensor node 0 in figure~\ref{pcmfig}, which has 9 neighbors. Figure~\ref{expcm} shows the perimeter coverage level for all left and right points of a segments that covered by a neighboring sensor nodes. Based on the figure~\ref{expcm}, the set of sensors for each left and right point of the segments illustrated in figure~\ref{ex2pcm} for the sensor node 0.
+%For example, consider the sensor node $0$ in figure~\ref{pcmfig}, which has 9 neighbors. Figure~\ref{expcm} shows the perimeter coverage level for all left and right points of a segment that covered by a neighboring sensor nodes. Based on the figure~\ref{expcm}, the set of sensors for each left and right point of the segments illustrated in figure~\ref{ex2pcm} for the sensor node 0.

 
 \begin{figure}[ht!]
 \centering
 \includegraphics[width=90mm]{ex2pcm.jpg}  
 
 \begin{figure}[ht!]
 \centering
 \includegraphics[width=90mm]{ex2pcm.jpg}  

-\caption{The set of sensors for each left or right point of segments for sensor node 0.}
+\caption{Coverage intervals and contributing sensors for sensor node 0.}

 \label{ex2pcm}
 \end{figure} 
 
 \label{ex2pcm}
 \end{figure} 
 

-The optimization algorithm that used by LiCO protocol based on the perimeter coverage levels of the left and right points of the segments and worked to minimize the number of sensor nodes for each left or right point of the segments within each sensor node. The algorithm minimize the perimeter coverage level of the left and right points of the segments, while, it assures that every perimeter coverage level of the left and right points of the segments greater than or equal to 1.
+%The optimization algorithm that used by LiCO protocol based on the perimeter coverage levels of the left and right points of the segments and worked to minimize the number of sensor nodes for each left or right point of the segments within each sensor node. The algorithm minimize the perimeter coverage level of the left and right points of the segments, while, it assures that every perimeter coverage level of the left and right points of the segments greater than or equal to 1.

 
 

-In the case of sensor node, which has a part of its sensing range outside the the border of the WSN sensing field as in figure~\ref{ex4pcm}, the perimeter coverage level for this segment is set to $\infty$, and the left and right points of the segments will not be taken into account by the optimization algorithm.
+In LiCO protocol, scheduling of sensor nodes'activities is formulated with an integer program based on coverage intervals and is detailed in section~\ref{cp}.
+
+In the case of sensor node, which has a part of its sensing range outside the border of the WSN sensing field as in figure~\ref{ex4pcm}, the coverage level for this segment is set to $\infty$, and the corresponding interval will not be taken into account by the optimization algorithm.

 \begin{figure}[ht!]
 \centering
 \includegraphics[width=75mm]{ex4pcm.jpg}  
 \caption{Part of sensing range outside the the border of WSN sensing field.}
 \label{ex4pcm}
 \end{figure} 
 \begin{figure}[ht!]
 \centering
 \includegraphics[width=75mm]{ex4pcm.jpg}  
 \caption{Part of sensing range outside the the border of WSN sensing field.}
 \label{ex4pcm}
 \end{figure} 

-Figure~\ref{ex5pcm} gives an example to compute the perimeter coverage levels for the left and right points of the segments for a sensor node 0, which has a part of its sensing range exceeding the border of the sensing field of WSN, and it has a six neighbors. In figure~\ref{ex5pcm}, the sensor node 0 has two segments outside the border of the network sensing field, so the left and right points of the two segments called -1L, -1R, -2L, and -2R.
+Figure~\ref{ex5pcm} gives an example to compute the perimeter coverage levels for the left and right points of the segments for a sensor node $0$, which has a part of its sensing range exceeding the border of the sensing field of WSN, and it has a six neighbors. In figure~\ref{ex5pcm}, the sensor node $0$ has two segments outside the border of the network sensing field, so the left and right points of the two segments called $-1L$, $-1R$, $-2L$, and $-2R$.

 \begin{figure}[ht!]
 \centering
 \includegraphics[width=75mm]{ex5pcm.jpg}  
 \begin{figure}[ht!]
 \centering
 \includegraphics[width=75mm]{ex5pcm.jpg}  

-\caption{Perimeter coverage levels for sensor node has a part of its sensing range outside the border.}
+\caption{Coverage intervals and contributing sensors for sensor node 0 having a  part of its sensing range outside the border.}

 \label{ex5pcm}
 \end{figure} 
 
 
 \subsection{The Main Idea}
 \label{ex5pcm}
 \end{figure} 
 
 
 \subsection{The Main Idea}

-\noindent The area  of  interest can  be  divided using the
-divide-and-conquer strategy into smaller areas called subregions and
+\noindent The area  of  interest can  be  divided into smaller areas called subregions and

 then our protocol will be implemented in each subregion simultaneously. LiCO protocol works into periods fashion as shown in figure~\ref{fig2}.
 \begin{figure}[ht!]
 \centering
 then our protocol will be implemented in each subregion simultaneously. LiCO protocol works into periods fashion as shown in figure~\ref{fig2}.
 \begin{figure}[ht!]
 \centering


@@ -280,8 +375,12 @@ The pseudo-code for LiCO Protocol is illustrated as follows:
 \end{algorithm}
 
 \noindent Algorithm 1 gives a brief description of the protocol applied by each sensor node (denoted by $s_k$ for a sensor node indexed by $k$). In this algorithm, the K.CurrentSize and K.PreviousSize refer to the current size and the previous size of sensor nodes in the subregion respectively.
 \end{algorithm}
 
 \noindent Algorithm 1 gives a brief description of the protocol applied by each sensor node (denoted by $s_k$ for a sensor node indexed by $k$). In this algorithm, the K.CurrentSize and K.PreviousSize refer to the current size and the previous size of sensor nodes in the subregion respectively.

-Initially, the sensor node checks its remaining energy in order to participate in the current period. Each sensor node determines its position and its subregion based Embedded GPS  or Location Discovery Algorithm. After that, all the sensors collect position coordinates, remaining energy $RE_k$, sensor node id, and the number of its one-hop live neighbors during the information exchange. 
-After the cooperation among the sensor nodes in the same subregion, the leader will be elected in distributed way, where each sensor node and based on it's information decide who is the leader. The selection criteria for the leader in order  of priority  are: larger number of neighbors,  larger remaining  energy, and  then in  case of equality, larger index. Thereafter,  if the sensor node is leader, it will execute the perimeter-coverage model for each sensor in the subregion in order to determine the segment points which would be used in the next stage by the optimization algorithm of the LiCO protocol. Every sensor node is selected as a leader, it is executed the perimeter coverage model only one time during it's life in the network. The leader has the responsibility of applying the integer program algorithm (see section~\ref{cp}), which provides a set of sensors planned to be active in the sensing stage.  As leader, it will send an Active-Sleep packet to each sensor in the same subregion to inform it if it has to be active or not. On the contrary, if the sensor is not the leader, it will wait for the Active-Sleep packet to know its state for the sensing stage.
+Initially, the sensor node checks its remaining energy in order to participate in the current period. Each sensor node determines its position and its subregion based Embedded GPS  or Location Discovery Algorithm. After that, all the sensors collect position coordinates, remaining energy $RE_k$, sensor node id, and the number of its one-hop live neighbors during the information exchange. The sensors inside a same region cooperates to elect a leader. The selection criteria for the leader in order  of priority  are: larger number of neighbors,  larger remaining  energy, and  then in  case of equality, larger index. Thereafter the leader collects information to formulate and solve the integer program which allows to construct the set of active sensors in the sensing stage.  
+
+
+%After the cooperation among the sensor nodes in the same subregion, the leader will be elected in distributed way, where each sensor node and based on it's information decide who is the leader. The selection criteria for the leader in order  of priority  are: larger number of neighbors,  larger remaining  energy, and  then in  case of equality, larger index. Thereafter,  if the sensor node is leader, it will execute the perimeter-coverage model for each sensor in the subregion in order to determine the segment points which would be used in the next stage by the optimization algorithm of the LiCO protocol. Every sensor node is selected as a leader, it is executed the perimeter coverage model only one time during it's life in the network.
+
+% The leader has the responsibility of applying the integer program algorithm (see section~\ref{cp}), which provides a set of sensors planned to be active in the sensing stage.  As leader, it will send an Active-Sleep packet to each sensor in the same subregion to inform it if it has to be active or not. On the contrary, if the sensor is not the leader, it will wait for the Active-Sleep packet to know its state for the sensing stage.

 
 
 \section{Lifetime Coverage problem formulation}
 
 
 \section{Lifetime Coverage problem formulation}


@@ -566,7 +665,7 @@ As highlighted by figures~\ref{fig3LT95} and \ref{fig3LT50}, the network lifetim
 
 %By choosing the best suited nodes, for each period, by optimizing the coverage and lifetime of the network to cover the area of interest and by letting the other ones sleep in order to be used later in next rounds, LiCO protocol efficiently prolonged the network lifetime especially for a coverage ratio greater than $50 \%$, whilst it stayed very near to  DiLCO-16 protocol for $95 \%$.  
 Figure~\ref{figLTALL} introduces the comparisons of the lifetime coverage for different coverage ratios for LiCO and DiLCO protocols. 
 
 %By choosing the best suited nodes, for each period, by optimizing the coverage and lifetime of the network to cover the area of interest and by letting the other ones sleep in order to be used later in next rounds, LiCO protocol efficiently prolonged the network lifetime especially for a coverage ratio greater than $50 \%$, whilst it stayed very near to  DiLCO-16 protocol for $95 \%$.  
 Figure~\ref{figLTALL} introduces the comparisons of the lifetime coverage for different coverage ratios for LiCO and DiLCO protocols. 

-We denote by Protocol/50, Protocol/80, Protocol/85, Protocol/90, and Protocol/95 the amount of time during which the network can satisfy an area coverage greater than $50\%$, $80\%$, $85\%$, $90\%$, and $95\%$ respectively.
+We denote by Protocol/50, Protocol/80, Protocol/85, Protocol/90, and Protocol/95 the amount of time during which the network can satisfy an area coverage greater than $50\%$, $80\%$, $85\%$, $90\%$, and $95\%$ respectively. Indeed there are applications that do not require a 100\% coverage of the surveillance region. LiCO might be an interesting  method  since it achieves a good balance between a high level coverage ratio and network lifetime.

 
 \begin{figure}[h!]
 \centering
 
 \begin{figure}[h!]
 \centering


@@ -584,7 +683,7 @@ We denote by Protocol/50, Protocol/80, Protocol/85, Protocol/90, and Protocol/95
 In this paper we have studied the problem of lifetime coverage optimization in
 WSNs. We designed a protocol LiCO that schedules node activities (wakeup and sleep) with the objective of maintaining a good coverage ratio while maximizing the network lifetime. This protocol is applied on each subregion of the area of interest. It works in periods and is based on the resolution of an integer program to select the subset of sensors operating in active mode for each period. Our work is original in so far as it proposes for the first time an integer program scheduling the activation of sensors based on their perimeter coverage level instead of using a set of targets/points to be covered.
 
 In this paper we have studied the problem of lifetime coverage optimization in
 WSNs. We designed a protocol LiCO that schedules node activities (wakeup and sleep) with the objective of maintaining a good coverage ratio while maximizing the network lifetime. This protocol is applied on each subregion of the area of interest. It works in periods and is based on the resolution of an integer program to select the subset of sensors operating in active mode for each period. Our work is original in so far as it proposes for the first time an integer program scheduling the activation of sensors based on their perimeter coverage level instead of using a set of targets/points to be covered.
 

- We carried out severals simulations to evaluate the proposed protocol.  
+ 

 
 
 %To cope with this problem, the area of interest is divided into a smaller subregions using  divide-and-conquer method, and then a LiCO protocol for optimizing the lifetime coverage in each subregion. LiCO protocol combines two efficient techniques:  network
 
 
 %To cope with this problem, the area of interest is divided into a smaller subregions using  divide-and-conquer method, and then a LiCO protocol for optimizing the lifetime coverage in each subregion. LiCO protocol combines two efficient techniques:  network


@@ -594,11 +693,13 @@ WSNs. We designed a protocol LiCO that schedules node activities (wakeup and sle
 %periods, each period consists  of four stages: (i) Information Exchange,
 %(ii) Leader Election, (iii) a Decision based new optimization model in order to
 %select the  nodes remaining  active for the last stage,  and  (iv) Sensing.
 %periods, each period consists  of four stages: (i) Information Exchange,
 %(ii) Leader Election, (iii) a Decision based new optimization model in order to
 %select the  nodes remaining  active for the last stage,  and  (iv) Sensing.

-The  simulation results show that LiCO is  is more energy-efficient than other approaches, with respect to lifetime, coverage ratio, active sensors ratio, and energy consumption. 
+We carried out severals simulations to evaluate the proposed protocol.  The  simulation results show that LiCO is  is more energy-efficient than other approaches, with respect to lifetime, coverage ratio, active sensors ratio, and energy consumption. 

 %Indeed, when dealing with large and dense WSNs, a distributed optimization approach on the subregions of WSN like the one we are proposed allows to reduce the difficulty of a single global optimization problem by partitioning it in many smaller problems, one per subregion, that can be solved more easily.
 
 %Indeed, when dealing with large and dense WSNs, a distributed optimization approach on the subregions of WSN like the one we are proposed allows to reduce the difficulty of a single global optimization problem by partitioning it in many smaller problems, one per subregion, that can be solved more easily.
 

-We plan to extend a lifetime coverage optimization problem in order to computes all active sensor schedules in only one step for many periods;
-the second, we focus on extend our protocol and optimization algorithm to take into account the heterogeneous sensors, which do not have the same energy, processing,  sensing and communication capabilities;
+We have identified different research directions that arise out of the work presented here. 
+We plan to extend our framework such that the schedules are planned for multiple periods in advance.
+%in order to compute all active sensor schedules in only one step for many periods;
+We also want to improve our integer program to take into account the heterogeneous sensors, which do not have the same energy, processing,  sensing and communication capabilities;

 %the third, we are investigating new optimization model based on the sensing range so as to maximize the lifetime coverage in WSN;
 Finally, our final goal is to implement our protocol using a sensor-testbed to evaluate their performance in real world applications.
 
 %the third, we are investigating new optimization model based on the sensing range so as to maximize the lifetime coverage in WSN;
 Finally, our final goal is to implement our protocol using a sensor-testbed to evaluate their performance in real world applications.