\item \textbf{Coverage:} One of the fundamental challenges in WSNs is the coverage preservation and the extension of the network lifetime continuously and effectively when monitoring a certain area (or region) of interest. The major objective is to choose the minimum number of sensor nodes in order to monitor the target sensing field without affecting on the application requirements in executing its tasks as long time as possible.
-\item \textbf{Routing:} Represents one of the important problems in WSNs that needs to be solved efficiently. The limited resources of WSNs and the impacts of wireless communication led to a big challenge in ensuring energy-efficient routing. However, it is not enough to use the shortest path to route the packets among the sensor nodes toward the sink. It is necessary to design an energy-efficient routing protocol that considers the remaining energy of sensor node during taking the decision to route the packet to the next hop toward the destination. This participates in energy conservation and balancing among the sensor node in WSNs.
+\item \textbf{Routing:} Represents one of the important problems in WSNs that needs to be solved efficiently. The limited resources of WSNs and the impacts of wireless communication lead to a big challenge in ensuring energy-efficient routing. However, it is not enough to use the shortest path to route the packets among the sensor nodes toward the sink. It is necessary to design an energy-efficient routing protocol that considers the remaining energy of sensor node during taking the decision to route the packet to the next hop toward the destination. This participates in energy conservation and balancing among the sensor node in WSNs.
\item \textbf{Autonomous and Distributed Management:}
-Since the nature of many WSN applications need to be deployed in a remote or hostile environment, it is important that the wireless sensor nodes work in autonomous and distributed way to communicate and cooperate with other sensor nodes without human intervention because the maintenance or the repair may be difficult. The distributed management consumes less energy because it is based on only local information from the neighboring sensor nodes; on the other hand, it does not give the optimal solution, so the main challenge is how to apply the a distributed management in WSNs and in the same time ensuring an optimal or near optimal solution.
+Since the nature of many WSN applications need to be deployed in a remote or hostile environment, it is important that the wireless sensor nodes work in autonomous and distributed way to communicate and cooperate with other sensor nodes without human intervention because the maintenance or the repair may be difficult. The distributed management consumes less energy because it is based on only local information from the neighboring sensor nodes, moreover, it does not give the optimal solution. So the main challenge is how to apply the a distributed management in WSNs and in the same time ensuring an optimal or near optimal solution.
\item \textbf{Scalability:} Many physical phenomenons require to be deployed densely with a large number of sensor nodes for different reasons such as: the large sensed area, reliability requirement, or network lifetime prolongation. It is necessary that the proposed protocols in WSNs are scalable for these large number of sensor
nodes in order to achieve their tasks efficiently.
\begin{enumerate}[(a)]
\item Grouping the wireless sensor nodes into clusters is led to decrease the communication range within the cluster and therefore minimize the energy needed to communication among the nodes inside the cluster.
\item Minimizing the energy hungry operations such as collaboration and aggregation to the cluster head.
-\item Limiting the number of communications (transmitting and receiving) due to the fusion operation carried out by the cluster head.
+%\item Limiting the number of communications (transmitting and receiving) due to the fusion operation carried out by the cluster head.
\item The continuous changing of cluster head according to residual energy is led to balance the energy consumption among wireless sensor nodes inside the cluster.
\item Some nodes can be turned-off within the same cluster whilst the cluster head manage the responsibilities.
\end{enumerate}
\subsection{Battery Repletion:}
-\indent In the last years, extensive researches have been focused on energy harvesting and wireless charging techniques. These solutions represent alternate energy sources to recharge wireless sensor batteries without human intervention and instead of depending on the limited power supplied by a typical batteries~\cite{ref91,ref59}.
+\indent In the last years, extensive researches have been focused on energy harvesting and wireless charging techniques. These solutions represent alternate energy sources to recharge wireless sensor batteries without human intervention~\cite{ref91,ref59}.
\subsubsection{Energy Harvesting:} In energy harvesting, several sources of environmental energy have been developed so as to enable the wireless sensors to acquire energy from the surrounding environment like solar, wind energy, vibration based energy harvesting, radio signals for scavenging RF power, Thermoelectric generators, and shoe-mounted piezoelectric generator to power artificial organs~\cite{ref59}.
\label{ch1:sec:07}
\indent The limited resources in WSNs have been addressed, and one of the main challenges in WSNs is the limited power resource. For this reason, extensive researches have been proposed in order to prolong the network lifetime by means of designing and implementing energy-efficient protocols. The reason for these large number of proposed protocols to maximize the network lifetime is the difficulty and sometime impossibility to replace or recharge the batteries of wireless sensor nodes especially in the large WSN and hostile environment.
-\indent The authors have defined the network lifetime in different contexts and use it as a metric to evaluate the performance of their protocols. Based on the previous proposed works in prolonging the network lifetime, Various definitions are exist for the lifetime of a sensor network~\cite{ref92,ref93} such as:~\textbf{(i)} is the time spent by WSN until the death of the first wireless sensor node ( or cluster head ) in the network due to its energy depletion.~\textbf{(ii)} is the time spent by WSN and has at least a specific set $\beta$ of alive sensor nodes in WSN.~\textbf{(iii)} is the time spent by WSN until the death of all wireless sensor nodes in WSN because they have been depleted their energy.~\textbf{(iv)} for k-coverage is the time spent by WSN in covering the area of interest by at least $k$ sensor nodes.~\textbf{(v)} for 100 $\%$ coverage is the time spent by WSN in covering each target or the whole area by at least one sensor node.~\textbf{(vi)} for $\alpha$-coverage: the total time by which at least $\alpha$ part of the sensing field is covered by at least one node; or is the time spent by WSN until the coverage ratio becomes less than a predetermined threshold $\alpha$.~\textbf{(vii)} the working time spent by the system before either the coverage ratio or delivery ratio become less than a predetermined threshold.~\textbf{(viii)} the number of the successful data gathering trips.~\textbf{(ix)} the number of sent packets.~\textbf{(x)} the percentage of wireless sensor nodes that have a route to the sink.~\textbf{(xi)} the prediction of the total period of time during which the probability of ensuring the connectivity and k-coverage concurrently is at least $\alpha$.~\textbf{(xii)} the time spent by WSN until loosing the connectivity or the coverage.~\textbf{(xiii)} the time spent by WSN until acceptable event detection ratio is not acceptable in the network.~\textbf{(xiv)} the time spent by WSN and the application requirement has been met.
+\indent The authors have defined the network lifetime in different contexts and use it as a metric to evaluate the performance of their protocols. Based on the previous proposed works in prolonging the network lifetime, Various definitions are exist for the lifetime of a sensor network~\cite{ref92,ref93} such as:
+%~\textbf{(i)}
+\begin{enumerate} [i.]
+
+\item The time spent by WSN until the death of the first wireless sensor node ( or cluster head ) in the network due to its energy depletion~\cite{ref162,ref163}.
+\item The time spent by WSN and has at least a specific set $\beta$ of alive sensor nodes in WSN~\cite{ref164,ref165}.
+\item The time spent by WSN until the death of all wireless sensor nodes in WSN because they have been depleted their energy~\cite{ref166}.
+\item For k-coverage, is the time spent by WSN in covering the area of interest by at least $k$ sensor nodes~\cite{DESK}.
+\item For 100 $\%$ coverage is the time spent by WSN in covering each target or the whole area by at least one sensor node~\cite{ref167}.
+\item For $\alpha$-coverage: the total time by which at least $\alpha$ part of the sensing field is covered by at least one node~\cite{ref168}; or is the time spent by WSN until the coverage ratio becomes less than a predetermined threshold $\alpha$~\cite{ref169}.
+\item The working time spent by the system before either the coverage ratio or delivery ratio become less than a predetermined threshold~\cite{ref170}.
+\item The number of the successful data gathering trips~\cite{ref173}.
+\item The number of sent packets~\cite{ref174}.
+\item The percentage of wireless sensor nodes that have a route to the sink~\cite{ref170}.
+\item The prediction of the total period of time during which the probability of ensuring the connectivity and k-coverage concurrently is at least $\alpha$~\cite{ref175}.
+\item The time spent by WSN until loosing the connectivity or the coverage~\cite{ref171}.
+\item The time spent by WSN until acceptable event detection ratio is not acceptable in the network~\cite{ref166}.
+\item The time during which the application requirement is satisfied~\cite{ref172}.
+\end{enumerate}
\indent According to the above definitions for network lifetime, there is no universal definition reflects the requirements of each application and the effects of the environment. In real WSN, the network lifetime reflects a set of a particular circumstances of the environment. Accordingly, the current definitions are applicable for the WSNs that meet a particular conditions. However, many more parameters, which are affecting on the network lifetime of WSN such as~\cite{ref92}: heterogeneity, node mobility, topology changes, application characteristics, quality of service, and completeness.
\section{Coverage in Wireless Sensor Networks }
\label{ch1:sec:8}
-%\indent Energy efficiency is a crucial issue in wireless sensor networks since 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,ref101}.
-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 few energy as possible. Sensor nodes are battery-powered with no
+%\indent Energy efficiency is a crucial issue in wireless sensor networks since 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,ref101}. 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 few energy as possible. Sensor nodes are battery-powered with no
mean 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
\begin{enumerate}[(i)]
\item $\textbf{Coverage Type}$ refers to determining what is it exactly that you are trying to cover. Typically, it may be required to monitor a whole area, observe a set of targets, or look for a breach among a barrier.
-\item $\textbf{Deployment Method}$ refers to the way by which the wireless sensor nodes are deployed over the target sensing field in order to build the wireless sensor network. Generally, the sensor nodes can be placed either deterministically or randomly in the target sensing field so as to construct the wireless sensor network~\cite{ref107}. The method of placement the sensor nodes can be selected based on the type of sensors, application, and the environment. In the deterministic placing, the deployment can be achieved in case of small number of sensor nodes and in friendly environment, whilst for a large number of sensor nodes or where the area of interest is inaccessible or hostile, a random placing is the choice. The sensor network can be either dense or sparse. The dense deployment is preferred when the robust security is important or when it is required that the area is covered by more than one sensor node. On the other hand, the sparse deployment is used when the dense deployment is expensive or when the maximum coverage is performed by a less number of sensor nodes.
+\item $\textbf{Deployment Method}$ refers to the way by which the wireless sensor nodes are deployed over the target sensing field in order to build the wireless sensor network. Generally, the sensor nodes can be placed either deterministically or randomly in the target sensing field so as to construct the wireless sensor network~\cite{ref107}. The method of placement the sensor nodes can be selected based on the type of sensors, application, and the environment. In the deterministic placing, the deployment can be achieved in case of small number of sensor nodes and in friendly environment, whilst for a large number of sensor nodes or where the area of interest is inaccessible or hostile, a random placing is the choice. The sensor network can be either dense or sparse. The dense deployment is preferable when it is necessary to provide a security robustness in WSNs. On the other hand, the sparse deployment is used when the dense deployment is expensive or when the maximum coverage is performed by a less number of sensor nodes.
\item $\textbf{Coverage Degree}$ refers to how many sensor nodes are required to cover a target or an area. This K-coverage mean the point in the sensing field is covered by at least K sensor nodes. Some applications need a high reliability to achieve their tasks, therefore, the sensing field is deployed densely so as to perform a K-coverage for this field. The simple coverage problem consists of a coverage degree equal to one (i.e., K=1), where every point in the sensing field is covered by at least one sensor.
\contentsline {subsubsection}{\numberline {1.6.1.1}Routing Metric based on Residual Energy:}{27}{subsubsection.1.6.1.1}
\contentsline {subsubsection}{\numberline {1.6.1.2}Multipath Routing:}{28}{subsubsection.1.6.1.2}
\contentsline {subsection}{\numberline {1.6.2}Cluster Architectures:}{28}{subsection.1.6.2}
-\contentsline {subsection}{\numberline {1.6.3}Scheduling Schemes:}{29}{subsection.1.6.3}
+\contentsline {subsection}{\numberline {1.6.3}Scheduling Schemes:}{28}{subsection.1.6.3}
\contentsline {subsubsection}{\numberline {1.6.3.1}Wake up Scheduling Schemes:}{29}{subsubsection.1.6.3.1}
\contentsline {subsubsection}{\numberline {1.6.3.2}Topology Control Schemes:}{31}{subsubsection.1.6.3.2}
\contentsline {subsection}{\numberline {1.6.4}Data-Driven Schemes:}{32}{subsection.1.6.4}
\contentsline {subsubsection}{\numberline {1.6.5.2}Wireless Charging:}{33}{subsubsection.1.6.5.2}
\contentsline {subsection}{\numberline {1.6.6}Radio Optimization:}{33}{subsection.1.6.6}
\contentsline {subsection}{\numberline {1.6.7}Relay nodes and Sink Mobility:}{33}{subsection.1.6.7}
-\contentsline {subsubsection}{\numberline {1.6.7.1}Relay node placement:}{34}{subsubsection.1.6.7.1}
+\contentsline {subsubsection}{\numberline {1.6.7.1}Relay node placement:}{33}{subsubsection.1.6.7.1}
\contentsline {subsubsection}{\numberline {1.6.7.2}Sink Mobility:}{34}{subsubsection.1.6.7.2}
\contentsline {section}{\numberline {1.7}Network Lifetime in Wireless Sensor Networks}{34}{section.1.7}
\contentsline {section}{\numberline {1.8}Coverage in Wireless Sensor Networks }{35}{section.1.8}
\contentsline {subsubsection}{\numberline {5.4.2.4}The Network Lifetime}{100}{subsubsection.5.4.2.4}
\contentsline {section}{\numberline {5.5}Conclusion}{101}{section.5.5}
\contentsline {part}{III\hspace {1em}Conclusion and Perspectives}{105}{part.3}
-\contentsline {part}{Bibliographie}{115}{chapter*.6}
+\contentsline {part}{Bibliographie}{117}{chapter*.6}
}
+
+@inproceedings{ref162,
+ title={Maximizing the functional lifetime of sensor networks},
+ author={Giridhar, Arvind and Kumar, PR},
+ booktitle={Proceedings of the 4th international symposium on Information processing in sensor networks},
+ pages={2},
+ year={2005},
+ organization={IEEE Press}
+}
+
+@inproceedings{ref163,
+ title={Using mobile relays to prolong the lifetime of wireless sensor networks},
+ author={Wang, Wei and Srinivasan, Vikram and Chua, Kee-Chaing},
+ booktitle={Proceedings of the 11th annual international conference on Mobile computing and networking},
+ pages={270--283},
+ year={2005},
+ organization={ACM}
+}
+
+@article{ref164,
+ title={Investigating a wireless sensor network optimal lifetime solution for linear topologies},
+ author={Hellman, Keith and Colagrosso, Michael},
+ journal={Journal of Interconnection Networks},
+ volume={7},
+ number={01},
+ pages={91--99},
+ year={2006},
+ publisher={World Scientific}
+}
+
+
+@article{ref165,
+ title={Scheduling sleeping nodes in high density cluster-based sensor networks},
+ author={Deng, Jing and Han, Yunghsiang S and Heinzelman, Wendi B and Varshney, Pramod K},
+ journal={Mobile Networks and Applications},
+ volume={10},
+ number={6},
+ pages={825--835},
+ year={2005},
+ publisher={Springer-Verlag New York, Inc.}
+}
+
+
+@inproceedings{ref166,
+ title={A coverage-preserving node scheduling scheme for large wireless sensor networks},
+ author={Tian, Di and Georganas, Nicolas D},
+ booktitle={Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications},
+ pages={32--41},
+ year={2002},
+ organization={ACM}
+}
+
+@inproceedings{ref167,
+ title={Energy-efficient target coverage in wireless sensor networks},
+ author={Cardei, Mihaela and Thai, My T and Li, Yingshu and Wu, Weili},
+ booktitle={INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE},
+ volume={3},
+ pages={1976--1984},
+ year={2005},
+ organization={IEEE}
+}
+
+@article{ref168,
+ title={Maintaining sensing coverage and connectivity in large sensor networks},
+ author={Zhang, Honghai and Hou, Jennifer C},
+ journal={Ad Hoc \& Sensor Wireless Networks},
+ volume={1},
+ number={1-2},
+ pages={89--124},
+ year={2005},
+ publisher={vol}
+}
+
+@article{ref169,
+ title={Lightweight deployment-aware scheduling for wireless sensor networks},
+ author={Wu, Kui and Gao, Yong and Li, Fulu and Xiao, Yang},
+ journal={Mobile networks and applications},
+ volume={10},
+ number={6},
+ pages={837--852},
+ year={2005},
+ publisher={Springer}
+}
+
+@article{ref170,
+ title={Redundancy and coverage detection in sensor networks},
+ author={C{\u{a}}rbunar, Bogdan and Grama, Ananth and Vitek, Jan and C{\u{a}}rbunar, Octavian},
+ journal={ACM Transactions on Sensor Networks (TOSN)},
+ volume={2},
+ number={1},
+ pages={94--128},
+ year={2006},
+ publisher={ACM}
+}
+
+@inproceedings{ref171,
+ title={On sensor network lifetime and data distortion},
+ author={Kansal, Aman and Ramamoorthy, Aditya and Srivastava, Mani B and Pottie, Gregory J},
+ booktitle={Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on},
+ pages={6--10},
+ year={2005},
+ organization={IEEE}
+}
+
+
+@inproceedings{ref172,
+ title={On the lifetime analysis of always-on wireless sensor network applications},
+ author={Kumar, Santosh and Arora, Anish and Lai, Ten-Hwang},
+ booktitle={Mobile Adhoc and Sensor Systems Conference, 2005. IEEE International Conference on},
+ pages={3--pp},
+ year={2005},
+ organization={IEEE}
+}
+
+@inproceedings{ref173,
+ title={Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Reporting.},
+ author={Olariu, Stephan and Stojmenovic, Ivan},
+ booktitle={INFOCOM},
+ pages={1--12},
+ year={2006}
+}
+
+@article{ref174,
+ title={Lifetime analysis of reliable wireless sensor networks},
+ author={Baydere, Sebnem and Safkan, Yasar and Durmaz, Ozlem},
+ journal={IEICE transactions on communications},
+ volume={88},
+ number={6},
+ pages={2465--2472},
+ year={2005},
+ publisher={The Institute of Electronics, Information and Communication Engineers}
+}
+
+
+@inproceedings{ref175,
+ title={Mostly-sleeping wireless sensor networks: connectivity,
+k-coverage, and alpha-lifetime.},
+ author={MO, W. and QIAO, D. and WANG, Z.},
+ booktitle={In Proceedings of the the 43rd Annual Allerton Conference on
+Communication, Control, and Computing},
+ pages={1--12},
+ year={2005}
+}
\ No newline at end of file
