update by Ali

[ThesisAli.git] / INTRODUCTION.tex

diff --git a/INTRODUCTION.tex b/INTRODUCTION.tex
index fc8ec679f9c91cb988497423722bff68b610ceba..847f0975cc5c0cbada929312abfefe6a85491d05 100644 (file)
--- a/INTRODUCTION.tex
+++ b/INTRODUCTION.tex
@@ -3,53 +3,58 @@
 \addcontentsline{toc}{chapter}{Introduction }
 
 %%-------------------------------------------------------------------------------------------------------%%
 \addcontentsline{toc}{chapter}{Introduction }
 
 %%-------------------------------------------------------------------------------------------------------%%

- \section{General Introduction}
-The enormous development in wireless networks and the emergence of fourth-generation technology led to the provision of various services to customers around the world that make of the Internet a more widely used everywhere. This kind of wireless networks may not be appropriate to be used in some sensitive areas that need to deploy a large number of wireless devices, which are capable of decide and communicate with each other in a distributed way  so as to collect the sensed measurements from the physical dangerous environment directly such as volcanoes, nuclear reactors, forest fires, or military battles. So, another type of wireless networks has been emerged to cope with these challenges which is called wireless sensor network (WSN). 

 
 

-It is a special case of the ad hoc wireless networks and it consists of a large number of wireless devices are called sensors, which are able to perform the communication, sensing, processing and storage with a limited capabilities. A WSN can be used by the human to monitor the physical phenomena remotely and without outside intervention. Inside a WSN, the wireless sensor nodes are self-contained units equipped  with a radio transceiver, a microcontroller, a small memory, and a power source, usually a battery. These sensor nodes are cooperating together autonomously to perform the assigned tasks without the intervention or control from outside. The distributed self-organization and self-configuration capabilities of wireless sensor nodes make the distributed WSNs to enable myriad applications for monitoring, sensing and controlling the physical world.
+\section*{1. General Introduction}  
+\addcontentsline{toc}{section}{1. General Introduction }
+The enormous development of wireless networks, with the emergence of fourth and fifth-generation technology, are leading to the provision of various services to customers around the world that make the Internet more widely used. This kind of wireless networks may not be appropriate to be used in some sensitive areas that need to deploy a large number of wireless devices, which are able to sense, process, and communicate with each other in a distributed way, so as to collect the sensed measurements directly from physical dangerous environments such as volcanoes, nuclear reactors, forest fires, or military battle fields. Therefore, a specific type of wireless networks, called Wireless Sensor Network (WSN), has emerged to cope with these challenges. 

 
 

-The fast and continuous progress in Micro Electro-Mechanical Systems (MEMS), wireless communication hardware, digital electronics, and  system-on-chip has given rise to the opportunity to use large networks of tiny sensors are becoming cheaper and more and more commercially available. There are several limitations on the sensor nodes such as power source, processing capability, bandwidth, uncertainty of sensed data, and the vulnerability of sensor nodes to physical world. These limitations have been tackled by many researchers during last years and many solutions have been proposed to handle these constraints on the sensors. Sensor nodes are battery-powered with no means of recharging or replacing, usually due to environmental (hostile or unpractical environments) or cost reasons. Since the batteries are the most important limited resource inside the sensor nodes, 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. Many energy-efficient mechanisms have been proposed so as to minimize the energy consumption during operating the WSN its monitoring task and to extend the network lifetime. Specifically, this dissertation focuses on the area coverage problem of in WSNs.
+WSN is an ad hoc wireless networks, which consists of a large number of wireless cheap devices called sensors. A sensor node can perform  communication, sensing, processing, and storage tasks with a limited capability. It can be used by human to monitor physical phenomena remotely and without any outside intervention. Wireless sensor nodes are self-contained units equipped with a radio transceiver, a microcontroller, a small memory, and a power source, usually a battery. These sensor nodes are cooperating together autonomously to perform the assigned tasks. The distributed self-organization and self-configuration capabilities of wireless sensor nodes enable myriad applications for monitoring, sensing and controlling the physical world.

 
 

-The major goal of the area coverage problem is to ensure a maximum area coverage ratio for the entire sensing field of the WSN and for a longer time as possible. The area coverage problem is closely related to the performance of systems in many application, such as, monitoring the battlefield, target detection and tracking, personal protection, animal habit monitoring, and  homeland security.
+The sensor nodes have several limitations, such as the power source, processing capability, bandwidth, uncertainty of sensed data, and the vulnerability of sensor nodes to the physical world. These limitations have been tackled by many researchers during the last years, and consequently, many solutions are taking these constraints into account have been proposed. Sensor nodes are battery-powered without means of recharging or replacing, usually due to environmental (hostile or unpractical environments) or cost reasons. %Since batteries are the most important limited resource inside sensor nodes, it is desirable that 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.

 
 

-\section{Motivation of the Dissertation}
+Since the network lifetime depends on sensor lifetime, the power depletion represents the most significant part when designing of the WSN protocols due to the limited capacity of the sensor batteries.  The major goal is to extend the network lifetime, taking into consideration the energy source limitations. Several energy-efficient approaches have been suggested to minimize the energy consumption and extend the network lifetime during monitoring a certain area by a WSN. %For example, one of the ways is to turn off the redundant sensors and put them in sleep mode to maintain the energy, whilst the active sensors perform the sensing coverage task during their life. 
+Specifically, the energy-efficient protocols proposed in this dissertation focus on the area coverage problem in WSNs. The major goal of the area coverage problem is to ensure monitoring the entire sensing field for as long as possible. The area coverage problem is closely related to the performance of WSNs in many applications, such as monitoring a battlefield, target detection, tracking, personal protection, animal habit monitoring, and homeland security.
+
+
+\section*{2. Motivation of the Dissertation}
+\addcontentsline{toc}{section}{2. Motivation of the Dissertation }

 One of the fundamental challenges in Wireless Sensor Networks (WSNs) is the coverage preservation and the extension of the network lifetime continuously and effectively when monitoring a certain area (or region) of interest. Since sensor nodes have limited battery life; since it is impossible to replace batteries, especially in remote and hostile
 One of the fundamental challenges in Wireless Sensor Networks (WSNs) is the coverage preservation and the extension of the network lifetime continuously and effectively when monitoring a certain area (or region) of interest. Since sensor nodes have limited battery life; since it is impossible to replace batteries, especially in remote and hostile

-environments, it is desirable that a WSN should be deployed with high density because spatial redundancy can then be exploited to increase the lifetime of the network. In such a high density network, if all sensor nodes were to be activated at the same time, the lifetime would be reduced. To extend the lifetime of the network, the main idea is to take advantage of the overlapping sensing regions of some sensor nodes to save energy by turning off some of them during the sensing phase. Obviously, the deactivation of nodes is only relevant if the coverage of the monitored area is not affected.
+environments, it is desirable that a WSN should be deployed with high density because spatial redundancy can then be exploited to increase the lifetime of the network. In such a high-density network, if all sensor nodes were to be activated at the same time, the lifetime would be reduced. To extend the lifetime of the network, the main idea is to take advantage of the overlapping sensing regions of some sensor nodes to save energy by turning off some of them during the sensing phase. Obviously, the deactivation of nodes is only relevant if the coverage of the monitored area is not affected.

 
 

-Although there are many work in this area, there is still need for a protocols which can schedule sensor nodes in an efficient way with minimum number of sensors and a less communication overhead so as to maintain the coverage and extend the network lifetime as long as possible.  The main question is how to reduce the redundancy while maintaining a good coverage with minimum energy consumption?
+Although many works on energy-efficient coverage have been introduced, there is still need for a protocol which can schedule sensor nodes in an efficient way with: a minimum number of active sensors and less communication overhead so as to maintain the coverage and extend the network lifetime as long as possible. The main question is how to reduce the redundancy while maintaining a good coverage with minimum energy consumption?

  
 
  
 

-\section{The Objective of this Dissertation}
-The primary objective of this dissertation is to develop energy-efficient distributed optimization protocols in wireless sensor networks that optimizes both coverage and network lifetime so as to maintain the coverage and prolongs the lifetime of the WSN. The developed protocols should schedule node’ activities (wake up and sleep stages) with the objective of maintaining a good coverage ratio while maximizing the network lifetime.
+\section*{3. The Objective of this Dissertation}
+\addcontentsline{toc}{section}{3. The Objective of this Dissertation}
+The primary objective of this dissertation is to develop energy-efficient distributed optimization protocols in wireless sensor networks that optimize both coverage and network lifetime. The developed protocols should schedule node activities (wake up and sleep stages) with the objective of maintaining a good coverage ratio while maximizing the network lifetime.

 
 The proposed protocols should be able to combine two efficient techniques: network leader
 
 The proposed protocols should be able to combine two efficient techniques: network leader

-election and sensor activity scheduling based optimization, where the challenges include how to select the most efficient leader in each subregion and the best representative active nodes, which take the mission of monitoring during the current round.
-
-
- The developed optimization protocols should be able to perform a distributed optimization process on the subregions where the sensor nodes  in each subregion collaborate to select the leader by which the optimization algorithm is executed. In addition, the proposed protocols should be able to achieve effective trade-off between
-coverage quality and the consumed energy in each subregion of the sensing field in order to achieve extended network lifetime whilst maintaining adequate coverage ratio. 
+election and sensor activity scheduling based optimization, where the challenges include how to select the most efficient leader and the best representative active nodes which take the mission of monitoring during the current period.

 
 

-\section{The main Contributions of this Dissertation}
+ In addition, the developed optimization protocols should be able to perform a distributed optimization process, by subdividing into subregions the region of interest where the sensor nodes in each subregion collaborate to select the leader which execute the optimization algorithm. 

  
  

-The coverage problem in WSNs is becoming more and more important for many applications ranging from military applications such as battlefield surveillance to the civilian applications such as health-care surveillance and habitant monitoring. The main contributions in this dissertation concentrate on design a distributed optimization protocols so as to extend the lifetime of the WSNs. The main contributions can be summarized as follow:
+
+\section*{4. Main Contributions of this Dissertation}
+ \addcontentsline{toc}{section}{4. Main Contributions of this Dissertation}
+%The coverage problem in WSNs is becoming more and more important for many applications ranging from military applications such as battlefield surveillance to the civilian applications such as health-care surveillance and habitant monitoring. 
+The main contributions in this dissertation concentrate on designing distributed optimization protocols to extend the lifetime of WSNs.  We summarize the main contributions of our research as follows:

  
 \begin{enumerate} [i)]
  
 \begin{enumerate} [i)]

- \item In Chapter 3, 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. DILCO protocol presented in chapter 3 is an extension of our approach introduced in \cite{ref159}. In \cite{ref159}, the protocol is deployed over only two subregions. In DILCO protocol, 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.
+\item We devise a framework to schedule nodes to be activated alternatively such that the network lifetime is prolonged  while ensuring that a certain level of coverage is preserved. A key idea in our framework is  to exploit a spatial-temporal subdivision. On the one hand, the area of interest is divided into several smaller subregions.On the other hand, the timeline is divided into periods of equal length. In each subregion, the sensor nodes will cooperatively choose a  leader which will schedule  nodes' activities, and this grouping of sensors is similar to typical cluster architecture.
+

 
 

-\item In Chapter 4, we extend our work that explained in chapter 3 and present a generalized framework that can be applied to provide the cover sets of all rounds in each period. The MuDiLCO protocol (for Multiround Distributed Lifetime Coverage Optimization protocol) presented in chapter 4 is an extension of the approach introduced in chapter 3. In DiLCO protocol, the activity scheduling based optimization is planned for each subregion periodically only for one round. Whilst, we study the possibility of dividing the sensing phase into multiple rounds and we also add an improved model of energy consumption to assess the efficiency of our approach. In fact, we make a multiround optimization, while it was a single round optimization in our previous work.
+\item We design, called the Distributed Lifetime Coverage Optimization (DILCO) protocol, which maintains the coverage and improves the lifetime in WSNs. DILCO protocol is presented in chapter 4. It is an extension of our approach introduced in \cite{ref159}. In \cite{ref159}, the protocol is deployed over only two subregions. In DILCO protocol, 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. 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 broadcasted by the leader to every node of its subregion.

 
 

-\item In Chapter 5, we devise a framework to schedule nodes to be activated alternatively such
-  that the network lifetime is prolonged  while ensuring that a certain level of
-  coverage is preserved.  A  key idea in our framework is  to exploit spatial an
-  temporal subdivision.   On the one hand  the area of interest  if divided into
-  several smaller subregions and on the other hand the time line is divided into
-  periods of equal length. In each subregion the sensor nodes will cooperatively
-  choose a  leader which will schedule  nodes' activities, and this  grouping of
-  sensors is similar to typical cluster architecture. We  propose a new mathematical  optimization model.  Instead of  trying to   cover a set of specified points/targets as  in most of the methods proposed in   the literature, we formulate an integer program based on perimeter coverage of   each sensor. The  model involves integer variables to  capture the deviations between  the actual  level of  coverage and  the required  level. So that an
-  optimal scheduling  will be  obtained by  minimizing a  weighted sum  of these deviations.
+\item %We extend our work that explained in chapter 4 and present a generalized framework that can be applied to provide the cover sets of all rounds in each period. 
+The MuDiLCO protocol for Multiround Distributed Lifetime Coverage Optimization protocol, presented in chapter 5, is an extension of the approach introduced in chapter 4. In DiLCO protocol, the activity scheduling based optimization is planned for each subregion periodically only for one sensing round. Whilst, we study the possibility of dividing the sensing phase into multiple rounds. In fact, we make a multiround optimization, while it was a single round optimization in our previous contribution.

 
 

-\item We  conducted extensive simulation  experiments, using the  discrete event simulator OMNeT++, to demonstrate the  efficiency of our protocol. We compared our proposed distributed optimization protocols to two approaches found in the literature: DESK~\cite{DESK} and  GAF~\cite{GAF}, simulation results based on multiple criteria (energy consumption, coverage ratio, network lifetime and so on) show that the proposed protocols can prolong efficiently the network lifetime and improve the coverage performance.
+%\item We devise a framework to schedule nodes to be activated alternatively such that the network lifetime is prolonged  while ensuring that a certain level of   coverage is preserved. A key idea in our framework is  to exploit the spatial-temporal subdivision. On the one hand, the area of interest is divided into several smaller subregions and, on the other hand, the timeline is divided into periods of equal length. In each subregion, the sensor nodes will cooperatively choose a  leader which will schedule  nodes' activities, and this grouping of sensors is similar to typical cluster architecture. 

 
 

+\item We have designed a third protocol, called Perimeter-based Coverage Optimization (PeCO).
+%which schedules nodes’ activities (wake up and sleep stages) with the objective of maintaining a good coverage ratio while maximizing the network lifetime. This protocol is applied in a distributed way in regular subregions obtained after partitioning the area of interest in a preliminary step. It works in periods and is based on the resolution of an integer program to select the subset of sensors operating in active status for each period.  
+We have proposed a new mathematical optimization model. Instead of  trying to cover a set of specified points/targets as in my previous protocols and most of the methods proposed in the literature, we formulate an integer program based on perimeter coverage of each sensor. The model involves integer variables to capture the deviations between the actual level of coverage and the required  level. The idea is that an optimal scheduling  will be  obtained by  minimizing a weighted sum of these deviations. This contribution is demonstrated in chapter 6.
+
+\item We add an improved model of energy consumption to assess the efficiency of our protocols. We conducted extensive simulation experiments using the discrete event simulator OMNeT++, to demonstrate the  efficiency of our protocols. We compared our proposed distributed optimization protocols to two approaches found in the literature: DESK~\cite{DESK} and GAF~\cite{GAF}. Simulation results based on multiple criteria (energy consumption, coverage ratio, network lifetime and so on) show that the proposed protocols can prolong efficiently the network lifetime and improve the coverage performance.

 
 
 \end{enumerate}
 
 
 \end{enumerate}


@@ -59,10 +64,9 @@ The coverage problem in WSNs is becoming more and more important for many applic
 %In this dissertation, analytical, as well as computational, methods are used.
 
 
 %In this dissertation, analytical, as well as computational, methods are used.
 
 

-

 % \section{ Refereed Journal and Conference Publications}
  
 % \section{ Refereed Journal and Conference Publications}
  

-\section{Dissertation Outline}
- The Dissertation is organized as follows: the next chapter presents a scientific background about wireless sensor networks .Chapter 2 states a review of the related literatures to the coverage problem in WSN, the prior works, and the current works. Chapter 3 describes the the proposed DiLCO protocol. Chapter 4 presents the MuDiLCO protocol. The LiCO protocol is illustrated in Chapter 5. Finally, we conclude our work in Chapter 6.
+\section*{5. Dissertation Outline}
+\addcontentsline{toc}{section}{5. Dissertation Outline}
+The dissertation is organized as follows: the next chapter presents a scientific background about wireless sensor networks. Chapter 2 states a review of the related literatures to the coverage problem in WSNs, prior works and current works. Evaluation tools and optimization solvers are investigated in chapter 3. Chapter 4 describes the proposed DiLCO protocol, while chapter 5 and 6 respectively present the MuDiLCO and PeCO protocols. Finally, we conclude our work in chapter 7.

  
  

- 
\ No newline at end of file