From: ali Date: Thu, 14 May 2015 19:56:05 +0000 (+0200) Subject: Update by Ali X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/ThesisAli.git/commitdiff_plain/dc6cf8e426e52e11890b51d8cfbe8193285bea12 Update by Ali --- diff --git a/CHAPITRE_01.tex b/CHAPITRE_01.tex index 5ba6c61..ab5e45c 100644 --- a/CHAPITRE_01.tex +++ b/CHAPITRE_01.tex @@ -33,7 +33,7 @@ A WSN includes a large number of sensor nodes that can sense, process, and trans \section{Architecture} \label{ch1:sec:02} -A typical WSN architecture consists in a set of a huge number of wireless sensor nodes, which are capable of sensing the surrounded physical phenomenon such as fire in the forest (see~figure~\ref{wsn}), and then send the sensed data to a sink node. One or more sinks in WSN are responsible for collecting and processing the received sensed data, and making them available through the Internet to the end-user. +A typical WSN architecture consists in a set of a huge number of wireless sensor nodes, which are capable of sensing the surrounded physical phenomenon such as fire in the forest (see~Figure~\ref{wsn}), and then send the sensed data to a sink node. One or more sinks in WSN are responsible for collecting and processing the received sensed data, and making them available through the Internet to the end-user. The basic element is a wireless sensor node that is composed of four major units~\cite{ref17,ref18}: sensing, computation, communication, and power. %In addition, there are three optional units, which can be combined with the sensor node such as localization system, mobilizer, and power generator. @@ -57,7 +57,7 @@ Figure~\ref{twsn} shows the components of a typical wireless sensor node~\cite{r \end{enumerate} -Furthermore, additional components can be incorporated into wireless sensor node according to the application requirements, such as a localization system, a power generator, and a mobilizer~\cite{ref17,ref19}. These components are showed by the dashed boxes in figure~\ref{twsn}. +Furthermore, additional components can be incorporated into wireless sensor node according to the application requirements, such as a localization system, a power generator, and a mobilizer~\cite{ref17,ref19}. These components are showed by the dashed boxes in Figure~\ref{twsn}. \begin{enumerate} [(I)] @@ -116,7 +116,7 @@ This kind of WSN consists of low-cost wireless sensor nodes, which are embedded \section{Applications} \label{ch1:sec:04} %\indent The fast development in WSNs has been led to study their different characteristics extensively. However, the WSN is concentrated on various applications. -In this section, we describe different academic and commercial applications. A WSN can use various types of sensors such as \cite{ref17,ref19}: thermal, seismic, magnetic, visual, infrared, acoustic, and radar. These sensors are capable of observing a different physical conditions such as: temperature, humidity, pressure, speed, direction, movement, light, soil makeup, noise levels, presence or absence of certain kinds of objects, and mechanical stress levels on attached objects. Consequently, a wide range of WSN applications can be classified into five classes~\cite{ref22}, as shown in figure~\ref{WSNAP}. +In this section, we describe different academic and commercial applications. A WSN can use various types of sensors such as \cite{ref17,ref19}: thermal, seismic, magnetic, visual, infrared, acoustic, and radar. These sensors are capable of observing a different physical conditions such as: temperature, humidity, pressure, speed, direction, movement, light, soil makeup, noise levels, presence or absence of certain kinds of objects, and mechanical stress levels on attached objects. Consequently, a wide range of WSN applications can be classified into five classes~\cite{ref22}, as shown in Figure~\ref{WSNAP}. \begin{figure}[h!] \centering @@ -146,7 +146,7 @@ The wireless sensors can be used in agricultural services like irrigation, ferti WSNs can be incorporated into military command, control, communication, computing, intelligence, surveillance, reconnaissance, and targeting systems. It permits to estimate the unexpected events such as natural disasters and threats; military surveillance to the battlefield, enemy forces, battle damage, and targeting; and nuclear, biological, and chemical attack detection and reconnaissance~\cite{ref19}. -\indent According to figure~\ref{WSNAP}, the public safety and military applications can be categorized into active intervention and passive supervision~\cite{ref22}. In active intervention systems, the wireless sensors are wore by the agents and the WSN devoted to the security of the team activities. During the work of the team, the leader will observe the agent's situation and the environmental factors. The main applications include emergency rescue teams, miners, and soldiers. In passive supervision systems, wireless static sensors are scattered over a large field in order to monitor a civil area or nuclear site for a longer time. These applications include surveillance and target tracking; emergency navigation; fire detection in a building; structural health monitoring; and natural disaster prevention such as in the case of tsunamis, eruptions or flooding. +\indent According to Figure~\ref{WSNAP}, the public safety and military applications can be categorized into active intervention and passive supervision~\cite{ref22}. In active intervention systems, the wireless sensors are wore by the agents and the WSN devoted to the security of the team activities. During the work of the team, the leader will observe the agent's situation and the environmental factors. The main applications include emergency rescue teams, miners, and soldiers. In passive supervision systems, wireless static sensors are scattered over a large field in order to monitor a civil area or nuclear site for a longer time. These applications include surveillance and target tracking; emergency navigation; fire detection in a building; structural health monitoring; and natural disaster prevention such as in the case of tsunamis, eruptions or flooding. \item \textbf{Transportation Systems Applications:} @@ -203,7 +203,7 @@ The main task of a WSN after deploying the sensor nodes in the target environmen \section{Energy-Efficient Mechanisms of a working WSN} \label{ch1:sec:06} -\indent The strong constraint on limiting wireless sensor nodes energy usage requires energy efficient mechanisms to prolong network lifetime. The energy efficient mechanisms can be classified into five categories~\cite{ref22}, as summarized in figure~\ref{emwsn}. +\indent The strong constraint on limiting wireless sensor nodes energy usage requires energy efficient mechanisms to prolong network lifetime. The energy efficient mechanisms can be classified into five categories~\cite{ref22}, as summarized in Figure~\ref{emwsn}. \begin{figure}[h!] \centering \includegraphics[scale=0.4]{Figures/ch1/WSN-M.eps} @@ -258,7 +258,7 @@ The main task of a WSN after deploying the sensor nodes in the target environmen \subsubsection{Wake up Scheduling Schemes} -\indent This section describes the scheduling schemes from the point of view of schedule composition process and the framework of the wake-up schedule. In these scheduling schemes, the wake-up interval refers to the period of time at which the radio unit is turned on to send or receive packets. On the other hand, the sleep interval refers to a period of time at which the radio unit is turned off so as to save the energy of node. Some schemes divide the time into equal length durations of time and are called slotted schemes. Other schemes work with the time in a continuous way and are called unslotted schemes. The sleep and wake up intervals are defined for the unslotted schemes, whilst for the slotted schemes, these intervals are represented as multiple slots. A wake-up schedule represents a set of a wake-up and sleep intervals which are produced for one period. This schedule is replicated for each period and it can be changed by the wake-up scheduling scheme during the different periods of time. The final goal is to permit to exchange data among the wireless sensor nodes during the wake-up interval. As shown in figure~\ref{wsns}, the requirement for synchronization categorizes the wake-up scheduling into three categories~\cite{ref57}: +\indent This section describes the scheduling schemes from the point of view of schedule composition process and the framework of the wake-up schedule. In these scheduling schemes, the wake-up interval refers to the period of time at which the radio unit is turned on to send or receive packets. On the other hand, the sleep interval refers to a period of time at which the radio unit is turned off so as to save the energy of node. Some schemes divide the time into equal length durations of time and are called slotted schemes. Other schemes work with the time in a continuous way and are called unslotted schemes. The sleep and wake up intervals are defined for the unslotted schemes, whilst for the slotted schemes, these intervals are represented as multiple slots. A wake-up schedule represents a set of a wake-up and sleep intervals which are produced for one period. This schedule is replicated for each period and it can be changed by the wake-up scheduling scheme during the different periods of time. The final goal is to permit to exchange data among the wireless sensor nodes during the wake-up interval. As shown in Figure~\ref{wsns}, the requirement for synchronization categorizes the wake-up scheduling into three categories~\cite{ref57}: \begin{enumerate} [(I)] @@ -514,7 +514,7 @@ In order to model the energy consumption, four states for a sensor node are used \label{RDM} \end{figure} -\indent In this model, the radio consumes energy to execute the transmitter and the power amplifier. The receiver circuitry consumes energy to run the radio electronics, as described in figure~\ref{RDM}. The channel model can be either free space ($d^2$ power loss) or multipath fading ($d^4$ power loss), based on the distance between the transmitter and receiver. This power loss can be controlled by setting the power amplifier so that if the distance is less than a threshold ($d_0$), the free space ($\varepsilon_{fs}$) model is used (i.e., $\varepsilon_{amp}$ = $\varepsilon_{fs}$). Otherwise, the multipath ($\varepsilon_{mp}$) model is used (i.e., $\varepsilon_{amp}$ = $\varepsilon_{mp}$). Therefore, to transmit a K-bit packet across a distance d, the radio is +\indent In this model, the radio consumes energy to execute the transmitter and the power amplifier. The receiver circuitry consumes energy to run the radio electronics, as described in Figure~\ref{RDM}. The channel model can be either free space ($d^2$ power loss) or multipath fading ($d^4$ power loss), based on the distance between the transmitter and receiver. This power loss can be controlled by setting the power amplifier so that if the distance is less than a threshold ($d_0$), the free space ($\varepsilon_{fs}$) model is used (i.e., $\varepsilon_{amp}$ = $\varepsilon_{fs}$). Otherwise, the multipath ($\varepsilon_{mp}$) model is used (i.e., $\varepsilon_{amp}$ = $\varepsilon_{mp}$). Therefore, to transmit a K-bit packet across a distance d, the radio is \begin{equation} diff --git a/CHAPITRE_02.tex b/CHAPITRE_02.tex index fdd5ded..ea8bba5 100644 --- a/CHAPITRE_02.tex +++ b/CHAPITRE_02.tex @@ -164,7 +164,7 @@ GAF is developed by Xu et al. \cite{GAF}, it uses geographic location informatio \label{gaf1} \end{figure} -For two adjacent squares grids, (for example, A and B in figure~\ref{gaf1}) all sensor nodes inside A can communicate with sensor nodes inside B and vice versa. Therefore, all the sensor nodes are equivalent from the point of view the routing. The size of the fixed grid is based on the radio communication range $R_c$. It is supposed that the fixed grid is square with $r$ units on a side as shown in figure~\ref{gaf1}. The distance between the farthest sensor nodes in two adjacent squares, such as B and C in figure~\ref{gaf1}, should not be greater than the radio communication range $R_c$. For instance, the sensor node \textbf{2} of grid B can communicate with the sensor node \textbf{5} of square grid C. Thus, +For two adjacent squares grids, (for example, A and B in Figure~\ref{gaf1}) all sensor nodes inside A can communicate with sensor nodes inside B and vice versa. Therefore, all the sensor nodes are equivalent from the point of view the routing. The size of the fixed grid is based on the radio communication range $R_c$. It is supposed that the fixed grid is square with $r$ units on a side as shown in Figure~\ref{gaf1}. The distance between the farthest sensor nodes in two adjacent squares, such as B and C in Figure~\ref{gaf1}, should not be greater than the radio communication range $R_c$. For instance, the sensor node \textbf{2} of grid B can communicate with the sensor node \textbf{5} of square grid C. Thus, \begin{eqnarray} @@ -202,7 +202,7 @@ one sensor node (based on the remaining energy of sensor nodes inside the fixed DESK is a novel distributed heuristic to ensure that the energy consumption among the sensors is balanced and the lifetime maximized while the coverage requirement is satisfied~\cite{DESK}. This heuristic works in rounds, it requires only one-hop neighbor information, and each sensor decides its status (Active or Sleep) based on the perimeter coverage model from~\cite{ref133}. %DESK is based on the result from \cite{ref133}. -In DESK \cite{ref133}, the whole area is K-covered if and only if the perimeters of all sensors are K-covered. The coverage level of a sensor $s_i$ is determined by calculating the angle corresponding to the arc that each of its neighbors covers its perimeter. Figure~\ref{figp}~(a) illuminates such arcs whilst Figure~\ref{figp}~(b) shows the angles corresponding with those arcs in the range [0,2$ \pi $]. According to figure~\ref{figp}~(a) and (b), the coverage level of sensor $s_i$ can be calculated as follows. +In DESK \cite{ref133}, the whole area is K-covered if and only if the perimeters of all sensors are K-covered. The coverage level of a sensor $s_i$ is determined by calculating the angle corresponding to the arc that each of its neighbors covers its perimeter. Figure~\ref{figp}~(a) illuminates such arcs whilst Figure~\ref{figp}~(b) shows the angles corresponding with those arcs in the range [0,2$ \pi $]. According to Figure~\ref{figp}~(a) and (b), the coverage level of sensor $s_i$ can be calculated as follows. %via traversing the range from 0 to 2$ \pi $. For each sensor $s_j$ such that $d(s_i,s_j)$ $<$ $2R_s$, we calculate the angle of $s_i$'s arc, denoted by [$\alpha_{j,L}$, $\alpha_{j,R}$], which is perimeter covered by $s_j$, where $\alpha= arccos(d(s_i, s_j)/2R_s)$ and $d(s_i,s_j)$ is the Euclidean distance between $s_i$ and $s_j$. After that, we locate the points $\alpha_{j,L}$ and $\alpha_{j,R}$ of each neighboring sensor $s_j$ of $s_i$ on the line segment $[0, 2\pi]$. These points are sorted in ascending order into a list L. We traverse the line segment from 0 to $2\pi$ by visiting each element in the sorted list L from the left to the right and determine the perimeter coverage of $s_i$. Whenever an element $\alpha_{j,L}$ is traversed, the level of perimeter coverage should be increased by one. Whenever an element $\alpha_{j,R}$ is traversed, the level of perimeter coverage should be decreased by one. diff --git a/CHAPITRE_03.tex b/CHAPITRE_03.tex index 93b3b3b..54e9819 100644 --- a/CHAPITRE_03.tex +++ b/CHAPITRE_03.tex @@ -2,7 +2,7 @@ %%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% %% -%% CHAPTER 03 %% +%% CHAPTER 03 %% %% %% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%% diff --git a/CHAPITRE_04.tex b/CHAPITRE_04.tex index 0245387..52d2916 100644 --- a/CHAPITRE_04.tex +++ b/CHAPITRE_04.tex @@ -60,7 +60,7 @@ There are five possible status for each sensor node in the network: \indent Instead of working with the coverage area, we consider for each sensor a set of points called primary points. We also assume that the sensing disk defined by a sensor is covered if all the primary points of this sensor are covered. By knowing the position (point center: ($p_x,p_y$)) of a wireless sensor node and it's $R_s$, we calculate the primary points directly based on the proposed model. We use these primary points (that can be increased or decreased if necessary) as references to ensure that the monitored region of interest is covered by the selected set of sensors, instead of using all the points in the area. 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:\\ +node (see Figure~\ref{fig1}) as follows:\\ $(p_x,p_y)$ = point center of wireless sensor node\\ $X_1=(p_x,p_y)$ \\ @@ -469,7 +469,7 @@ In this experiment, Figure~\ref{Figures/ch4/R1/CR} shows the average coverage ra \end{figure} It can be seen that DiLCO protocol (with 4, 8, 16 and 32 subregions) gives nearly similar coverage ratios during the first thirty rounds. DiLCO-2 protocol gives near similar coverage ratio with other ones for first 10 rounds and then decreased until the died of the network in the round $18^{th}$. In case of only 2 subregions, the energy consumption is high and the network is rapidly disconnected. -As shown in the figure ~\ref{Figures/ch4/R1/CR}, as the number of subregions increases, the coverage preservation for the area of interest increases for a larger number of rounds. Coverage ratio decreases when the number of rounds increases due to dead nodes. Although some nodes are dead, thanks to DiLCO-8, DiLCO-16, and DiLCO-32 protocols, other nodes are preserved to ensure the coverage. Moreover, when we have a dense sensor network, it leads to maintain the coverage for a larger number of rounds. DiLCO-8, DiLCO-16, and DiLCO-32 protocols are slightly more efficient than other protocols, because they subdivide the area of interest into 8, 16 and 32~subregions; if one of the subregions becomes disconnected, the coverage may be still ensured in the remaining subregions. +As shown in the Figure ~\ref{Figures/ch4/R1/CR}, as the number of subregions increases, the coverage preservation for the area of interest increases for a larger number of rounds. Coverage ratio decreases when the number of rounds increases due to dead nodes. Although some nodes are dead, thanks to DiLCO-8, DiLCO-16, and DiLCO-32 protocols, other nodes are preserved to ensure the coverage. Moreover, when we have a dense sensor network, it leads to maintain the coverage for a larger number of rounds. DiLCO-8, DiLCO-16, and DiLCO-32 protocols are slightly more efficient than other protocols, because they subdivide the area of interest into 8, 16 and 32~subregions; if one of the subregions becomes disconnected, the coverage may be still ensured in the remaining subregions. \item {{\bf Active Sensors Ratio}} %\subsubsection{Active Sensors Ratio} @@ -482,7 +482,7 @@ Figure~\ref{Figures/ch4/R1/ASR} shows the average active nodes ratio for 150 dep \label{Figures/ch4/R1/ASR} \end{figure} -The results presented in figure~\ref{Figures/ch4/R1/ASR} show the increase of the number of subregions lead to the increase of the number of active nodes. The DiLCO-16 and DiLCO-32 protocols have a larger number of active nodes, but it preserve the coverage for a larger number of rounds. The advantage of the DiLCO-16 and DiLCO-32 protocols are that even if a network is disconnected in one subregion, the other ones usually continues the optimization process, and this extends the lifetime of the network. +The results presented in Figure~\ref{Figures/ch4/R1/ASR} show the increase of the number of subregions lead to the increase of the number of active nodes. The DiLCO-16 and DiLCO-32 protocols have a larger number of active nodes, but it preserve the coverage for a larger number of rounds. The advantage of the DiLCO-16 and DiLCO-32 protocols are that even if a network is disconnected in one subregion, the other ones usually continues the optimization process, and this extends the lifetime of the network. \item {{\bf The percentage of stopped simulation runs}} %\subsubsection{The percentage of stopped simulation runs} @@ -534,14 +534,14 @@ In this experiment, the execution time of the our distributed optimization appro \label{Figures/ch4/R1/T} \end{figure} -We can see from figure~\ref{Figures/ch4/R1/T}, that the DiLCO-32 has very low execution times in comparison with other DiLCO versions because it is distributed on larger number of small subregions. Conversely, DiLCO-2 requires to solve an optimization problem considering half the nodes in each subregion presents high execution times. +We can see from Figure~\ref{Figures/ch4/R1/T}, that the DiLCO-32 has very low execution times in comparison with other DiLCO versions because it is distributed on larger number of small subregions. Conversely, DiLCO-2 requires to solve an optimization problem considering half the nodes in each subregion presents high execution times. We think that in distributed fashion the solving of the optimization problem in a subregion can be tackled by sensor nodes. Overall, to be able to deal with very large networks, a distributed method is clearly required. \item {{\bf The Network Lifetime}} %\subsubsection{The Network Lifetime} -In figure~\ref{Figures/ch4/R1/LT95} and \ref{Figures/ch4/R1/LT50}, network lifetime, $Lifetime95$ and $Lifetime50$ respectively, are illustrated for different network sizes. +In Figure~\ref{Figures/ch4/R1/LT95} and \ref{Figures/ch4/R1/LT50}, network lifetime, $Lifetime95$ and $Lifetime50$ respectively, are illustrated for different network sizes. \begin{figure}[h!] \centering @@ -585,7 +585,7 @@ Figure~\ref{Figures/ch4/R2/CR} shows the average coverage ratio for 150 deployed \end{figure} It is shown that all models provide a very near coverage ratios during the network lifetime, with a very small superiority for the models with higher number of primary points. Moreover, when the number of rounds increases, coverage ratio produced by Model-13, Model-17, and Model-21 decreases in comparison with Model-5 and Model-9 due to a larger time computation for the decision process for larger number of primary points. -As shown in figure ~\ref{Figures/ch4/R2/CR}, Coverage ratio decreases when the number of rounds increases due to dead nodes. Model-9 is slightly more efficient than other models, because it is balanced between the number of rounds and the better coverage ratio in comparison with other Models. +As shown in Figure ~\ref{Figures/ch4/R2/CR}, Coverage ratio decreases when the number of rounds increases due to dead nodes. Model-9 is slightly more efficient than other models, because it is balanced between the number of rounds and the better coverage ratio in comparison with other Models. \item {{\bf Active Sensors Ratio}} %\subsubsection{Active Sensors Ratio} @@ -598,7 +598,7 @@ As shown in figure ~\ref{Figures/ch4/R2/CR}, Coverage ratio decreases when the n \label{Figures/ch4/R2/ASR} \end{figure} -The results presented in figure~\ref{Figures/ch4/R2/ASR} show the superiority of the proposed Model-5, in comparison with the other models. The model with fewer number of primary points uses fewer active nodes than the other models. According to the results presented in figure~\ref{Figures/ch4/R2/CR}, we observe that although the Model-5 continue to a larger number of rounds, but it has less coverage ratio compared with other models. The advantage of the Model-9 approach is to use fewer number of active nodes for each round compared with Model-13, Model-17, and Model-21. This led to continuing for a larger number of rounds with extending the network lifetime. Model-9 has a better coverage ratio compared to Model-5 and acceptable number of rounds. +The results presented in Figure~\ref{Figures/ch4/R2/ASR} show the superiority of the proposed Model-5, in comparison with the other models. The model with fewer number of primary points uses fewer active nodes than the other models. According to the results presented in Figure~\ref{Figures/ch4/R2/CR}, we observe that although the Model-5 continue to a larger number of rounds, but it has less coverage ratio compared with other models. The advantage of the Model-9 approach is to use fewer number of active nodes for each round compared with Model-13, Model-17, and Model-21. This led to continuing for a larger number of rounds with extending the network lifetime. Model-9 has a better coverage ratio compared to Model-5 and acceptable number of rounds. \item {{\bf The percentage of stopped simulation runs}} @@ -713,7 +713,7 @@ It is important to have as few active nodes as possible in each round, in order \label{Figures/ch4/R3/ASR} \end{figure} -The results presented in figure~\ref{Figures/ch4/R3/ASR} show the superiority of the proposed DiLCO-16 protocol and DiLCO-32 protocol, in comparison with the other approaches. DESK and GAF have 37.5 \% and 44.5 \% active nodes and DiLCO-16 protocol and DiLCO-32 protocol compete perfectly with only 17.4 \%, 24.8 \% and 26.8 \% active nodes for the first 14 rounds. Then as the number of rounds increases DiLCO-16 protocol and DiLCO-32 protocol have larger number of active nodes in comparison with DESK and GAF, especially from round $35^{th}$ because they give a better coverage ratio than other approaches. We see that DESK and GAF have less number of active nodes beginning at the rounds $35^{th}$ and $32^{th}$ because there are many nodes are died due to the high energy consumption by the redundant nodes during the sensing phase. \\ +The results presented in Figure~\ref{Figures/ch4/R3/ASR} show the superiority of the proposed DiLCO-16 protocol and DiLCO-32 protocol, in comparison with the other approaches. DESK and GAF have 37.5 \% and 44.5 \% active nodes and DiLCO-16 protocol and DiLCO-32 protocol compete perfectly with only 17.4 \%, 24.8 \% and 26.8 \% active nodes for the first 14 rounds. Then as the number of rounds increases DiLCO-16 protocol and DiLCO-32 protocol have larger number of active nodes in comparison with DESK and GAF, especially from round $35^{th}$ because they give a better coverage ratio than other approaches. We see that DESK and GAF have less number of active nodes beginning at the rounds $35^{th}$ and $32^{th}$ because there are many nodes are died due to the high energy consumption by the redundant nodes during the sensing phase. \\ \item {{\bf The percentage of stopped simulation runs}} diff --git a/CHAPITRE_05.tex b/CHAPITRE_05.tex index 66eadc1..2ee5579 100644 --- a/CHAPITRE_05.tex +++ b/CHAPITRE_05.tex @@ -474,7 +474,7 @@ called MuDiLCO (Multiround Distributed Lifetime Coverage Optimization) combines The activity scheduling in each subregion works in periods, where each period consists of four phases: (i) Information Exchange, (ii) Leader Election, (iii) Decision Phase to plan the activity of the sensors over $T$ rounds, (iv) Sensing Phase itself divided into T rounds. -Simulations results show the relevance of the proposed protocol in terms of lifetime, coverage ratio, active sensors ratio, energy consumption, execution time. Indeed, when dealing with large wireless sensor networks, a distributed approach, like the one we propose, allows to reduce the difficulty of a single global optimization problem by partitioning it into many smaller problems, one per subregion, that can be solved more easily. Nevertheless, results also show that it is not possible to plan the activity of sensors over too many rounds because the resulting optimization problem leads to too high-resolution times and thus to an excessive energy consumption. +Simulations results show the relevance of the proposed protocol in terms of lifetime, coverage ratio, active sensors ratio, energy consumption, execution time. Indeed, when dealing with large wireless sensor networks, a distributed approach, like the one we propose, allows to reduce the difficulty of a single global optimization problem by partitioning it into many smaller problems, one per subregion, that can be solved more easily. Nevertheless, results also show that it is not possible to plan the activity of sensors over too many rounds because the resulting optimization problem leads to too high-resolution times and thus to an excessive energy consumption. diff --git a/CHAPITRE_06.tex b/CHAPITRE_06.tex index 121ae35..f72a7ba 100644 --- a/CHAPITRE_06.tex +++ b/CHAPITRE_06.tex @@ -3,24 +3,21 @@ %% CHAPTER 06 %% %% %% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%% - -\chapter{Perimeter-based Coverage Optimization to Improve Lifetime in Wireless Sensor Networks} + \chapter{ Perimeter-based Coverage Optimization to Improve Lifetime in Wireless Sensor Networks} \label{ch6} \section{Introduction} \label{ch6:sec:01} -The continuous progress in Micro Electro-Mechanical Systems (MEMS) and -wireless communication hardware has given rise to the opportunity to use large -networks of tiny sensors, called Wireless Sensor Networks (WSN)~\cite{ref1,ref223}, to fulfill monitoring tasks. The features of a WSN made it suitable for a wide -range of application in areas such as business, environment, health, industry, -military, and so on~\cite{ref4}. These large number of applications have led to different design, management, and operational challenges in WSNs. The challenges become harder with considering into account the main limited capabilities of the sensor nodes such memory, processing, battery life, bandwidth, and short radio ranges. One important feature that distinguish the WSN from the other types of wireless networks is the provision of the sensing capability for the sensor nodes \cite{ref224}. +%The continuous progress in Micro Electro-Mechanical Systems (MEMS) and wireless communication hardware has given rise to the opportunity to use large networks of tiny sensors, called Wireless Sensor Networks (WSN)~\cite{ref1,ref223}, to fulfill monitoring tasks. The features of a WSN made it suitable for a wide range of application in areas such as business, environment, health, industry, military, and so on~\cite{ref4}. These large number of applications have led to different design, management, and operational challenges in WSNs. The challenges become harder with considering into account the main limited capabilities of the sensor nodes such memory, processing, battery life, bandwidth, and short radio ranges. One important feature that distinguish the WSN from the other types of wireless networks is the provision of the sensing capability for the sensor nodes \cite{ref224}. -The sensor node consumes some energy both in performing the sensing task and in transmitting the sensed data to the sink. Therefore, it is required to activate as less number as possible of sensor nodes that can monitor the whole area of interest so as to reduce the data volume and extend the network lifetime. The sensing coverage is the most important task of the WSNs since sensing unit of the sensor node is responsible for measuring physical, chemical, or biological phenomena in the sensing field. The main challenge of any sensing coverage problem is to discover the redundant sensor node and turn off those nodes in WSN \cite{ref225}. The redundant sensor node is a node whose sensing area is covered by its active neighbors. In previous works, several approaches are used to find out the redundant node such as Voronoi diagram method, sponsored sector, crossing coverage, and perimeter coverage. +%The sensor node consumes some energy both in performing the sensing task and in transmitting the sensed data to the sink. Therefore, it is required to activate as less number as possible of sensor nodes that can monitor the whole area of interest so as to reduce the data volume and extend the network lifetime. The sensing coverage is the most important task of the WSNs since sensing unit of the sensor node is responsible for measuring physical, chemical, or biological phenomena in the sensing field. The main challenge of any sensing coverage problem is to discover the redundant sensor node and turn off those nodes in WSN \cite{ref225}. The redundant sensor node is a node whose sensing area is covered by its active neighbors. In previous works, several approaches are used to find out the redundant node such as Voronoi diagram method, sponsored sector, crossing coverage, and perimeter coverage. -In this chapter, we propose such an approach called Perimeter-based Coverage Optimization -protocol (PeCO). The PeCO 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. An 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. +In this chapter, we propose an approach called Perimeter-based Coverage Optimization +protocol (PeCO). +%The PeCO 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. An energy-efficient activity scheduling mechanism based new optimization model is performed by each leader in the subregions. +The framework is similar to the one described in chapter 4, section \ref{ch4:sec:02:03}, but in this approach, the 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. The rest of the chapter is organized as follows. The next section is devoted to the PeCO protocol description and section~\ref{ch6:sec:03} focuses on the @@ -151,8 +148,9 @@ In the PeCO protocol, the scheduling of the sensor nodes' activities is formul \end{figure} - - +%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% This section deleted %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% +%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% +\iffalse \subsection{The Main Idea} \label{ch6:sec:02:02} @@ -173,8 +171,9 @@ are energy consuming, even for nodes that will not join the set cover to monitor \label{fig2} \end{figure} - - +\fi +%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% +%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \subsection{PeCO Protocol Algorithm} \label{ch6:sec:02:03} @@ -182,7 +181,7 @@ are energy consuming, even for nodes that will not join the set cover to monitor \noindent The pseudocode implementing the protocol on a node is given below. More precisely, Algorithm~\ref{alg:PeCO} gives a brief description of the -protocol applied by a sensor node $s_k$ where $k$ is the node index in the WSN. +protocol applied by a sensor node $s_j$ where $j$ is the node index in the WSN. \begin{algorithm}[h!] % \KwIn{all the parameters related to information exchange} @@ -194,7 +193,7 @@ protocol applied by a sensor node $s_k$ where $k$ is the node index in the WSN. \emph{$s_k.status$ = COMMUNICATION}\; \emph{Send $INFO()$ packet to other nodes in subregion}\; \emph{Wait $INFO()$ packet from other nodes in subregion}\; - \emph{Update K.CurrentSize}\; + \emph{Update A.CurrentSize}\; \emph{LeaderID = Leader election}\; \If{$ s_k.ID = LeaderID $}{ \emph{$s_k.status$ = COMPUTATION}\; @@ -204,14 +203,14 @@ protocol applied by a sensor node $s_k$ where $k$ is the node index in the WSN. % \emph{ Determine the segment points using perimeter coverage model}\; } - \If{$ (s_k.ID $ is the same Previous Leader) And (K.CurrentSize = K.PreviousSize)}{ + \If{$ (s_k.ID $ is the same Previous Leader) And (A.CurrentSize = A.PreviousSize)}{ \emph{ Use the same previous cover set for current sensing stage}\; } \Else{ \emph{Update $a^j_{ik}$; prepare data for IP~Algorithm}\; - \emph{$\left\{\left(X_{1},\dots,X_{l},\dots,X_{K}\right)\right\}$ = Execute Integer Program Algorithm($K$)}\; - \emph{K.PreviousSize = K.CurrentSize}\; + \emph{$\left\{\left(X_{1},\dots,X_{l},\dots,X_{A}\right)\right\}$ = Execute Integer Program Algorithm($A$)}\; + \emph{A.PreviousSize = A.CurrentSize}\; } \emph{$s_k.status$ = COMMUNICATION}\; @@ -229,7 +228,7 @@ protocol applied by a sensor node $s_k$ where $k$ is the node index in the WSN. \label{alg:PeCO} \end{algorithm} -In this algorithm, K.CurrentSize and K.PreviousSize respectively represent the +In this algorithm, A.CurrentSize and A.PreviousSize respectively represent the current number and the previous number of living nodes in the subnetwork of the subregion. Initially, the sensor node checks its remaining energy $RE_k$, which must be greater than a threshold $E_{th}$ in order to participate in the current @@ -255,8 +254,8 @@ section. First, we have the following sets: \begin{itemize} -\item $S$ represents the set of WSN sensor nodes; -\item $A \subseteq S $ is the subset of alive sensors; +\item $J$ represents the set of WSN sensor nodes; +\item $A \subseteq J $ is the subset of alive sensors; \item $I_j$ designates the set of coverage intervals (CI) obtained for sensor~$j$. \end{itemize} @@ -303,11 +302,11 @@ Our coverage optimization problem can then be mathematically expressed as follow \begin{equation} %\label{eq:ip2r} \left \{ \begin{array}{ll} -\min \sum_{j \in S} \sum_{i \in I_j} (\alpha^j_i ~ M^j_i + \beta^j_i ~ V^j_i )&\\ +\min \sum_{j \in J} \sum_{i \in I_j} (\alpha^j_i ~ M^j_i + \beta^j_i ~ V^j_i )&\\ \textrm{subject to :}&\\ -\sum_{k \in A} ( a^j_{ik} ~ X_{k}) + M^j_i \geq l \quad \forall i \in I_j, \forall j \in S\\ +\sum_{k \in A} ( a^j_{ik} ~ X_{k}) + M^j_i \geq l \quad \forall i \in I_j, \forall j \in J\\ %\label{c1} -\sum_{k \in A} ( a^j_{ik} ~ X_{k}) - V^j_i \leq l \quad \forall i \in I_j, \forall j \in S\\ +\sum_{k \in A} ( a^j_{ik} ~ X_{k}) - V^j_i \leq l \quad \forall i \in I_j, \forall j \in J\\ % \label{c2} % \Theta_{p}\in \mathbb{N}, &\forall p \in P\\ % U_{p} \in \{0,1\}, &\forall p \in P\\ @@ -376,15 +375,8 @@ To obtain experimental results which are relevant, simulations with five different node densities going from 100 to 300~nodes were performed considering each time 25~randomly generated networks. The nodes are deployed on a field of interest of $(50 \times 25)~m^2 $ in such a way that they cover the field with a -high coverage ratio. Each node has an initial energy level, in Joules, which is -randomly drawn in the interval $[500-700]$. If its energy provision reaches a -value below the threshold $E_{th}=36$~Joules, the minimum energy needed for a -node to stay active during one period, it will no more participate in the -coverage task. This value corresponds to the energy needed by the sensing phase, -obtained by multiplying the energy consumed in active state (9.72 mW) with the -time in seconds for one period (3600 seconds), and adding the energy for the -pre-sensing phases. According to the interval of initial energy, a sensor may -be active during at most 20 periods. +high coverage ratio. +%Each node has an initial energy level, in Joules, which is randomly drawn in the interval $[500-700]$. If its energy provision reaches a value below the threshold $E_{th}=36$~Joules, the minimum energy needed for a node to stay active during one period, it will no more participate in the coverage task. This value corresponds to the energy needed by the sensing phase, obtained by multiplying the energy consumed in active state (9.72 mW) with the time in seconds for one period (3600 seconds), and adding the energy for the pre-sensing phases. According to the interval of initial energy, a sensor may be active during at most 20 periods. The values of $\alpha^j_i$ and $\beta^j_i$ have been chosen to ensure a good @@ -392,10 +384,9 @@ network coverage and a longer WSN lifetime. We have given a higher priority to the undercoverage (by setting the $\alpha^j_i$ with a larger value than $\beta^j_i$) so as to prevent the non-coverage for the interval~$i$ of the sensor~$j$. On the other hand, we have assigned to -$\beta^j_i$ a value which is slightly lower so as to minimize the number of active sensor nodes which contribute -in covering the interval. +$\beta^j_i$ a value which is slightly lower so as to minimize the number of active sensor nodes which contribute in covering the interval. -We applied the performance metrics, which are described in chapter 4, section \ref{ch4:sec:04:04} in order to evaluate the efficiency of our approach. We used the modeling language and the optimization solver which are mentioned in chapter 4, section \ref{ch4:sec:04:02}. In addition, we employed an energy consumption model, which is presented in chapter 4, section \ref{ch4:sec:04:03}. +With the performance metrics, described in chapter 4, section \ref{ch4:sec:04:04}, we evaluate the efficiency of our approach. We use the modeling language and the optimization solver which are mentioned in chapter 4, section \ref{ch4:sec:04:02}. In addition, we use the same energy consumption model, presented in chapter 4, section \ref{ch4:sec:04:03}. \subsection{Simulation Results} diff --git a/Thesis.toc b/Thesis.toc index 918abd5..5e7efc9 100644 --- a/Thesis.toc +++ b/Thesis.toc @@ -84,21 +84,20 @@ \contentsline {subsection}{\numberline {5.4.2}Metrics}{107}{subsection.5.4.2} \contentsline {subsection}{\numberline {5.4.3}Results Analysis and Comparison }{108}{subsection.5.4.3} \contentsline {section}{\numberline {5.5}Conclusion}{113}{section.5.5} -\contentsline {chapter}{\numberline {6}Perimeter-based Coverage Optimization to Improve Lifetime in Wireless Sensor Networks}{115}{chapter.6} +\contentsline {chapter}{\numberline {6} Perimeter-based Coverage Optimization to Improve Lifetime in Wireless Sensor Networks}{115}{chapter.6} \contentsline {section}{\numberline {6.1}Introduction}{115}{section.6.1} -\contentsline {section}{\numberline {6.2}The PeCO Protocol Description}{116}{section.6.2} -\contentsline {subsection}{\numberline {6.2.1}Assumptions and Models}{116}{subsection.6.2.1} -\contentsline {subsection}{\numberline {6.2.2}The Main Idea}{119}{subsection.6.2.2} -\contentsline {subsection}{\numberline {6.2.3}PeCO Protocol Algorithm}{119}{subsection.6.2.3} +\contentsline {section}{\numberline {6.2}The PeCO Protocol Description}{115}{section.6.2} +\contentsline {subsection}{\numberline {6.2.1}Assumptions and Models}{115}{subsection.6.2.1} +\contentsline {subsection}{\numberline {6.2.2}PeCO Protocol Algorithm}{118}{subsection.6.2.2} \contentsline {section}{\numberline {6.3}Perimeter-based Coverage Problem Formulation}{120}{section.6.3} -\contentsline {section}{\numberline {6.4}Performance Evaluation and Analysis}{122}{section.6.4} -\contentsline {subsection}{\numberline {6.4.1}Simulation Settings}{122}{subsection.6.4.1} -\contentsline {subsection}{\numberline {6.4.2}Simulation Results}{123}{subsection.6.4.2} -\contentsline {subsubsection}{\numberline {6.4.2.1}Coverage Ratio}{124}{subsubsection.6.4.2.1} -\contentsline {subsubsection}{\numberline {6.4.2.2}Active Sensors Ratio}{124}{subsubsection.6.4.2.2} -\contentsline {subsubsection}{\numberline {6.4.2.3}The Energy Consumption}{125}{subsubsection.6.4.2.3} +\contentsline {section}{\numberline {6.4}Performance Evaluation and Analysis}{121}{section.6.4} +\contentsline {subsection}{\numberline {6.4.1}Simulation Settings}{121}{subsection.6.4.1} +\contentsline {subsection}{\numberline {6.4.2}Simulation Results}{122}{subsection.6.4.2} +\contentsline {subsubsection}{\numberline {6.4.2.1}Coverage Ratio}{122}{subsubsection.6.4.2.1} +\contentsline {subsubsection}{\numberline {6.4.2.2}Active Sensors Ratio}{122}{subsubsection.6.4.2.2} +\contentsline {subsubsection}{\numberline {6.4.2.3}The Energy Consumption}{122}{subsubsection.6.4.2.3} \contentsline {subsubsection}{\numberline {6.4.2.4}The Network Lifetime}{125}{subsubsection.6.4.2.4} -\contentsline {section}{\numberline {6.5}Conclusion}{128}{section.6.5} +\contentsline {section}{\numberline {6.5}Conclusion}{125}{section.6.5} \contentsline {part}{III\hspace {1em}Conclusion and Perspectives}{129}{part.3} \contentsline {chapter}{\numberline {7}Conclusion and Perspectives}{131}{chapter.7} \contentsline {section}{\numberline {7.1}Conclusion}{131}{section.7.1}