+belongs. The \textcolor{red}{optimization algorithm} will produce $T$ cover sets, one for each round. The WSNL will send an Active-Sleep packet to each sensor in the subregion based on the algorithm's results, indicating if the sensor should be active or not in
+each round of the sensing phase.
+
+%solve an integer program
+
+\subsection{Sensing phase}
+
+The sensing phase consists of $T$ rounds. Each sensor node in the subregion will
+receive an Active-Sleep packet from WSNL, informing it to stay awake or to go to
+sleep for each round of the sensing phase. Algorithm~\ref{alg:MuDiLCO}, which
+will be executed by each node at the beginning of a period, explains how the
+Active-Sleep packet is obtained.
+
+% In each round during the sensing phase, there is a cover set of sensor nodes, in which the active sensors will execute their sensing task to preserve maximal coverage and lifetime in the subregion and this will continue until finishing the round $T$ and starting new period.
+
+\begin{algorithm}[h!]
+ % \KwIn{all the parameters related to information exchange}
+% \KwOut{$winer-node$ (: the id of the winner sensor node, which is the leader of current round)}
+ \BlankLine
+ %\emph{Initialize the sensor node and determine it's position and subregion} \;
+
+ \If{ $RE_j \geq E_{R}$ }{
+ \emph{$s_j.status$ = COMMUNICATION}\;
+ \emph{Send $INFO()$ packet to other nodes in the subregion}\;
+ \emph{Wait $INFO()$ packet from other nodes in the subregion}\;
+ %\emph{UPDATE $RE_j$ for every sent or received INFO Packet}\;
+ %\emph{ Collect information and construct the list L for all nodes in the subregion}\;
+
+ %\If{ the received INFO Packet = No. of nodes in it's subregion -1 }{
+ \emph{LeaderID = Leader election}\;
+ \If{$ s_j.ID = LeaderID $}{
+ \emph{$s_j.status$ = COMPUTATION}\;
+ \emph{$\left\{\left(X_{1,k},\dots,X_{T,k}\right)\right\}_{k \in J}$ =
+ Execute \textcolor{red}{Optimization Algorithm}($T,J$)}\;
+ \emph{$s_j.status$ = COMMUNICATION}\;
+ \emph{Send $ActiveSleep()$ to each node $k$ in subregion a packet \\
+ with vector of activity scheduling $(X_{1,k},\dots,X_{T,k})$}\;
+ \emph{Update $RE_j $}\;
+ }
+ \Else{
+ \emph{$s_j.status$ = LISTENING}\;
+ \emph{Wait $ActiveSleep()$ packet from the Leader}\;
+ % \emph{After receiving Packet, Retrieve the schedule and the $T$ rounds}\;
+ \emph{Update $RE_j $}\;
+ }
+ % }
+ }
+ \Else { Exclude $s_j$ from entering in the current sensing phase}
+
+ % \emph{return X} \;
+\caption{MuDiLCO($s_j$)}
+\label{alg:MuDiLCO}
+
+\end{algorithm}
+
+
+
+
+
+
+\section{\textcolor{red}{ Optimization Algorithm for Multiround Lifetime Coverage Optimization}}
+\label{oa}
+As shown in Algorithm~\ref{alg:MuDiLCO}, the leader will execute an optimization algorithm based on an integer program. The integer program is based on the model
