-This protocol minimizes the impact of unexpected node failure (not due to batteries
-running out of energy), because it works in periods.
-
- On the one hand, if a node failure is detected before making the
-decision, the node will not participate to this phase, and, on the other hand,
-if the node failure occurs after the decision, the sensing task of the network
-will be temporarily affected: only during the period of sensing until a new
-period starts.
-
-The energy consumption and some other constraints can easily be taken into
-account, since the sensors can update and then exchange their information
-(including their residual energy) at the beginning of each period. However, the
-pre-sensing phases (Information Exchange, Leader Election, and Decision) are
-energy consuming for some nodes, even when they do not join the network to
-monitor the area.
-
-
-These phases can be described in more details as follow:
-\subsection{Information Exchange Phase}
-\label{ch4:sec:02:02:01}
-The information exchange among the wireless sensor nodes is similar to that one which is described in chapter 3, sections \ref{ch3:sec:02:03:01}.
-
-\subsection{Leader Election phase}
-\label{ch4:sec:02:02:02}
-The leader election in each subregion is similar to that one which is described in chapter 3, sections\ref{ch3:sec:02:03:02}, but the difference in that the elected leader in each subregion is for each period.
-
-\subsection{Decision phase}
-\label{ch4:sec:02:02:03}
-Each WSNL will solve an integer program to select which cover sets will be
-activated in the following sensing phase to cover the subregion to which it
-belongs. The integer program 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. The integer program is based on the model
+This protocol minimizes the impact of unexpected node failure (not due to batteries running out of energy), because it works in periods.
+
+On the one hand, if a node failure is detected before making the decision, the node will not participate to this phase, and, on the other hand, if the node failure occurs after the decision, the sensing task of the network will be temporarily affected: only during the period of sensing until a new period starts.
+
+The energy consumption and some other constraints can easily be taken into account, since the sensors can update and then exchange their information (including their residual energy) at the beginning of each period. However, the pre-sensing phases (Information Exchange, Leader Election, and Decision) are energy consuming for some nodes, even when they do not join the network to monitor the area.
+
+
+
+\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 Integer Program 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}
+
+
+
+
+\subsection{Primary Points based Multiround Coverage Problem Formulation}
+%\label{ch4:sec:02:02}
+
+According to our algorithm~\ref{alg:MuDiLCO}, the integer program is based on the model
