From 8cf62d51df224fa888c577f5337674a9e5867ed3 Mon Sep 17 00:00:00 2001 From: ali Date: Fri, 29 May 2015 16:12:29 +0200 Subject: [PATCH] Update by Ali --- ACRONYMS.tex | 0 Abstruct.tex | 0 CHAPITRE_01.tex | 0 CHAPITRE_02.tex | 0 CHAPITRE_03.tex | 3 +- CHAPITRE_04.tex | 63 ++++++++++-------------- CHAPITRE_05.tex | 0 CHAPITRE_06.tex | 0 CONCLUSION.tex | 0 Figures/CHAPITRE_01.tex~ | 0 Figures/CHAPITRE_02.tex~ | 0 Figures/Introduction.tex~ | 0 Figures/bib.tex~ | 0 Figures/ch1/RDM-eps-converted-to.pdf | Bin Figures/ch1/RDM.eps | 0 Figures/ch1/RDM.pdf | Bin Figures/ch1/WNT-eps-converted-to.pdf | Bin Figures/ch1/WNT.eps | 0 Figures/ch1/WNT.pdf | Bin Figures/ch1/WSN-M.eps | 0 Figures/ch1/WSN-M.pdf | Bin Figures/ch1/WSN-S.pdf | Bin Figures/ch1/WSNAP-eps-converted-to.pdf | Bin Figures/ch1/WSNAP.eps | 0 Figures/ch1/WSNAP.pdf | Bin Figures/ch1/WSNT.jpg | Bin Figures/ch1/twsn2.pdf | Bin Figures/ch1/typesWSN.pdf | Bin Figures/ch1/wsn-t-eps-converted-to.pdf | Bin Figures/ch1/wsn-t.eps | 0 Figures/ch1/wsn.jpg | Bin Figures/ch2/DESK.eps | 0 Figures/ch2/DESK.jpeg | Bin Figures/ch2/GAF1.eps | 0 Figures/ch2/GAF1.jpeg | Bin Figures/ch2/GAF2.eps | 0 Figures/ch2/GAF2.jpeg | Bin Figures/ch2/P1.jpg | Bin Figures/ch2/P11.jpg | Bin Figures/ch2/P2.jpg | Bin Figures/ch2/P22.jpg | Bin Figures/ch4/FirstModel.pdf | Bin Figures/ch4/OneSensingRound.jpg | Bin Figures/ch4/R1/ASR.pdf | Bin Figures/ch4/R1/CR.pdf | Bin Figures/ch4/R1/EC50.pdf | Bin Figures/ch4/R1/EC95.pdf | Bin Figures/ch4/R1/LT50.pdf | Bin Figures/ch4/R1/LT95.pdf | Bin Figures/ch4/R1/SR.pdf | Bin Figures/ch4/R1/T.eps | 0 Figures/ch4/R1/T.pdf | Bin Figures/ch4/R1/T.ps | 0 Figures/ch4/R2/ASR.pdf | Bin Figures/ch4/R2/CR.pdf | Bin Figures/ch4/R2/EC50.pdf | Bin Figures/ch4/R2/EC95.pdf | Bin Figures/ch4/R2/LT50.pdf | Bin Figures/ch4/R2/LT95.pdf | Bin Figures/ch4/R2/SR.pdf | Bin Figures/ch4/R2/T.eps | 0 Figures/ch4/R2/T.pdf | Bin Figures/ch4/R2/T.ps | 0 Figures/ch4/R3/ASR.pdf | Bin Figures/ch4/R3/CR.pdf | Bin Figures/ch4/R3/EC50.pdf | Bin Figures/ch4/R3/EC95.pdf | Bin Figures/ch4/R3/LT50.pdf | Bin Figures/ch4/R3/LT95.pdf | Bin Figures/ch4/R3/SR.pdf | Bin Figures/ch4/fig21.pdf | Bin Figures/ch4/fig22.pdf | Bin Figures/ch4/fig23.pdf | Bin Figures/ch4/fig24.pdf | Bin Figures/ch4/fig25.pdf | Bin Figures/ch4/fig26.pdf | Bin Figures/ch4/fig27.pdf | Bin Figures/ch4/principles13.pdf | Bin Figures/ch5/GeneralModel.jpg | Bin Figures/ch5/Modelgeneral.pdf | Bin Figures/ch5/R1/ASR.pdf | Bin Figures/ch5/R1/CR.pdf | Bin Figures/ch5/R1/EC50.pdf | Bin Figures/ch5/R1/EC95.pdf | Bin Figures/ch5/R1/LT50.pdf | Bin Figures/ch5/R1/LT95.pdf | Bin Figures/ch5/R1/SR.pdf | Bin Figures/ch5/R1/T.pdf | Bin Figures/ch6/Model.pdf | Bin Figures/ch6/R/ASR-eps-converted-to.pdf | Bin Figures/ch6/R/ASR.eps | 0 Figures/ch6/R/ASR.pdf | Bin Figures/ch6/R/CR-eps-converted-to.pdf | Bin Figures/ch6/R/CR.eps | 0 Figures/ch6/R/CR.pdf | Bin Figures/ch6/R/EC50-eps-converted-to.pdf | Bin Figures/ch6/R/EC50.eps | 0 Figures/ch6/R/EC50.pdf | Bin Figures/ch6/R/EC95-eps-converted-to.pdf | Bin Figures/ch6/R/EC95.eps | 0 Figures/ch6/R/EC95.pdf | Bin Figures/ch6/R/LT50-eps-converted-to.pdf | Bin Figures/ch6/R/LT50.eps | 0 Figures/ch6/R/LT50.pdf | Bin Figures/ch6/R/LT95-eps-converted-to.pdf | Bin Figures/ch6/R/LT95.eps | 0 Figures/ch6/R/LT95.pdf | Bin Figures/ch6/R/LTa-eps-converted-to.pdf | Bin Figures/ch6/R/LTa.eps | 0 Figures/ch6/R/LTa.pdf | Bin Figures/ch6/ex4pcm.jpg | Bin Figures/ch6/ex5pcm.jpg | Bin Figures/ch6/expcm.pdf | Bin Figures/ch6/expcm2.jpg | Bin Figures/ch6/pcm.jpg | Bin Figures/ch6/twosensors.jpg | Bin Figures/citation.tex~ | 0 Figures/entete.tex~ | 0 Figures/these.tex~ | 0 INTRODUCTION.tex | 0 Resume.tex | 0 Thesis.tex | 0 Thesis.toc | 8 +-- algorithme.sty | 0 bib.bib | 0 changemargin.sty | 0 drop.sty | 0 dropping.sty | 0 entete.tex | 0 missfont.log | 0 upmethodology-document.sty | 0 upmethodology-fmt.sty | 0 upmext-spimufcphdthesis.cfg | 0 yfonts.sty | 0 134 files changed, 32 insertions(+), 42 deletions(-) mode change 100644 => 100755 ACRONYMS.tex mode change 100644 => 100755 Abstruct.tex mode change 100644 => 100755 CHAPITRE_01.tex mode change 100644 => 100755 CHAPITRE_02.tex mode change 100644 => 100755 CHAPITRE_03.tex mode change 100644 => 100755 CHAPITRE_04.tex mode change 100644 => 100755 CHAPITRE_05.tex mode change 100644 => 100755 CHAPITRE_06.tex mode change 100644 => 100755 CONCLUSION.tex mode change 100644 => 100755 Figures/CHAPITRE_01.tex~ mode change 100644 => 100755 Figures/CHAPITRE_02.tex~ mode change 100644 => 100755 Figures/Introduction.tex~ mode change 100644 => 100755 Figures/bib.tex~ mode change 100644 => 100755 Figures/ch1/RDM-eps-converted-to.pdf mode change 100644 => 100755 Figures/ch1/RDM.eps mode change 100644 => 100755 Figures/ch1/RDM.pdf mode change 100644 => 100755 Figures/ch1/WNT-eps-converted-to.pdf mode change 100644 => 100755 Figures/ch1/WNT.eps mode change 100644 => 100755 Figures/ch1/WNT.pdf mode change 100644 => 100755 Figures/ch1/WSN-M.eps mode change 100644 => 100755 Figures/ch1/WSN-M.pdf mode change 100644 => 100755 Figures/ch1/WSN-S.pdf mode change 100644 => 100755 Figures/ch1/WSNAP-eps-converted-to.pdf mode change 100644 => 100755 Figures/ch1/WSNAP.eps mode change 100644 => 100755 Figures/ch1/WSNAP.pdf mode change 100644 => 100755 Figures/ch1/WSNT.jpg mode change 100644 => 100755 Figures/ch1/twsn2.pdf mode change 100644 => 100755 Figures/ch1/typesWSN.pdf mode change 100644 => 100755 Figures/ch1/wsn-t-eps-converted-to.pdf mode change 100644 => 100755 Figures/ch1/wsn-t.eps mode change 100644 => 100755 Figures/ch1/wsn.jpg mode change 100644 => 100755 Figures/ch2/DESK.eps mode change 100644 => 100755 Figures/ch2/DESK.jpeg mode change 100644 => 100755 Figures/ch2/GAF1.eps mode change 100644 => 100755 Figures/ch2/GAF1.jpeg mode change 100644 => 100755 Figures/ch2/GAF2.eps mode change 100644 => 100755 Figures/ch2/GAF2.jpeg mode change 100644 => 100755 Figures/ch2/P1.jpg mode change 100644 => 100755 Figures/ch2/P11.jpg mode change 100644 => 100755 Figures/ch2/P2.jpg mode change 100644 => 100755 Figures/ch2/P22.jpg mode change 100644 => 100755 Figures/ch4/FirstModel.pdf mode change 100644 => 100755 Figures/ch4/OneSensingRound.jpg mode change 100644 => 100755 Figures/ch4/R1/ASR.pdf mode change 100644 => 100755 Figures/ch4/R1/CR.pdf mode change 100644 => 100755 Figures/ch4/R1/EC50.pdf mode change 100644 => 100755 Figures/ch4/R1/EC95.pdf mode change 100644 => 100755 Figures/ch4/R1/LT50.pdf mode change 100644 => 100755 Figures/ch4/R1/LT95.pdf mode change 100644 => 100755 Figures/ch4/R1/SR.pdf mode change 100644 => 100755 Figures/ch4/R1/T.eps mode change 100644 => 100755 Figures/ch4/R1/T.pdf mode change 100644 => 100755 Figures/ch4/R1/T.ps mode change 100644 => 100755 Figures/ch4/R2/ASR.pdf mode change 100644 => 100755 Figures/ch4/R2/CR.pdf mode change 100644 => 100755 Figures/ch4/R2/EC50.pdf mode change 100644 => 100755 Figures/ch4/R2/EC95.pdf mode change 100644 => 100755 Figures/ch4/R2/LT50.pdf mode change 100644 => 100755 Figures/ch4/R2/LT95.pdf mode change 100644 => 100755 Figures/ch4/R2/SR.pdf mode change 100644 => 100755 Figures/ch4/R2/T.eps mode change 100644 => 100755 Figures/ch4/R2/T.pdf mode change 100644 => 100755 Figures/ch4/R2/T.ps mode change 100644 => 100755 Figures/ch4/R3/ASR.pdf mode change 100644 => 100755 Figures/ch4/R3/CR.pdf mode change 100644 => 100755 Figures/ch4/R3/EC50.pdf mode change 100644 => 100755 Figures/ch4/R3/EC95.pdf mode change 100644 => 100755 Figures/ch4/R3/LT50.pdf mode change 100644 => 100755 Figures/ch4/R3/LT95.pdf mode change 100644 => 100755 Figures/ch4/R3/SR.pdf mode change 100644 => 100755 Figures/ch4/fig21.pdf mode change 100644 => 100755 Figures/ch4/fig22.pdf mode change 100644 => 100755 Figures/ch4/fig23.pdf mode change 100644 => 100755 Figures/ch4/fig24.pdf mode change 100644 => 100755 Figures/ch4/fig25.pdf mode change 100644 => 100755 Figures/ch4/fig26.pdf mode change 100644 => 100755 Figures/ch4/fig27.pdf mode change 100644 => 100755 Figures/ch4/principles13.pdf mode change 100644 => 100755 Figures/ch5/GeneralModel.jpg mode change 100644 => 100755 Figures/ch5/Modelgeneral.pdf mode change 100644 => 100755 Figures/ch5/R1/ASR.pdf mode change 100644 => 100755 Figures/ch5/R1/CR.pdf mode change 100644 => 100755 Figures/ch5/R1/EC50.pdf mode change 100644 => 100755 Figures/ch5/R1/EC95.pdf mode change 100644 => 100755 Figures/ch5/R1/LT50.pdf mode change 100644 => 100755 Figures/ch5/R1/LT95.pdf mode change 100644 => 100755 Figures/ch5/R1/SR.pdf mode change 100644 => 100755 Figures/ch5/R1/T.pdf mode change 100644 => 100755 Figures/ch6/Model.pdf mode change 100644 => 100755 Figures/ch6/R/ASR-eps-converted-to.pdf mode change 100644 => 100755 Figures/ch6/R/ASR.eps mode change 100644 => 100755 Figures/ch6/R/ASR.pdf mode change 100644 => 100755 Figures/ch6/R/CR-eps-converted-to.pdf mode change 100644 => 100755 Figures/ch6/R/CR.eps mode change 100644 => 100755 Figures/ch6/R/CR.pdf mode change 100644 => 100755 Figures/ch6/R/EC50-eps-converted-to.pdf mode change 100644 => 100755 Figures/ch6/R/EC50.eps mode change 100644 => 100755 Figures/ch6/R/EC50.pdf mode change 100644 => 100755 Figures/ch6/R/EC95-eps-converted-to.pdf mode change 100644 => 100755 Figures/ch6/R/EC95.eps mode change 100644 => 100755 Figures/ch6/R/EC95.pdf mode change 100644 => 100755 Figures/ch6/R/LT50-eps-converted-to.pdf mode change 100644 => 100755 Figures/ch6/R/LT50.eps mode change 100644 => 100755 Figures/ch6/R/LT50.pdf mode change 100644 => 100755 Figures/ch6/R/LT95-eps-converted-to.pdf mode change 100644 => 100755 Figures/ch6/R/LT95.eps mode change 100644 => 100755 Figures/ch6/R/LT95.pdf mode change 100644 => 100755 Figures/ch6/R/LTa-eps-converted-to.pdf mode change 100644 => 100755 Figures/ch6/R/LTa.eps mode change 100644 => 100755 Figures/ch6/R/LTa.pdf mode change 100644 => 100755 Figures/ch6/ex4pcm.jpg mode change 100644 => 100755 Figures/ch6/ex5pcm.jpg mode change 100644 => 100755 Figures/ch6/expcm.pdf mode change 100644 => 100755 Figures/ch6/expcm2.jpg mode change 100644 => 100755 Figures/ch6/pcm.jpg mode change 100644 => 100755 Figures/ch6/twosensors.jpg mode change 100644 => 100755 Figures/citation.tex~ mode change 100644 => 100755 Figures/entete.tex~ mode change 100644 => 100755 Figures/these.tex~ mode change 100644 => 100755 INTRODUCTION.tex mode change 100644 => 100755 Resume.tex mode change 100644 => 100755 Thesis.tex mode change 100644 => 100755 Thesis.toc mode change 100644 => 100755 algorithme.sty mode change 100644 => 100755 bib.bib mode change 100644 => 100755 changemargin.sty mode change 100644 => 100755 drop.sty mode change 100644 => 100755 dropping.sty mode change 100644 => 100755 entete.tex mode change 100644 => 100755 missfont.log mode change 100644 => 100755 upmethodology-document.sty mode change 100644 => 100755 upmethodology-fmt.sty mode change 100644 => 100755 upmext-spimufcphdthesis.cfg mode change 100644 => 100755 yfonts.sty diff --git a/ACRONYMS.tex b/ACRONYMS.tex old mode 100644 new mode 100755 diff --git a/Abstruct.tex b/Abstruct.tex old mode 100644 new mode 100755 diff --git a/CHAPITRE_01.tex b/CHAPITRE_01.tex old mode 100644 new mode 100755 diff --git a/CHAPITRE_02.tex b/CHAPITRE_02.tex old mode 100644 new mode 100755 diff --git a/CHAPITRE_03.tex b/CHAPITRE_03.tex old mode 100644 new mode 100755 index 25a2405..70ed42b --- a/CHAPITRE_03.tex +++ b/CHAPITRE_03.tex @@ -20,7 +20,8 @@ For this reason, several problems are modeled by an optimization problem for ins %Therefore, in order to get the optimal solutions for these mathematical optimization problems, the optimization solver is the best candidate tool to solve them. The optimization solver takes mathematical optimization problem descriptions in a certain file format and calculates their optimal solution. Optimization solvers dedicated to specific resolution methods (meta-heuristics, linear programming, etc) are required. %Many important real-world problems have formulated as integer programming problems. -In this dissertation, we use linear programming because we used integer programs to optimize the coverage and the lifetime in WSNs. +%In this dissertation, we use linear programming because we used integer programs to optimize the coverage and the lifetime in WSNs. +In this dissertation, we optimize the coverage and the lifetime in WSNs and the problem is formulated through linear programming. These kind of models allow to obtain optimal solutions satisfying an objective (for instance, maximize coverage) under constraints (for instance, available remaining energy). The remainder of this chapter is organized as follows. The next section is devoted to the evaluation tools for evaluating and validating the performance of proposed algorithms and protocols. Section \ref{ch3:3} gives the most popular free and commercial linear optimization solvers to solve the linear programming problems. Finally, we give concluding remarks in section \ref{ch3:4}. diff --git a/CHAPITRE_04.tex b/CHAPITRE_04.tex old mode 100644 new mode 100755 index 52d2916..9538975 --- a/CHAPITRE_04.tex +++ b/CHAPITRE_04.tex @@ -4,39 +4,35 @@ %% %% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%% -\chapter{Distributed Lifetime Coverage Optimization Protocol in Wireless Sensor Networks} +\chapter{Distributed Lifetime Coverage Optimization Protocol} \label{ch4} \section{Introduction} \label{ch4:sec:01} -Energy efficiency is a crucial issue in wireless sensor networks since the sensory consumption, in order to maximize the network lifetime, represents the major difficulty when designing WSNs. As a consequence, one of the scientific research challenges in WSNs, which has been addressed by a large amount of literature -during the last few years, is the design of energy efficient approaches for coverage and connectivity~\cite{ref94}. Coverage reflects how well a sensor field is monitored. On the one hand, we want to monitor the area of interest in the most efficient way~\cite{ref95}. On the other hand, we want to use as little energy as possible. Sensor nodes are battery-powered with no means of recharging or replacing, usually due to environmental (hostile or +%Energy efficiency is a crucial issue in wireless sensor networks since the sensory consumption, in order to maximize the network lifetime, represents the major difficulty when designing WSNs. As a consequence, one of the scientific research challenges in WSNs, which has been addressed by a large amount of literature during the last few years, is the design of energy efficient approaches for coverage and connectivity~\cite{ref94}. +Coverage reflects how well a sensor field is monitored. On the one hand, we want to monitor the area of interest in the most efficient way~\cite{ref95}. On the other hand, we want to use as little energy as possible. Sensor nodes are battery-powered with no means of recharging or replacing, usually due to environmental (hostile or unpractical environments) or cost reasons. Therefore, it is desired that the WSNs are deployed with high densities so as to exploit the overlapping sensing regions of some sensor nodes to save energy by turning off some of them during the sensing phase to prolong the network lifetime. In this chapter, we design a protocol that focuses on the area coverage problem with the objective of maximizing the network lifetime. Our proposition, the Distributed Lifetime Coverage Optimization (DiLCO) protocol, maintains the coverage and improves the lifetime in WSNs. The area of interest is first -divided into subregions using a divide-and-conquer algorithm and an activity scheduling for sensor nodes is then planned by the elected leader in each subregion. In fact, the nodes in a subregion can be seen as a cluster where each node sends sensing data to the cluster head or the sink node. Furthermore, the activities in a subregion/cluster can continue even if another cluster stops due -to too many node failures. Our DiLCO protocol considers periods, where a period starts with a discovery phase to exchange information between sensors of the same subregion, in order to choose in a suitable manner a sensor node (the leader) to carry out the coverage strategy. In each subregion, the activation of the sensors for the sensing phase of the current period is obtained by solving -an integer program. The resulting activation vector is broadcast by a leader to every node of its subregion. +divided into subregions using a divide-and-conquer algorithm and an activity scheduling for sensor nodes is then planned by the elected leader in each subregion. In fact, the nodes in a subregion can be seen as a cluster where each node sends sensing data to the cluster head or the sink node. Furthermore, the activities in a subregion/cluster can continue even if another cluster stops due to too many node failures. Our DiLCO protocol considers periods, where a period starts with a discovery phase to exchange information between sensors of the same subregion, in order to choose in a suitable manner a sensor node (the leader) to carry out the coverage strategy. In each subregion, the activation of the sensors for the sensing phase of the current period is obtained by solving an integer program. The resulting activation vector is broadcast by each leader node to every node of its subregion. -The remainder of this chapter is organized as follows. The next section is devoted to the DiLCO protocol description. Section \ref{ch4:sec:03} gives the primary points based coverage problem formulation which is used to schedule the activation of sensors. Section \ref{ch4:sec:04} shows the simulation -results obtained using the discrete event simulator OMNeT++ \cite{ref158}. They fully demonstrate the usefulness of the proposed approach. Finally, we give concluding remarks in section \ref{ch4:sec:05}. +The remainder of this chapter is organized as follows. The next section is devoted to the DiLCO protocol description. Section \ref{ch4:sec:03} gives the primary points based coverage problem formulation which is used to schedule the activation of sensors. Section \ref{ch4:sec:04} shows the simulation results obtained using the discrete event simulator OMNeT++ \cite{ref158}. They fully demonstrate the usefulness of the proposed approach. Finally, we give concluding remarks in section \ref{ch4:sec:05}. \section{Description of the DiLCO Protocol} \label{ch4:sec:02} -\noindent In this section, we introduce the DiLCO protocol which is distributed on each subregion in the area of interest. It is based on two efficient -techniques: network leader election and sensor activity scheduling for coverage preservation and energy conservation, applied periodically to efficiently maximize the lifetime in the network. +\noindent In this section, we introduce the DiLCO protocol which is distributed on each subregion in the area of interest. It is based on two efficient techniques: network leader election and sensor activity scheduling for coverage preservation and energy conservation, applied periodically to efficiently maximize the lifetime of the network. \subsection{Assumptions and Network Model} \label{ch4:sec:02:01} -\noindent We consider a sensor network composed of static nodes distributed independently and uniformly at random. A high-density deployment ensures a high coverage ratio of the interested area at the start. The nodes are supposed to have homogeneous characteristics from a communication and a processing point of view, whereas they have heterogeneous energy provisions. Each node has access to its location thanks, either to a hardware component (like a GPS unit) or a location discovery algorithm. Furthermore, we assume that sensor nodes are time synchronized in order to properly coordinate their operations to achieve complex sensing tasks~\cite{ref157}. The two sensor nodes have been supposed neighbors if the euclidean distance between them is at most equal to 2$R_s$. +\noindent We consider a sensor network composed of static nodes distributed independently and uniformly at random. A high-density deployment ensures a high coverage ratio of the interested area at the start. The nodes are supposed to have homogeneous characteristics from a communication and a processing point of view, whereas they have heterogeneous energy provisions. Each node has access to its location thanks, either to a hardware component (like a GPS unit) or a location discovery algorithm. Furthermore, we assume that sensor nodes are time synchronized in order to properly coordinate their operations to achieve complex sensing tasks~\cite{ref157}. Two sensor nodes are supposed to be neighbors if the euclidean distance between them is at most equal to 2$R_s$. -\indent We consider a boolean disk coverage model which is the most widely used sensor coverage model in the literature. Thus, since a sensor has a constant sensing range $R_s$, every space points within a disk centered at a sensor with the radius of the sensing range is said to be covered with this sensor. We also assume that the communication range $R_c$ is at least twice the sensing range $R_s$ (i.e., $R_c \geq 2R_s$). In fact, Zhang and Hou~\cite{ref126} 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. We assume that each sensor node can directly transmit its measurements toward 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. +\indent We consider a boolean disk coverage model which is the most widely used sensor coverage model in the literature. Thus, since a sensor has a constant sensing range $R_s$, every space points within a disk centered at a sensor with the radius of the sensing range is said to be covered with this sensor. We also assume that the communication range $R_c$ is at least twice the sensing range $R_s$ (i.e., $R_c \geq 2R_s$). In fact, Zhang and Hou~\cite{ref126} 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. We assume that each sensor node can directly transmit its measurements toward 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. The mobile sink node collects the measurements and transmits them to the base station. During the execution of the DiLCO protocol, two kinds of packet will be used: @@ -61,8 +57,8 @@ There are five possible status for each sensor node in the network: We can calculate the positions of the selected primary points in the circle disk of the sensing range of a wireless sensor node (see Figure~\ref{fig1}) as follows:\\ - -$(p_x,p_y)$ = point center of wireless sensor node\\ +Assuming that the point center of a wireless sensor node is located at $(p_x,p_y)$, we can define up to 25 primary points $X_1$ to $X_25$. +%$(p_x,p_y)$ = point center of wireless sensor node\\ $X_1=(p_x,p_y)$ \\ $X_2=( p_x + R_s * (1), p_y + R_s * (0) )$\\ $X_3=( p_x + R_s * (-1), p_y + R_s * (0)) $\\ @@ -131,34 +127,25 @@ Below, we describe each phase in more details. \subsubsection{Information Exchange Phase} \label{ch4:sec:02:03:01} -Each sensor node $j$ sends its position, remaining energy $RE_j$, and the number -of neighbors $NBR_j$ to all wireless sensor nodes in its subregion by using an -INFO packet (containing information on position coordinates, current remaining -energy, sensor node ID, number of its one-hop live neighbors) and then waits for -packets sent by other nodes. After that, each node will have information about -all the sensor nodes in the subregion. In our model, the remaining energy -corresponds to the time that a sensor can live in the active mode. +Each sensor node $j$ sends its position, remaining energy $RE_j$, and the number of neighbors $NBR_j$ to all sensor nodes in its subregion by using an INFO packet (containing information on position coordinates, current remaining energy, sensor node ID, number of its one-hop live neighbors) and then waits for packets sent by other nodes. After that, each node will have information about +all the sensor nodes in the subregion. In our model, the remaining energy corresponds to the time that a sensor can live in the active mode. \subsubsection{Leader Election Phase} \label{ch4:sec:02:03:02} -This step includes choosing the Wireless Sensor Node Leader (WSNL), which will be responsible for executing the coverage algorithm. Each subregion in the area of interest will select its own WSNL independently for each round. All the sensor nodes cooperate to select WSNL. The nodes in the same subregion will select the leader based on the received information from all other nodes in the same subregion. The selection criteria are, in order of importance: larger number of neighbors, larger remaining energy, and then in case of equality, larger index. Observations on previous simulations suggest using the number of one-hop neighbors as the primary criterion to reduce energy consumption due to the communications. +This step includes choosing a wireless sensor node called leader, which will be responsible for executing the coverage algorithm. Each subregion in the area of interest will select its own leader independently for each period. All the sensor nodes cooperate to select the leader. The nodes in the same subregion will select the leader based on the received information from all other nodes in the same subregion. The selection criteria are, in order of importance: larger number of neighbors, larger remaining energy, and then in case of equality, larger index. Observations on previous simulations suggest using the number of one-hop neighbors as the primary criterion to reduce energy consumption due to the communications. \subsubsection{Decision phase} \label{ch4:sec:02:03:03} -The WSNL will solve an integer program (see section~\ref{ch4:sec:03}) to select which sensors will be activated in the following sensing phase to cover the subregion. WSNL will send Active-Sleep packet to each sensor in the subregion based on the algorithm's results. +The leader will solve an integer program (see section~\ref{ch4:sec:03}) to select which sensors will be activated in the following sensing phase to cover the subregion. Leader will send ActiveSleep packet to each sensor in the subregion based on the algorithm's results. -($RE_j$) corresponds to its remaining energy) to be -alive during the selected rounds knowing that $E_{th}$ is the amount of energy -required to be alive during one round. +%($RE_j$) corresponds to its remaining energy) to be alive during the selected rounds knowing that $E_{th}$ is the amount of energy required to be alive during one round. \subsubsection{Sensing phase} \label{ch4:sec:02:03:04} -Active sensors in the round will execute their sensing task to preserve maximal coverage in the region of interest. We will assume that the cost of keeping a node awake (or asleep) for sensing task is the same for all wireless sensor nodes in the network. Each sensor will receive an Active-Sleep packet from WSNL informing it to stay awake or to go to sleep for a time equal to the period of sensing until starting a new round. +Active sensors in the round will execute their sensing task to preserve maximal coverage in the region of interest. We will assume that the cost of keeping a node awake (or asleep) for sensing task is the same for all wireless sensor nodes in the network. Each sensor will receive an ActiveSleep packet from the leader informing it to stay awake or to go to sleep for a time equal to the round of sensing until starting a new period. -An outline of the protocol implementation is given by Algorithm~\ref{alg:DiLCO} which describes the execution of a period by a node (denoted by $s_j$ for a sensor node indexed by $j$). In the beginning, a node checks whether it has enough energy to stay active during the next sensing phase (i.e., the remaining energy ($RE_j$) $\geq$ the amount of energy -required to be alive during one round($E_{th}$)). If yes, it exchanges information with all the other nodes belonging to the same subregion: it collects from each node its position coordinates, remaining energy ($RE_j$), ID, -and the number of one-hop neighbors still alive. Once the first phase is completed, the nodes of a subregion choose a leader to take the decision based on the following criteria with decreasing importance: larger number of neighbors, larger remaining energy, and then in case of equality, larger index. After that, if the sensor node is leader, it will execute the integer program algorithm (see Section~\ref{ch4:sec:03}) which provides a set of sensors planned to be active in the next sensing phase. As leader, it will send an Active-Sleep packet to each sensor in the same subregion to indicate it if it has to be active or not. Alternately, if the sensor is not the leader, it will wait for the Active-Sleep packet to know its state for the coming sensing phase. +An outline of the protocol implementation is given by Algorithm~\ref{alg:DiLCO} which describes the execution of a period by a node (denoted by $s_j$ for a sensor node indexed by $j$). In the beginning, a node checks whether it has enough energy to stay active during the next sensing phase (i.e., the remaining energy ($RE_j$) $\geq$ $E_{th}$ (the amount of energy required to be alive during one round)). If yes, it exchanges information with all the other nodes belonging to the same subregion: it collects from each node its position coordinates, remaining energy ($RE_j$), ID, and the number of one-hop neighbors still alive. Once the first phase is completed, the nodes of a subregion choose a leader to take the decision based on the following criteria with decreasing importance: larger number of neighbors, larger remaining energy, and then in case of equality, larger index. After that, if the sensor node is leader, it will execute the integer program algorithm (see Section~\ref{ch4:sec:03}) which provides a set of sensors planned to be active in the next sensing phase. As leader, it will send an Active-Sleep packet to each sensor in the same subregion to indicate it if it has to be active or not. Alternately, if the sensor is not the leader, it will wait for the Active-Sleep packet to know its state for the coming sensing phase. \begin{algorithm}[h!] @@ -199,8 +186,8 @@ and the number of one-hop neighbors still alive. Once the first phase is \end{algorithm} - -\section{Primary Points based Coverage Problem Formulation} +%Primary Points based +\section{Coverage Problem Formulation} \label{ch4:sec:03} \indent Our model is based on the model proposed by \cite{ref156} where the objective is to find a maximum number of disjoint cover sets. To accomplish @@ -288,7 +275,9 @@ overcoverage of primary points to activate as few sensors as possible. Second, to avoid a lack of area monitoring in a subregion we minimize the undercoverage. Both weights $w_\theta$ and $w_U$ must be carefully chosen in order to guarantee that the maximum number of points are covered during each -period. +period. In our simulations, priority is given to the coverage by choosing $W_{U}$ very +large compared to $W_{\theta}$. + \section{Simulation Results and Analysis} \label{ch4:sec:04} @@ -339,19 +328,19 @@ interest of $(50 \times 25)~m^2 $ in such a way that they cover the field with a high coverage ratio. -\subsection{Modeling Language and Optimization Solver} +\subsection{Modeling Language and Optimization Solver} \label{ch4:sec:04:02} The modeling language for Mathematical Programming (AMPL)~\cite{AMPL} is employed to generate the integer program instance in a standard format, which is then read and solved by the optimization solver GLPK (GNU linear Programming Kit available in the public domain) \cite{glpk} through a Branch-and-Bound method. \subsection{Energy Consumption Model} \label{ch4:sec:04:03} -\indent In this dissertation, we used an energy consumption model proposed by~\cite{DESK} and based on \cite{ref112} with slight modifications. The energy consumption for sending/receiving the packets is added, whereas the part related to the sensing range is removed because we consider a fixed sensing range. +\indent In this dissertation, we used an energy consumption model proposed by~\cite{DESK} and based on \cite{ref112} with slight modifications. The energy consumption for sending/receiving the packets is added, whereas the part related to the dynamic sensing range is removed because we consider a fixed sensing range. \indent For our energy consumption model, we refer to the sensor node Medusa~II which uses an Atmel's AVR ATmega103L microcontroller~\cite{ref112}. The typical architecture of a sensor is composed of four subsystems: the MCU subsystem which is capable of computation, communication subsystem (radio) which is responsible for transmitting/receiving messages, the sensing subsystem that collects data, and the power supply which powers the complete sensor node \cite{ref112}. Each of the first three subsystems can be turned on or off depending on the current status of the sensor. Energy consumption (expressed in milliWatt per second) for the different status of the sensor is summarized in Table~\ref{table1}. \begin{table}[ht] -\caption{The Energy Consumption Model} +\caption{Energy Consumption Model} % title of Table \centering % used for centering table @@ -379,7 +368,7 @@ COMPUTATION & on & on & on & 26.83 \\ % is used to refer this table in the text \end{table} -\indent For the sake of simplicity we ignore the energy needed to turn on the radio, to start up the sensor node, to move from one status to another, etc. Thus, when a sensor becomes active (i.e., it has already chosen its status), it can turn its radio off to save battery. The value of energy spent to send a 1-bit-content message is obtained by using the equation in ~\cite{ref112} to calculate the energy cost for transmitting messages and we propose the same value for receiving the packets. The energy needed to send or receive a 1-bit packet is equal to $0.2575~mW$. +\indent For the sake of simplicity we ignore the energy needed to turn on the radio, to start up the sensor node, to move from one status to another, etc. Thus, when a sensor becomes active (i.e., it has already received its status from leader), it can turn its radio off to save battery. The value of energy spent to send a 1-bit-content message is obtained by using the equation in ~\cite{ref112} to calculate the energy cost for transmitting messages and we propose the same value for receiving the packets. The energy needed to send or receive a 1-bit packet is equal to $0.2575~mW$. %We have used an energy consumption model, which is presented in chapter 1, section \ref{ch1:sec9:subsec2}. diff --git a/CHAPITRE_05.tex b/CHAPITRE_05.tex old mode 100644 new mode 100755 diff --git a/CHAPITRE_06.tex b/CHAPITRE_06.tex old mode 100644 new mode 100755 diff --git a/CONCLUSION.tex b/CONCLUSION.tex old mode 100644 new mode 100755 diff --git a/Figures/CHAPITRE_01.tex~ b/Figures/CHAPITRE_01.tex~ old mode 100644 new mode 100755 diff --git a/Figures/CHAPITRE_02.tex~ b/Figures/CHAPITRE_02.tex~ old mode 100644 new mode 100755 diff --git a/Figures/Introduction.tex~ b/Figures/Introduction.tex~ old mode 100644 new mode 100755 diff --git a/Figures/bib.tex~ b/Figures/bib.tex~ old mode 100644 new mode 100755 diff --git a/Figures/ch1/RDM-eps-converted-to.pdf b/Figures/ch1/RDM-eps-converted-to.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch1/RDM.eps b/Figures/ch1/RDM.eps old mode 100644 new mode 100755 diff --git a/Figures/ch1/RDM.pdf b/Figures/ch1/RDM.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch1/WNT-eps-converted-to.pdf b/Figures/ch1/WNT-eps-converted-to.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch1/WNT.eps b/Figures/ch1/WNT.eps old mode 100644 new mode 100755 diff --git a/Figures/ch1/WNT.pdf b/Figures/ch1/WNT.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch1/WSN-M.eps b/Figures/ch1/WSN-M.eps old mode 100644 new mode 100755 diff --git a/Figures/ch1/WSN-M.pdf b/Figures/ch1/WSN-M.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch1/WSN-S.pdf b/Figures/ch1/WSN-S.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch1/WSNAP-eps-converted-to.pdf b/Figures/ch1/WSNAP-eps-converted-to.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch1/WSNAP.eps b/Figures/ch1/WSNAP.eps old mode 100644 new mode 100755 diff --git a/Figures/ch1/WSNAP.pdf b/Figures/ch1/WSNAP.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch1/WSNT.jpg b/Figures/ch1/WSNT.jpg old mode 100644 new mode 100755 diff --git a/Figures/ch1/twsn2.pdf b/Figures/ch1/twsn2.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch1/typesWSN.pdf b/Figures/ch1/typesWSN.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch1/wsn-t-eps-converted-to.pdf b/Figures/ch1/wsn-t-eps-converted-to.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch1/wsn-t.eps b/Figures/ch1/wsn-t.eps old mode 100644 new mode 100755 diff --git a/Figures/ch1/wsn.jpg b/Figures/ch1/wsn.jpg old mode 100644 new mode 100755 diff --git a/Figures/ch2/DESK.eps b/Figures/ch2/DESK.eps old mode 100644 new mode 100755 diff --git a/Figures/ch2/DESK.jpeg b/Figures/ch2/DESK.jpeg old mode 100644 new mode 100755 diff --git a/Figures/ch2/GAF1.eps b/Figures/ch2/GAF1.eps old mode 100644 new mode 100755 diff --git a/Figures/ch2/GAF1.jpeg b/Figures/ch2/GAF1.jpeg old mode 100644 new mode 100755 diff --git a/Figures/ch2/GAF2.eps b/Figures/ch2/GAF2.eps old mode 100644 new mode 100755 diff --git a/Figures/ch2/GAF2.jpeg b/Figures/ch2/GAF2.jpeg old mode 100644 new mode 100755 diff --git a/Figures/ch2/P1.jpg b/Figures/ch2/P1.jpg old mode 100644 new mode 100755 diff --git a/Figures/ch2/P11.jpg b/Figures/ch2/P11.jpg old mode 100644 new mode 100755 diff --git a/Figures/ch2/P2.jpg b/Figures/ch2/P2.jpg old mode 100644 new mode 100755 diff --git a/Figures/ch2/P22.jpg b/Figures/ch2/P22.jpg old mode 100644 new mode 100755 diff --git a/Figures/ch4/FirstModel.pdf b/Figures/ch4/FirstModel.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/OneSensingRound.jpg b/Figures/ch4/OneSensingRound.jpg old mode 100644 new mode 100755 diff --git a/Figures/ch4/R1/ASR.pdf b/Figures/ch4/R1/ASR.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/R1/CR.pdf b/Figures/ch4/R1/CR.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/R1/EC50.pdf b/Figures/ch4/R1/EC50.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/R1/EC95.pdf b/Figures/ch4/R1/EC95.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/R1/LT50.pdf b/Figures/ch4/R1/LT50.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/R1/LT95.pdf b/Figures/ch4/R1/LT95.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/R1/SR.pdf b/Figures/ch4/R1/SR.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/R1/T.eps b/Figures/ch4/R1/T.eps old mode 100644 new mode 100755 diff --git a/Figures/ch4/R1/T.pdf b/Figures/ch4/R1/T.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/R1/T.ps b/Figures/ch4/R1/T.ps old mode 100644 new mode 100755 diff --git a/Figures/ch4/R2/ASR.pdf b/Figures/ch4/R2/ASR.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/R2/CR.pdf b/Figures/ch4/R2/CR.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/R2/EC50.pdf b/Figures/ch4/R2/EC50.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/R2/EC95.pdf b/Figures/ch4/R2/EC95.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/R2/LT50.pdf b/Figures/ch4/R2/LT50.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/R2/LT95.pdf b/Figures/ch4/R2/LT95.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/R2/SR.pdf b/Figures/ch4/R2/SR.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/R2/T.eps b/Figures/ch4/R2/T.eps old mode 100644 new mode 100755 diff --git a/Figures/ch4/R2/T.pdf b/Figures/ch4/R2/T.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/R2/T.ps b/Figures/ch4/R2/T.ps old mode 100644 new mode 100755 diff --git a/Figures/ch4/R3/ASR.pdf b/Figures/ch4/R3/ASR.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/R3/CR.pdf b/Figures/ch4/R3/CR.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/R3/EC50.pdf b/Figures/ch4/R3/EC50.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/R3/EC95.pdf b/Figures/ch4/R3/EC95.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/R3/LT50.pdf b/Figures/ch4/R3/LT50.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/R3/LT95.pdf b/Figures/ch4/R3/LT95.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/R3/SR.pdf b/Figures/ch4/R3/SR.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/fig21.pdf b/Figures/ch4/fig21.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/fig22.pdf b/Figures/ch4/fig22.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/fig23.pdf b/Figures/ch4/fig23.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/fig24.pdf b/Figures/ch4/fig24.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/fig25.pdf b/Figures/ch4/fig25.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/fig26.pdf b/Figures/ch4/fig26.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/fig27.pdf b/Figures/ch4/fig27.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch4/principles13.pdf b/Figures/ch4/principles13.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch5/GeneralModel.jpg b/Figures/ch5/GeneralModel.jpg old mode 100644 new mode 100755 diff --git a/Figures/ch5/Modelgeneral.pdf b/Figures/ch5/Modelgeneral.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch5/R1/ASR.pdf b/Figures/ch5/R1/ASR.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch5/R1/CR.pdf b/Figures/ch5/R1/CR.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch5/R1/EC50.pdf b/Figures/ch5/R1/EC50.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch5/R1/EC95.pdf b/Figures/ch5/R1/EC95.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch5/R1/LT50.pdf b/Figures/ch5/R1/LT50.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch5/R1/LT95.pdf b/Figures/ch5/R1/LT95.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch5/R1/SR.pdf b/Figures/ch5/R1/SR.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch5/R1/T.pdf b/Figures/ch5/R1/T.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch6/Model.pdf b/Figures/ch6/Model.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch6/R/ASR-eps-converted-to.pdf b/Figures/ch6/R/ASR-eps-converted-to.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch6/R/ASR.eps b/Figures/ch6/R/ASR.eps old mode 100644 new mode 100755 diff --git a/Figures/ch6/R/ASR.pdf b/Figures/ch6/R/ASR.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch6/R/CR-eps-converted-to.pdf b/Figures/ch6/R/CR-eps-converted-to.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch6/R/CR.eps b/Figures/ch6/R/CR.eps old mode 100644 new mode 100755 diff --git a/Figures/ch6/R/CR.pdf b/Figures/ch6/R/CR.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch6/R/EC50-eps-converted-to.pdf b/Figures/ch6/R/EC50-eps-converted-to.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch6/R/EC50.eps b/Figures/ch6/R/EC50.eps old mode 100644 new mode 100755 diff --git a/Figures/ch6/R/EC50.pdf b/Figures/ch6/R/EC50.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch6/R/EC95-eps-converted-to.pdf b/Figures/ch6/R/EC95-eps-converted-to.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch6/R/EC95.eps b/Figures/ch6/R/EC95.eps old mode 100644 new mode 100755 diff --git a/Figures/ch6/R/EC95.pdf b/Figures/ch6/R/EC95.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch6/R/LT50-eps-converted-to.pdf b/Figures/ch6/R/LT50-eps-converted-to.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch6/R/LT50.eps b/Figures/ch6/R/LT50.eps old mode 100644 new mode 100755 diff --git a/Figures/ch6/R/LT50.pdf b/Figures/ch6/R/LT50.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch6/R/LT95-eps-converted-to.pdf b/Figures/ch6/R/LT95-eps-converted-to.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch6/R/LT95.eps b/Figures/ch6/R/LT95.eps old mode 100644 new mode 100755 diff --git a/Figures/ch6/R/LT95.pdf b/Figures/ch6/R/LT95.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch6/R/LTa-eps-converted-to.pdf b/Figures/ch6/R/LTa-eps-converted-to.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch6/R/LTa.eps b/Figures/ch6/R/LTa.eps old mode 100644 new mode 100755 diff --git a/Figures/ch6/R/LTa.pdf b/Figures/ch6/R/LTa.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch6/ex4pcm.jpg b/Figures/ch6/ex4pcm.jpg old mode 100644 new mode 100755 diff --git a/Figures/ch6/ex5pcm.jpg b/Figures/ch6/ex5pcm.jpg old mode 100644 new mode 100755 diff --git a/Figures/ch6/expcm.pdf b/Figures/ch6/expcm.pdf old mode 100644 new mode 100755 diff --git a/Figures/ch6/expcm2.jpg b/Figures/ch6/expcm2.jpg old mode 100644 new mode 100755 diff --git a/Figures/ch6/pcm.jpg b/Figures/ch6/pcm.jpg old mode 100644 new mode 100755 diff --git a/Figures/ch6/twosensors.jpg b/Figures/ch6/twosensors.jpg old mode 100644 new mode 100755 diff --git a/Figures/citation.tex~ b/Figures/citation.tex~ old mode 100644 new mode 100755 diff --git a/Figures/entete.tex~ b/Figures/entete.tex~ old mode 100644 new mode 100755 diff --git a/Figures/these.tex~ b/Figures/these.tex~ old mode 100644 new mode 100755 diff --git a/INTRODUCTION.tex b/INTRODUCTION.tex old mode 100644 new mode 100755 diff --git a/Resume.tex b/Resume.tex old mode 100644 new mode 100755 diff --git a/Thesis.tex b/Thesis.tex old mode 100644 new mode 100755 diff --git a/Thesis.toc b/Thesis.toc old mode 100644 new mode 100755 index 682e2b5..2cdb04d --- a/Thesis.toc +++ b/Thesis.toc @@ -54,20 +54,20 @@ \contentsline {section}{\numberline {3.3}Optimization Solvers}{66}{section.3.3} \contentsline {section}{\numberline {3.4}Conclusion}{70}{section.3.4} \contentsline {part}{II\hspace {1em}Contributions}{71}{part.2} -\contentsline {chapter}{\numberline {4}Distributed Lifetime Coverage Optimization Protocol in Wireless Sensor Networks}{73}{chapter.4} +\contentsline {chapter}{\numberline {4}Distributed Lifetime Coverage Optimization Protocol}{73}{chapter.4} \contentsline {section}{\numberline {4.1}Introduction}{73}{section.4.1} \contentsline {section}{\numberline {4.2}Description of the DiLCO Protocol}{74}{section.4.2} \contentsline {subsection}{\numberline {4.2.1}Assumptions and Network Model}{74}{subsection.4.2.1} \contentsline {subsection}{\numberline {4.2.2}Primary Point Coverage Model}{75}{subsection.4.2.2} -\contentsline {subsection}{\numberline {4.2.3}Main Idea}{77}{subsection.4.2.3} +\contentsline {subsection}{\numberline {4.2.3}Main Idea}{75}{subsection.4.2.3} \contentsline {subsubsection}{\numberline {4.2.3.1}Information Exchange Phase}{77}{subsubsection.4.2.3.1} \contentsline {subsubsection}{\numberline {4.2.3.2}Leader Election Phase}{77}{subsubsection.4.2.3.2} \contentsline {subsubsection}{\numberline {4.2.3.3}Decision phase}{78}{subsubsection.4.2.3.3} \contentsline {subsubsection}{\numberline {4.2.3.4}Sensing phase}{78}{subsubsection.4.2.3.4} -\contentsline {section}{\numberline {4.3}Primary Points based Coverage Problem Formulation}{79}{section.4.3} +\contentsline {section}{\numberline {4.3}Coverage Problem Formulation}{79}{section.4.3} \contentsline {section}{\numberline {4.4}Simulation Results and Analysis}{80}{section.4.4} \contentsline {subsection}{\numberline {4.4.1}Simulation Framework}{80}{subsection.4.4.1} -\contentsline {subsection}{\numberline {4.4.2}Modeling Language and Optimization Solver}{81}{subsection.4.4.2} +\contentsline {subsection}{\numberline {4.4.2}Modeling Language and Optimization Solver}{80}{subsection.4.4.2} \contentsline {subsection}{\numberline {4.4.3}Energy Consumption Model}{81}{subsection.4.4.3} \contentsline {subsection}{\numberline {4.4.4}Performance Metrics}{82}{subsection.4.4.4} \contentsline {subsection}{\numberline {4.4.5}Performance Analysis for Different Number of Subregions}{83}{subsection.4.4.5} diff --git a/algorithme.sty b/algorithme.sty old mode 100644 new mode 100755 diff --git a/bib.bib b/bib.bib old mode 100644 new mode 100755 diff --git a/changemargin.sty b/changemargin.sty old mode 100644 new mode 100755 diff --git a/drop.sty b/drop.sty old mode 100644 new mode 100755 diff --git a/dropping.sty b/dropping.sty old mode 100644 new mode 100755 diff --git a/entete.tex b/entete.tex old mode 100644 new mode 100755 diff --git a/missfont.log b/missfont.log old mode 100644 new mode 100755 diff --git a/upmethodology-document.sty b/upmethodology-document.sty old mode 100644 new mode 100755 diff --git a/upmethodology-fmt.sty b/upmethodology-fmt.sty old mode 100644 new mode 100755 diff --git a/upmext-spimufcphdthesis.cfg b/upmext-spimufcphdthesis.cfg old mode 100644 new mode 100755 diff --git a/yfonts.sty b/yfonts.sty old mode 100644 new mode 100755 -- 2.39.5