1 % v2-acmsmall-sample.tex, dated March 6 2012
\r
2 % This is a sample file for ACM small trim journals
\r
4 % Compilation using 'acmsmall.cls' - version 1.3 (March 2012), Aptara Inc.
\r
5 % (c) 2010 Association for Computing Machinery (ACM)
\r
7 % Questions/Suggestions/Feedback should be addressed to => "acmtexsupport@aptaracorp.com".
\r
8 % Users can also go through the FAQs available on the journal's submission webpage.
\r
10 % Steps to compile: latex, bibtex, latex latex
\r
12 % For tracking purposes => this is v1.3 - March 2012
\r
14 \documentclass[prodmode,acmtosn]{acmsmall} % Aptara syntax
\r
16 % Package to generate and customize Algorithm as per ACM style
\r
17 \usepackage[ruled]{algorithm2e}
\r
18 \renewcommand{\algorithmcfname}{ALGORITHM}
\r
20 \SetAlCapFnt{\small}
\r
21 \SetAlCapNameFnt{\small}
\r
23 \IncMargin{-\parindent}
\r
25 % Metadata Information
\r
36 \markboth{A.K. Idrees et al.}{Perimeter-based Coverage Optimization to Improve Lifetime in Wireless Sensor Networks}
\r
39 \title{Perimeter-based Coverage Optimization to Improve Lifetime in Wireless Sensor Networks}
\r
40 \author{ALI KADHUM IDREES, KARINE DESCHINKEL, MICHEL SALOMON, RAPHAEL COUTURIER
\r
41 \affil{FEMTO-ST Institute, University of Franche-Comte}}
\r
43 % NOTE! Affiliations placed here should be for the institution where the
\r
44 % BULK of the research was done. If the author has gone to a new
\r
45 % institution, before publication, the (above) affiliation should NOT be changed.
\r
46 % The authors 'current' address may be given in the "Author's addresses:" block (below).
\r
47 % So for example, Mr. Abdelzaher, the bulk of the research was done at UIUC, and he is
\r
48 % currently affiliated with NASA.
\r
51 The most important problem in a Wireless Sensor Network (WSN) is to optimize the
\r
52 use of its limited energy provision, so that it can fulfill its monitoring task
\r
53 as long as possible. Among known available approaches that can be used to
\r
54 improve power management, lifetime coverage optimization provides activity
\r
55 scheduling which ensures sensing coverage while minimizing the energy cost. In
\r
56 this paper, we propose such an approach called Perimeter-based Coverage Optimization
\r
57 protocol (PeCO). It is a hybrid of centralized and distributed methods: the
\r
58 region of interest is first subdivided into subregions and our protocol is then
\r
59 distributed among sensor nodes in each subregion.
\r
60 The novelty of our approach lies essentially in the formulation of a new
\r
61 mathematical optimization model based on the perimeter coverage level to schedule
\r
62 sensors' activities. Extensive simulation experiments have been performed using
\r
63 OMNeT++, the discrete event simulator, to demonstrate that PeCO can
\r
64 offer longer lifetime coverage for WSNs in comparison with some other protocols.
\r
67 \category{C.2.3}{Computer-Communication Networks}{Network Operations}
\r
69 \terms{Algorithms, Simulation}
\r
71 \keywords{Wireless Sensor Networks, Area Coverage, Network Lifetime, Optimization, Scheduling.}
\r
73 \acmformat{Ali Kadhum Idrees, Karine Deschinkel, Michel Salomon, Rapha\"el Couturier. Perimeter-based Coverage Optimization to Improve Lifetime in Wireless Sensor Networks.}
\r
74 % At a minimum you need to supply the author names, year and a title.
\r
76 % Full first names whenever they are known, surname last, followed by a period.
\r
77 % In the case of two authors, 'and' is placed between them.
\r
78 % In the case of three or more authors, the serial comma is used, that is, all author names
\r
79 % except the last one but including the penultimate author's name are followed by a comma,
\r
80 % and then 'and' is placed before the final author's name.
\r
81 % If only first and middle initials are known, then each initial
\r
82 % is followed by a period and they are separated by a space.
\r
83 % The remaining information (journal title, volume, article number, date, etc.) is 'auto-generated'.
\r
86 %This work is supported by the National Science Foundation, under
\r
87 %grant CNS-0435060, grant CCR-0325197 and grant EN-CS-0329609.
\r
89 %Author's addresses: G. Zhou, Computer Science Department,
\r
90 %College of William and Mary; Y. Wu {and} J. A. Stankovic,
\r
91 %Computer Science Department, University of Virginia; T. Yan,
\r
92 %Eaton Innovation Center; T. He, Computer Science Department,
\r
93 %University of Minnesota; C. Huang, Google; T. F. Abdelzaher,
\r
94 %(Current address) NASA Ames Research Center, Moffett Field, California 94035.
\r
98 \section{Introduction}
\r
99 \label{sec:introduction}
\r
101 \noindent The continuous progress in Micro Electro-Mechanical Systems (MEMS) and
\r
102 wireless communication hardware has given rise to the opportunity to use large
\r
103 networks of tiny sensors, called Wireless Sensor Networks
\r
104 (WSN)~\cite{akyildiz2002wireless,puccinelli2005wireless}, to fulfill monitoring
\r
105 tasks. A WSN consists of small low-powered sensors working together by
\r
106 communicating with one another through multi-hop radio communications. Each node
\r
107 can send the data it collects in its environment, thanks to its sensor, to the
\r
108 user by means of sink nodes. The features of a WSN made it suitable for a wide
\r
109 range of application in areas such as business, environment, health, industry,
\r
110 military, and so on~\cite{yick2008wireless}. Typically, a sensor node contains
\r
111 three main components~\cite{anastasi2009energy}: a sensing unit able to measure
\r
112 physical, chemical, or biological phenomena observed in the environment; a
\r
113 processing unit which will process and store the collected measurements; a radio
\r
114 communication unit for data transmission and receiving.
\r
116 The energy needed by an active sensor node to perform sensing, processing, and
\r
117 communication is supplied by a power supply which is a battery. This battery has
\r
118 a limited energy provision and it may be unsuitable or impossible to replace or
\r
119 recharge it in most applications. Therefore it is necessary to deploy WSN with
\r
120 high density in order to increase reliability and to exploit node redundancy
\r
121 thanks to energy-efficient activity scheduling approaches. Indeed, the overlap
\r
122 of sensing areas can be exploited to schedule alternatively some sensors in a
\r
123 low power sleep mode and thus save energy. Overall, the main question that must
\r
124 be answered is: how to extend the lifetime coverage of a WSN as long as possible
\r
125 while ensuring a high level of coverage? These past few years many
\r
126 energy-efficient mechanisms have been suggested to retain energy and extend the
\r
127 lifetime of the WSNs~\cite{rault2014energy}.
\r
129 This paper makes the following contributions.
\r
131 \item We have devised a framework to schedule nodes to be activated alternatively such
\r
132 that the network lifetime is prolonged while ensuring that a certain level of
\r
133 coverage is preserved. A key idea in our framework is to exploit spatial and
\r
134 temporal subdivision. On the one hand, the area of interest is divided into
\r
135 several smaller subregions and, on the other hand, the time line is divided into
\r
136 periods of equal length. In each subregion the sensor nodes will cooperatively
\r
137 choose a leader which will schedule nodes' activities, and this grouping of
\r
138 sensors is similar to typical cluster architecture.
\r
139 \item We have proposed a new mathematical optimization model. Instead of trying to
\r
140 cover a set of specified points/targets as in most of the methods proposed in
\r
141 the literature, we formulate an integer program based on perimeter coverage of
\r
142 each sensor. The model involves integer variables to capture the deviations
\r
143 between the actual level of coverage and the required level. Hence, an
\r
144 optimal scheduling will be obtained by minimizing a weighted sum of these
\r
146 \item We have conducted extensive simulation experiments, using the discrete event
\r
147 simulator OMNeT++, to demonstrate the efficiency of our protocol. We have compared
\r
148 our PeCO protocol to two approaches found in the literature:
\r
149 DESK~\cite{ChinhVu} and GAF~\cite{xu2001geography}, and also to our previous
\r
150 work published in~\cite{Idrees2} which is based on another optimization model
\r
151 for sensor scheduling.
\r
159 The rest of the paper is organized as follows. In the next section we review
\r
160 some related work in the field. Section~\ref{sec:The PeCO Protocol Description}
\r
161 is devoted to the PeCO protocol description and Section~\ref{cp} focuses on the
\r
162 coverage model formulation which is used to schedule the activation of sensor
\r
163 nodes. Section~\ref{sec:Simulation Results and Analysis} presents simulations
\r
164 results and discusses the comparison with other approaches. Finally, concluding
\r
165 remarks are drawn and some suggestions are given for future works in
\r
166 Section~\ref{sec:Conclusion and Future Works}.
\r
168 % that show that our protocol outperforms others protocols.
\r
169 \section{Related Literature}
\r
170 \label{sec:Literature Review}
\r
172 \noindent In this section, we summarize some related works regarding the
\r
173 coverage problem and distinguish our PeCO protocol from the works presented in
\r
176 The most discussed coverage problems in literature can be classified in three
\r
177 categories~\cite{li2013survey} according to their respective monitoring
\r
178 objective. Hence, area coverage \cite{Misra} means that every point inside a
\r
179 fixed area must be monitored, while target coverage~\cite{yang2014novel} refers
\r
180 to the objective of coverage for a finite number of discrete points called
\r
181 targets, and barrier coverage~\cite{HeShibo}\cite{kim2013maximum} focuses on
\r
182 preventing intruders from entering into the region of interest. In
\r
183 \cite{Deng2012} authors transform the area coverage problem into the target
\r
184 coverage one taking into account the intersection points among disks of sensors
\r
185 nodes or between disk of sensor nodes and boundaries. In
\r
186 \cite{Huang:2003:CPW:941350.941367} authors prove that if the perimeters of
\r
187 sensors are sufficiently covered it will be the case for the whole area. They
\r
188 provide an algorithm in $O(nd~log~d)$ time to compute the perimeter-coverage of
\r
189 each sensor, where $d$ denotes the maximum number of sensors that are
\r
190 neighbors to a sensor and $n$ is the total number of sensors in the
\r
191 network. {\it In PeCO protocol, instead of determining the level of coverage of
\r
192 a set of discrete points, our optimization model is based on checking the
\r
193 perimeter-coverage of each sensor to activate a minimal number of sensors.}
\r
195 The major approach to extend network lifetime while preserving coverage is to
\r
196 divide/organize the sensors into a suitable number of set covers (disjoint or
\r
197 non-disjoint)\cite{wang2011coverage}, where each set completely covers a region of interest, and to
\r
198 activate these set covers successively. The network activity can be planned in
\r
199 advance and scheduled for the entire network lifetime or organized in periods,
\r
200 and the set of active sensor nodes is decided at the beginning of each period
\r
201 \cite{ling2009energy}. Active node selection is determined based on the problem
\r
202 requirements (e.g. area monitoring, connectivity, or power efficiency). For
\r
203 instance, Jaggi {\em et al.}~\cite{jaggi2006} address the problem of maximizing
\r
204 the lifetime by dividing sensors into the maximum number of disjoint subsets
\r
205 such that each subset can ensure both coverage and connectivity. A greedy
\r
206 algorithm is applied once to solve this problem and the computed sets are
\r
207 activated in succession to achieve the desired network lifetime. Vu
\r
208 \cite{chin2007}, \cite{yan2008design}, Padmatvathy {\em et al.}~\cite{pc10}, propose algorithms
\r
209 working in a periodic fashion where a cover set is computed at the beginning of
\r
210 each period. {\it Motivated by these works, PeCO protocol works in periods,
\r
211 where each period contains a preliminary phase for information exchange and
\r
212 decisions, followed by a sensing phase where one cover set is in charge of the
\r
215 Various centralized and distributed approaches, or even a mixing of these two
\r
216 concepts, have been proposed to extend the network lifetime \cite{zhou2009variable}. In distributed algorithms~\cite{Tian02,yangnovel,ChinhVu,qu2013distributed} each sensor decides of its
\r
217 own activity scheduling after an information exchange with its neighbors. The
\r
218 main interest of such an approach is to avoid long range communications and thus
\r
219 to reduce the energy dedicated to the communications. Unfortunately, since each
\r
220 node has only information on its immediate neighbors (usually the one-hop ones)
\r
221 it may make a bad decision leading to a global suboptimal solution. Conversely,
\r
223 algorithms~\cite{cardei2005improving,zorbas2010solving,pujari2011high} always
\r
224 provide nearly or close to optimal solution since the algorithm has a global
\r
225 view of the whole network. The disadvantage of a centralized method is obviously
\r
226 its high cost in communications needed to transmit to a single node, the base
\r
227 station which will globally schedule nodes' activities, data from all the other
\r
228 sensor nodes in the area. The price in communications can be huge since
\r
229 long range communications will be needed. In fact the larger the WNS is, the
\r
230 higher the communication and thus the energy cost are. {\it In order to be
\r
231 suitable for large-scale networks, in the PeCO protocol, the area of interest
\r
232 is divided into several smaller subregions, and in each one, a node called the
\r
233 leader is in charge of selecting the active sensors for the current
\r
234 period. Thus our protocol is scalable and is a globally distributed method,
\r
235 whereas it is centralized in each subregion.}
\r
237 Various coverage scheduling algorithms have been developed these past few years.
\r
238 Many of them, dealing with the maximization of the number of cover sets, are
\r
239 heuristics. These heuristics involve the construction of a cover set by
\r
240 including in priority the sensor nodes which cover critical targets, that is to
\r
241 say targets that are covered by the smallest number of sensors
\r
242 \cite{berman04,zorbas2010solving}. Other approaches are based on mathematical
\r
243 programming formulations~\cite{cardei2005energy,5714480,pujari2011high,Yang2014}
\r
244 and dedicated techniques (solving with a branch-and-bound algorithm available in
\r
245 optimization solver). The problem is formulated as an optimization problem
\r
246 (maximization of the lifetime or number of cover sets) under target coverage and
\r
247 energy constraints. Column generation techniques, well-known and widely
\r
248 practiced techniques for solving linear programs with too many variables, have
\r
250 used~\cite{castano2013column,rossi2012exact,deschinkel2012column}. {\it In the PeCO
\r
251 protocol, each leader, in charge of a subregion, solves an integer program
\r
252 which has a twofold objective: minimize the overcoverage and the undercoverage
\r
253 of the perimeter of each sensor.}
\r
255 %\noindent Recently, the coverage problem has been received a high attention, which concentrates on how the physical space could be well monitored after the deployment. Coverage is one of the Quality of Service (QoS) parameters in WSNs, which is highly concerned with power depletion~\cite{zhu2012survey}. Most of the works about the coverage protocols have been suggested in the literature focused on three types of the coverage in WSNs~\cite{mulligan2010coverage}: the first, area coverage means that each point in the area of interest within the sensing range of at least one sensor node; the second, target coverage in which a fixed set of targets need to be monitored; the third, barrier coverage refers to detect the intruders crossing a boundary of WSN. The work in this paper emphasized on the area coverage, so, some area coverage protocols have been reviewed in this section, and the shortcomings of reviewed approaches are being summarized.
\r
257 %The problem of k-coverage in WSNs was addressed~\cite{ammari2012centralized}. It mathematically formulated and the spacial sensor density for full k-coverage determined, where the relation between the communication range and the sensing range constructed by this work to retain the k-coverage and connectivity in WSN. After that, a four configuration protocols have proposed for treating the k-coverage in WSNs.
\r
259 %In~\cite{rebai2014branch}, the problem of full grid coverage is formulated using two integer linear programming models: the first, a model that takes into account only the overall coverage constraint; the second, both the connectivity and the full grid coverage constraints have taken into consideration. This work did not take into account the energy constraint.
\r
261 %Li et al.~\cite{li2011transforming} presented a framework to convert any complete coverage problem to a partial coverage one with any coverage ratio by means of executing a complete coverage algorithm to find a full coverage sets with virtual radii and transforming the coverage sets to a partial coverage sets by adjusting sensing radii. The properties of the original algorithms can be maintained by this framework and the transformation process has a low execution time.
\r
263 %The authors in~\cite{liu2014generalized} explained that in some applications of WSNs such as structural health monitoring (SHM) and volcano monitoring, the traditional coverage model which is a geographic area defined for individual sensors is not always valid. For this reason, they define a generalized coverage model, which is not need to have the coverage area of individual nodes, but only based on a function to determine whether a set of
\r
264 %sensor nodes is capable of satisfy the requested monitoring task for a certain area. They have proposed two approaches to divide the deployed nodes into suitable cover sets, which can be used to prolong the network lifetime.
\r
266 %The work in~\cite{wang2010preserving} addressed the target area coverage problem by proposing a geometric-based activity scheduling scheme, named GAS, to fully cover the target area in WSNs. The authors deals with small area (target area coverage), which can be monitored by a single sensor instead of area coverage, which focuses on a large area that should be monitored by many sensors cooperatively. They explained that GAS is capable to monitor the target area by using a few sensors as possible and it can produce as many cover sets as possible.
\r
268 %Cho et al.~\cite{cho2007distributed} proposed a distributed node scheduling protocol, which can retain sensing coverage needed by applications
\r
269 %and increase network lifetime via putting in sleep mode some redundant nodes. In this work, the effective sensing area (ESA) concept of a sensor node is used, which refers to the sensing area that is not overlapping with another sensor's sensing area. A sensor node and by compute it's ESA can be determine whether it will be active or sleep. The suggested work permits to sensor nodes to be in sleep mode opportunistically whilst fulfill the needed sensing coverage.
\r
271 %In~\cite{quang2008algorithm}, the authors defined a maximum sensing coverage region problem (MSCR) in WSNs and then proposed an algorithm to solve it. The
\r
272 %maximum observed area fully covered by a minimum active sensors. In this work, the major property is to getting rid from the redundant sensors in high-density WSNs and putting them in sleep mode, and choosing a smaller number of active sensors so as to be sure that the full area is k-covered, and all events appeared in that area can be precisely and timely detected. This algorithm minimized the total energy consumption and increased the lifetime.
\r
274 %A novel method to divide the sensors in the WSN, called node coverage grouping (NCG) suggested~\cite{lin2010partitioning}. The sensors in the connectivity group are within sensing range of each other, and the data collected by them in the same group are supposed to be similar. They are proved that dividing n sensors via NCG into connectivity groups is a NP-hard problem. So, a heuristic algorithm of NCG with time complexity of $O(n^3)$ is proposed.
\r
275 %For some applications, such as monitoring an ecosystem with extremely diversified environment, It might be premature assumption that sensors near to each other sense similar data.
\r
277 %In~\cite{zaidi2009minimum}, the problem of minimum cost coverage in which full coverage is performed by using the minimum number of sensors for an arbitrary geometric shape region is addressed. a geometric solution to the minimum cost coverage problem under a deterministic deployment is proposed. The probabilistic coverage solution which provides a relationship between the probability of coverage and the number of randomly deployed sensors in an arbitrarily-shaped region is suggested. The authors are clarified that with a random deployment about seven times more nodes are required to supply full coverage.
\r
279 %A graph theoretical framework for connectivity-based coverage with configurable coverage granularity was proposed~\cite{dong2012distributed}. A new coverage criterion and scheduling approach is proposed based on cycle partition. This method is capable of build a sparse coverage set in distributed way by means of only connectivity information. This work considers only the communication range of the sensor is smaller two times the sensing range of sensor.
\r
281 %Liu et al.~\cite{liu2010energy} formulated maximum disjoint sets problem for retaining coverage and connectivity in WSN. Two algorithms are proposed for solving this problem, heuristic algorithm and network flow algorithm. This work did not take into account the sensor node failure, which is an unpredictable event because the two solutions are full centralized algorithms.
\r
283 %The work that presented in~\cite{aslanyan2013optimal} solved the coverage and connectivity problem in sensor networks in
\r
284 %an integrated way. The network lifetime is divided in a fixed number of rounds. A coverage bitmap of sensors of the domain has been generated in each round and based on this bitmap, it has been decided which sensors
\r
285 %stay active or turn it to sleep. They checked the connection of the graph via laplacian of adjancy graph of active sensors in each round. the generation of coverage bitmap by using Minkowski technique, the network is able to providing the desired ratio of coverage. They have been defined the connected coverage problem as an optimization problem and a centralized genetic algorithm is used to find the solution.
\r
287 %Several algorithms to retain the coverage and maximize the network lifetime were proposed in~\cite{cardei2006energy,wang2011coverage}.
\r
289 %\uppercase{\textbf{shortcomings}}. In spite of many energy-efficient protocols for maintaining the coverage and improving the network lifetime in WSNs were proposed, non of them ensure the coverage for the sensing field with optimal minimum number of active sensor nodes, and for a long time as possible. For example, in a full centralized algorithms, an optimal solutions can be given by using optimization approaches, but in the same time, a high energy is consumed for the execution time of the algorithm and the communications among the sensors in the sensing field, so, the full centralized approaches are not good candidate to use it especially in large WSNs. Whilst, a full distributed algorithms can not give optimal solutions because this algorithms use only local information of the neighboring sensors, but in the same time, the energy consumption during the communications and executing the algorithm is highly lower. Whatever the case, this would result in a shorter lifetime coverage in WSNs.
\r
291 %\uppercase{\textbf{Our Protocol}}. In this paper, a Lifetime Coverage Optimization Protocol, called (PeCO) in WSNs is suggested. The sensing field is divided into smaller subregions by means of divide-and-conquer method, and a PeCO protocol is distributed in each sensor in the subregion. The network lifetime in each subregion is divided into periods, each period includes 4 stages: Information Exchange, Leader election, decision based activity scheduling optimization, and sensing. The leaders are elected in an independent, asynchronous, and distributed way in all the subregions of the WSN. After that, 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. 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.
\r
293 \section{ The P{\scshape e}CO Protocol Description}
\r
294 \label{sec:The PeCO Protocol Description}
\r
296 \noindent In this section, we describe in details our Perimeter-based Coverage
\r
297 Optimization protocol. First we present the assumptions we made and the models
\r
298 we considered (in particular the perimeter coverage one), second we describe the
\r
299 background idea of our protocol, and third we give the outline of the algorithm
\r
300 executed by each node.
\r
302 % It is based on two efficient-energy mechanisms: the first, is partitioning the sensing field into smaller subregions, and one leader is elected for each subregion; the second, a sensor activity scheduling based new optimization model so as to produce the optimal cover set of active sensors for the sensing stage during the period. Obviously, these two mechanisms can be contribute in extend the network lifetime coverage efficiently.
\r
303 %Before proceeding in the presentation of the main ideas of the protocol, we will briefly describe the perimeter coverage model and give some necessary assumptions and definitions.
\r
305 \subsection{Assumptions and Models}
\r
308 \noindent A WSN consisting of $J$ stationary sensor nodes randomly and uniformly
\r
309 distributed in a bounded sensor field is considered. The wireless sensors are
\r
310 deployed in high density to ensure initially a high coverage ratio of the area
\r
311 of interest. We assume that all the sensor nodes are homogeneous in terms of
\r
312 communication, sensing, and processing capabilities and heterogeneous from
\r
313 the energy provision point of view. The location information is available to a
\r
314 sensor node either through hardware such as embedded GPS or location discovery
\r
315 algorithms. We assume that each sensor node can directly transmit its
\r
316 measurements to a mobile sink node. For example, a sink can be an unmanned
\r
317 aerial vehicle (UAV) flying regularly over the sensor field to collect
\r
318 measurements from sensor nodes. A mobile sink node collects the measurements and
\r
319 transmits them to the base station. We consider a Boolean disk coverage model,
\r
320 which is the most widely used sensor coverage model in the literature, and all
\r
321 sensor nodes have a constant sensing range $R_s$. Thus, all the space points
\r
322 within a disk centered at a sensor with a radius equal to the sensing range are
\r
323 said to be covered by this sensor. We also assume that the communication range
\r
324 $R_c$ satisfies $R_c \geq 2 \cdot R_s$. In fact, Zhang and Zhou~\cite{Zhang05}
\r
325 proved that if the transmission range fulfills the previous hypothesis, the
\r
326 complete coverage of a convex area implies connectivity among active nodes.
\r
328 The PeCO protocol uses the same perimeter-coverage model as Huang and
\r
329 Tseng in~\cite{huang2005coverage}. It can be expressed as follows: a sensor is
\r
330 said to be perimeter covered if all the points on its perimeter are covered by
\r
331 at least one sensor other than itself. They proved that a network area is
\r
332 $k$-covered if and only if each sensor in the network is $k$-perimeter-covered (perimeter covered by at least $k$ sensors).
\r
333 %According to this model, we named the intersections among the sensor nodes in the sensing field as intersection points. Instead of working with the coverage area, we consider for each sensor a set of intersection points which are determined by using perimeter-coverage model.
\r
334 Figure~\ref{pcm2sensors}(a) shows the coverage of sensor node~$0$. On this
\r
335 figure, we can see that sensor~$0$ has nine neighbors and we have reported on
\r
336 its perimeter (the perimeter of the disk covered by the sensor) for each
\r
337 neighbor the two points resulting from the intersection of the two sensing
\r
338 areas. These points are denoted for neighbor~$i$ by $iL$ and $iR$, respectively
\r
339 for left and right from a neighboing point of view. The resulting couples of
\r
340 intersection points subdivide the perimeter of sensor~$0$ into portions called
\r
343 \begin{figure}[ht!]
\r
345 \begin{tabular}{@{}cr@{}}
\r
346 \includegraphics[width=75mm]{pcm.jpg} & \raisebox{3.25cm}{(a)} \\
\r
347 \includegraphics[width=75mm]{twosensors.jpg} & \raisebox{2.75cm}{(b)}
\r
349 \caption{(a) Perimeter coverage of sensor node 0 and (b) finding the arc of
\r
350 $u$'s perimeter covered by $v$.}
\r
351 \label{pcm2sensors}
\r
354 Figure~\ref{pcm2sensors}(b) describes the geometric information used to find the
\r
355 locations of the left and right points of an arc on the perimeter of a sensor
\r
356 node~$u$ covered by a sensor node~$v$. Node~$v$ is supposed to be located on the
\r
357 west side of sensor~$u$, with the following respective coordinates in the
\r
358 sensing area~: $(v_x,v_y)$ and $(u_x,u_y)$. From the previous coordinates we can
\r
359 compute the euclidean distance between nodes~$u$ and $v$: $Dist(u,v)=\sqrt{\vert
\r
360 u_x - v_x \vert^2 + \vert u_y-v_y \vert^2}$, while the angle~$\alpha$ is
\r
361 obtained through the formula:
\r
363 \alpha = \arccos \left(\frac{Dist(u,v)}{2R_s}
\r
366 The arc on the perimeter of~$u$ defined by the angular interval $[\pi
\r
367 - \alpha,\pi + \alpha]$ is said to be perimeter-covered by sensor~$v$.
\r
369 Every couple of intersection points is placed on the angular interval $[0,2\pi]$
\r
370 in a counterclockwise manner, leading to a partitioning of the interval.
\r
371 Figure~\ref{pcm2sensors}(a) illustrates the arcs for the nine neighbors of
\r
372 sensor $0$ and Figure~\ref{expcm} gives the position of the corresponding arcs
\r
373 in the interval $[0,2\pi]$. More precisely, we can see that the points are
\r
374 ordered according to the measures of the angles defined by their respective
\r
375 positions. The intersection points are then visited one after another, starting
\r
376 from the first intersection point after point~zero, and the maximum level of
\r
377 coverage is determined for each interval defined by two successive points. The
\r
378 maximum level of coverage is equal to the number of overlapping arcs. For
\r
380 between~$5L$ and~$6L$ the maximum level of coverage is equal to $3$
\r
381 (the value is highlighted in yellow at the bottom of Figure~\ref{expcm}), which
\r
382 means that at most 2~neighbors can cover the perimeter in addition to node $0$.
\r
383 Table~\ref{my-label} summarizes for each coverage interval the maximum level of
\r
384 coverage and the sensor nodes covering the perimeter. The example discussed
\r
385 above is thus given by the sixth line of the table.
\r
387 %The points reported on the line segment $[0,2\pi]$ separates it in intervals as shown in figure~\ref{expcm}. For example, for each neighboring sensor of sensor 0, place the points $\alpha^ 1_L$, $\alpha^ 1_R$, $\alpha^ 2_L$, $\alpha^ 2_R$, $\alpha^ 3_L$, $\alpha^ 3_R$, $\alpha^ 4_L$, $\alpha^ 4_R$, $\alpha^ 5_L$, $\alpha^ 5_R$, $\alpha^ 6_L$, $\alpha^ 6_R$, $\alpha^ 7_L$, $\alpha^ 7_R$, $\alpha^ 8_L$, $\alpha^ 8_R$, $\alpha^ 9_L$, and $\alpha^ 9_R$; on the line segment $[0,2\pi]$, and then sort all these points in an ascending order into a list. Traverse the line segment $[0,2\pi]$ by visiting each point in the sorted list from left to right and determine the coverage level of each interval of the sensor 0 (see figure \ref{expcm}). For each interval, we sum up the number of parts of segments, and we deduce a level of coverage for each interval. For instance, the interval delimited by the points $5L$ and $6L$ contains three parts of segments. That means that this part of the perimeter of the sensor $0$ may be covered by three sensors, sensor $0$ itself and sensors $2$ and $5$. The level of coverage of this interval may reach $3$ if all previously mentioned sensors are active. Let say that sensors $0$, $2$ and $5$ are involved in the coverage of this interval. Table~\ref{my-label} summarizes the level of coverage for each interval and the sensors involved in for sensor node 0 in figure~\ref{pcm2sensors}(a).
\r
388 % to determine the level of the perimeter coverage for each left and right point of a segment.
\r
390 \begin{figure*}[t!]
\r
392 \includegraphics[width=127.5mm]{expcm2.jpg}
\r
393 \caption{Maximum coverage levels for perimeter of sensor node $0$.}
\r
397 %For example, consider the sensor node $0$ in figure~\ref{pcmfig}, which has 9 neighbors. Figure~\ref{expcm} shows the perimeter coverage level for all left and right points of a segment that covered by a neighboring sensor nodes. Based on the figure~\ref{expcm}, the set of sensors for each left and right point of the segments illustrated in figure~\ref{ex2pcm} for the sensor node 0.
\r
401 \begin{figure}[ht!]
\r
403 \includegraphics[width=90mm]{ex2pcm.jpg}
\r
404 \caption{Coverage intervals and contributing sensors for sensor node 0.}
\r
411 \tbl{Coverage intervals and contributing sensors for sensor node 0 \label{my-label}}
\r
412 {\begin{tabular}{|c|c|c|c|c|c|c|c|c|}
\r
414 \begin{tabular}[c]{@{}c@{}}Left \\ point \\ angle~$\alpha$ \end{tabular} & \begin{tabular}[c]{@{}c@{}}Interval \\ left \\ point\end{tabular} & \begin{tabular}[c]{@{}c@{}}Interval \\ right \\ point\end{tabular} & \begin{tabular}[c]{@{}c@{}}Maximum \\ coverage\\ level\end{tabular} & \multicolumn{5}{c|}{\begin{tabular}[c]{@{}c@{}}Set of sensors\\ involved \\ in coverage interval\end{tabular}} \\ \hline
\r
415 0.0291 & 1L & 2L & 4 & 0 & 1 & 3 & 4 & \\ \hline
\r
416 0.104 & 2L & 3R & 5 & 0 & 1 & 3 & 4 & 2 \\ \hline
\r
417 0.3168 & 3R & 4R & 4 & 0 & 1 & 4 & 2 & \\ \hline
\r
418 0.6752 & 4R & 1R & 3 & 0 & 1 & 2 & & \\ \hline
\r
419 1.8127 & 1R & 5L & 2 & 0 & 2 & & & \\ \hline
\r
420 1.9228 & 5L & 6L & 3 & 0 & 2 & 5 & & \\ \hline
\r
421 2.3959 & 6L & 2R & 4 & 0 & 2 & 5 & 6 & \\ \hline
\r
422 2.4258 & 2R & 7L & 3 & 0 & 5 & 6 & & \\ \hline
\r
423 2.7868 & 7L & 8L & 4 & 0 & 5 & 6 & 7 & \\ \hline
\r
424 2.8358 & 8L & 5R & 5 & 0 & 5 & 6 & 7 & 8 \\ \hline
\r
425 2.9184 & 5R & 7R & 4 & 0 & 6 & 7 & 8 & \\ \hline
\r
426 3.3301 & 7R & 9R & 3 & 0 & 6 & 8 & & \\ \hline
\r
427 3.9464 & 9R & 6R & 4 & 0 & 6 & 8 & 9 & \\ \hline
\r
428 4.767 & 6R & 3L & 3 & 0 & 8 & 9 & & \\ \hline
\r
429 4.8425 & 3L & 8R & 4 & 0 & 3 & 8 & 9 & \\ \hline
\r
430 4.9072 & 8R & 4L & 3 & 0 & 3 & 9 & & \\ \hline
\r
431 5.3804 & 4L & 9R & 4 & 0 & 3 & 4 & 9 & \\ \hline
\r
432 5.9157 & 9R & 1L & 3 & 0 & 3 & 4 & & \\ \hline
\r
439 %The optimization algorithm that used by PeCO protocol based on the perimeter coverage levels of the left and right points of the segments and worked to minimize the number of sensor nodes for each left or right point of the segments within each sensor node. The algorithm minimize the perimeter coverage level of the left and right points of the segments, while, it assures that every perimeter coverage level of the left and right points of the segments greater than or equal to 1.
\r
441 In the PeCO protocol, the scheduling of the sensor nodes' activities is formulated with an
\r
442 integer program based on coverage intervals. The formulation of the coverage
\r
443 optimization problem is detailed in~section~\ref{cp}. Note that when a sensor
\r
444 node has a part of its sensing range outside the WSN sensing field, as in
\r
445 Figure~\ref{ex4pcm}, the maximum coverage level for this arc is set to $\infty$
\r
446 and the corresponding interval will not be taken into account by the
\r
447 optimization algorithm.
\r
451 \includegraphics[width=62.5mm]{ex4pcm.jpg}
\r
452 \caption{Sensing range outside the WSN's area of interest.}
\r
455 %Figure~\ref{ex5pcm} gives an example to compute the perimeter coverage levels for the left and right points of the segments for a sensor node $0$, which has a part of its sensing range exceeding the border of the sensing field of WSN, and it has a six neighbors. In figure~\ref{ex5pcm}, the sensor node $0$ has two segments outside the border of the network sensing field, so the left and right points of the two segments called $-1L$, $-1R$, $-2L$, and $-2R$.
\r
456 %\begin{figure}[ht!]
\r
458 %\includegraphics[width=75mm]{ex5pcm.jpg}
\r
459 %\caption{Coverage intervals and contributing sensors for sensor node 0 having a part of its sensing range outside the border.}
\r
463 \subsection{The Main Idea}
\r
465 \noindent The WSN area of interest is, in a first step, divided into regular
\r
466 homogeneous subregions using a divide-and-conquer algorithm. In a second step
\r
467 our protocol will be executed in a distributed way in each subregion
\r
468 simultaneously to schedule nodes' activities for one sensing period.
\r
470 As shown in Figure~\ref{fig2}, node activity scheduling is produced by our
\r
471 protocol in a periodic manner. Each period is divided into 4 stages: Information
\r
472 (INFO) Exchange, Leader Election, Decision (the result of an optimization
\r
473 problem), and Sensing. For each period there is exactly one set cover
\r
474 responsible for the sensing task. Protocols based on a periodic scheme, like
\r
475 PeCO, are more robust against an unexpected node failure. On the one hand, if
\r
476 a node failure is discovered before taking the decision, the corresponding sensor
\r
477 node will not be considered by the optimization algorithm. On the other
\r
478 hand, if the sensor failure happens after the decision, the sensing task of the
\r
479 network will be temporarily affected: only during the period of sensing until a
\r
480 new period starts, since a new set cover will take charge of the sensing task in
\r
481 the next period. The energy consumption and some other constraints can easily be
\r
482 taken into account since the sensors can update and then exchange their
\r
483 information (including their residual energy) at the beginning of each period.
\r
484 However, the pre-sensing phases (INFO Exchange, Leader Election, and Decision)
\r
485 are energy consuming, even for nodes that will not join the set cover to monitor
\r
490 \includegraphics[width=80mm]{Model.pdf}
\r
491 \caption{PeCO protocol.}
\r
495 We define two types of packets to be used by PeCO protocol:
\r
496 %\begin{enumerate}[(a)]
\r
498 \item INFO packet: sent by each sensor node to all the nodes inside a same
\r
499 subregion for information exchange.
\r
500 \item ActiveSleep packet: sent by the leader to all the nodes in its subregion
\r
501 to transmit to them their respective status (stay Active or go Sleep) during
\r
506 Five status are possible for a sensor node in the network:
\r
507 %\begin{enumerate}[(a)]
\r
509 \item LISTENING: waits for a decision (to be active or not);
\r
510 \item COMPUTATION: executes the optimization algorithm as leader to
\r
511 determine the activities scheduling;
\r
512 \item ACTIVE: node is sensing;
\r
513 \item SLEEP: node is turned off;
\r
514 \item COMMUNICATION: transmits or receives packets.
\r
517 %Below, we describe each phase in more details.
\r
519 \subsection{PeCO Protocol Algorithm}
\r
521 \noindent The pseudocode implementing the protocol on a node is given below.
\r
522 More precisely, Algorithm~\ref{alg:PeCO} gives a brief description of the
\r
523 protocol applied by a sensor node $s_k$ where $k$ is the node index in the WSN.
\r
525 \begin{algorithm}[h!]
\r
526 % \KwIn{all the parameters related to information exchange}
\r
527 % \KwOut{$winer-node$ (: the id of the winner sensor node, which is the leader of current round)}
\r
529 %\emph{Initialize the sensor node and determine it's position and subregion} \;
\r
531 \If{ $RE_k \geq E_{th}$ }{
\r
532 \emph{$s_k.status$ = COMMUNICATION}\;
\r
533 \emph{Send $INFO()$ packet to other nodes in subregion}\;
\r
534 \emph{Wait $INFO()$ packet from other nodes in subregion}\;
\r
535 \emph{Update K.CurrentSize}\;
\r
536 \emph{LeaderID = Leader election}\;
\r
537 \If{$ s_k.ID = LeaderID $}{
\r
538 \emph{$s_k.status$ = COMPUTATION}\;
\r
540 \If{$ s_k.ID $ is Not previously selected as a Leader }{
\r
541 \emph{ Execute the perimeter coverage model}\;
\r
542 % \emph{ Determine the segment points using perimeter coverage model}\;
\r
545 \If{$ (s_k.ID $ is the same Previous Leader) And (K.CurrentSize = K.PreviousSize)}{
\r
547 \emph{ Use the same previous cover set for current sensing stage}\;
\r
550 \emph{Update $a^j_{ik}$; prepare data for IP~Algorithm}\;
\r
551 \emph{$\left\{\left(X_{1},\dots,X_{l},\dots,X_{K}\right)\right\}$ = Execute Integer Program Algorithm($K$)}\;
\r
552 \emph{K.PreviousSize = K.CurrentSize}\;
\r
555 \emph{$s_k.status$ = COMMUNICATION}\;
\r
556 \emph{Send $ActiveSleep()$ to each node $l$ in subregion}\;
\r
557 \emph{Update $RE_k $}\;
\r
560 \emph{$s_k.status$ = LISTENING}\;
\r
561 \emph{Wait $ActiveSleep()$ packet from the Leader}\;
\r
562 \emph{Update $RE_k $}\;
\r
565 \Else { Exclude $s_k$ from entering in the current sensing stage}
\r
566 \caption{PeCO($s_k$)}
\r
570 In this algorithm, K.CurrentSize and K.PreviousSize respectively represent the
\r
571 current number and the previous number of living nodes in the subnetwork of the
\r
572 subregion. Initially, the sensor node checks its remaining energy $RE_k$, which
\r
573 must be greater than a threshold $E_{th}$ in order to participate in the current
\r
574 period. Each sensor node determines its position and its subregion using an
\r
575 embedded GPS or a location discovery algorithm. After that, all the sensors
\r
576 collect position coordinates, remaining energy, sensor node ID, and the number
\r
577 of their one-hop live neighbors during the information exchange. The sensors
\r
578 inside a same region cooperate to elect a leader. The selection criteria for the
\r
579 leader, in order of priority, are: larger numbers of neighbors, larger remaining
\r
580 energy, and then in case of equality, larger index. Once chosen, the leader
\r
581 collects information to formulate and solve the integer program which allows to
\r
582 construct the set of active sensors in the sensing stage.
\r
584 %After the cooperation among the sensor nodes in the same subregion, the leader will be elected in distributed way, where each sensor node and based on it's information decide who is the leader. The selection criteria for the leader in order of priority are: larger number of neighbors, larger remaining energy, and then in case of equality, larger index. Thereafter, if the sensor node is leader, it will execute the perimeter-coverage model for each sensor in the subregion in order to determine the segment points which would be used in the next stage by the optimization algorithm of the PeCO protocol. Every sensor node is selected as a leader, it is executed the perimeter coverage model only one time during it's life in the network.
\r
586 % The leader has the responsibility of applying the integer program algorithm (see section~\ref{cp}), which provides a set of sensors planned to be active in the sensing stage. As leader, it will send an Active-Sleep packet to each sensor in the same subregion to inform it if it has to be active or not. On the contrary, if the sensor is not the leader, it will wait for the Active-Sleep packet to know its state for the sensing stage.
\r
588 \section{Perimeter-based Coverage Problem Formulation}
\r
591 \noindent In this section, the coverage model is mathematically formulated. We
\r
592 start with a description of the notations that will be used throughout the
\r
594 First, we have the following sets:
\r
596 \item $S$ represents the set of WSN sensor nodes;
\r
597 \item $A \subseteq S $ is the subset of alive sensors;
\r
598 \item $I_j$ designates the set of coverage intervals (CI) obtained for
\r
601 $I_j$ refers to the set of coverage intervals which have been defined according
\r
602 to the method introduced in subsection~\ref{CI}. For a coverage interval $i$,
\r
603 let $a^j_{ik}$ denotes the indicator function of whether sensor~$k$ is involved
\r
604 in coverage interval~$i$ of sensor~$j$, that is:
\r
606 a^j_{ik} = \left \{
\r
608 1 & \mbox{if sensor $k$ is involved in the } \\
\r
609 & \mbox{coverage interval $i$ of sensor $j$}, \\
\r
610 0 & \mbox{otherwise.}\\
\r
611 \end{array} \right.
\r
615 Note that $a^k_{ik}=1$ by definition of the interval.
\r
616 %, where the objective is to find the maximum number of non-disjoint sets of sensor nodes such that each set cover can assure the coverage for the whole region so as to extend the network lifetime in WSN. Our model uses the PCL~\cite{huang2005coverage} in order to optimize the lifetime coverage in each subregion.
\r
617 %We defined some parameters, which are related to our optimization model. In our model, we consider binary variables $X_{k}$, which determine the activation of sensor $k$ in the sensing round $k$. .
\r
618 Second, we define several binary and integer variables. Hence, each binary
\r
619 variable $X_{k}$ determines the activation of sensor $k$ in the sensing phase
\r
620 ($X_k=1$ if the sensor $k$ is active or 0 otherwise). $M^j_i$ is an integer
\r
621 variable which measures the undercoverage for the coverage interval $i$
\r
622 corresponding to sensor~$j$. In the same way, the overcoverage for the same
\r
623 coverage interval is given by the variable $V^j_i$.
\r
625 If we decide to sustain a level of coverage equal to $l$ all along the perimeter
\r
626 of sensor $j$, we have to ensure that at least $l$ sensors involved in each
\r
627 coverage interval $i \in I_j$ of sensor $j$ are active. According to the
\r
628 previous notations, the number of active sensors in the coverage interval $i$ of
\r
629 sensor $j$ is given by $\sum_{k \in A} a^j_{ik} X_k$. To extend the network
\r
630 lifetime, the objective is to activate a minimal number of sensors in each
\r
631 period to ensure the desired coverage level. As the number of alive sensors
\r
632 decreases, it becomes impossible to reach the desired level of coverage for all
\r
633 coverage intervals. Therefore we use variables $M^j_i$ and $V^j_i$ as a measure
\r
634 of the deviation between the desired number of active sensors in a coverage
\r
635 interval and the effective number. And we try to minimize these deviations,
\r
636 first to force the activation of a minimal number of sensors to ensure the
\r
637 desired coverage level, and if the desired level cannot be completely satisfied,
\r
638 to reach a coverage level as close as possible to the desired one.
\r
640 %A system of linear constraints is imposed to attempt to keep the coverage level in each coverage interval to within specified PCL. Since it is physically impossible to satisfy all constraints simultaneously, each constraint uses a variable to either record when the coverage level is achieved, or to record the deviation from the desired coverage level. These additional variables are embedded into an objective function to be minimized.
\r
642 %\noindent In this paper, let us define some parameters, which are used in our protocol.
\r
643 %the set of segment points is denoted by $I$, the set of all sensors in the network by $J$, and the set of alive sensors within $J$ by $K$.
\r
646 %\noindent \begin{equation}
\r
648 %\begin{array}{l l}
\r
649 % 1& \mbox{if sensor $k$ is active,} \\
\r
650 % 0 & \mbox{otherwise.}\\
\r
651 %\end{array} \right.
\r
656 %\noindent $M^j_i (undercoverage): $ integer value $\in \mathbb{N}$ for segment point $i$ of sensor $j$.
\r
658 %\noindent $V^j_i (overcoverage): $ integer value $\in \mathbb{N}$ for segment point $i$ of sensor $j$.
\r
660 Our coverage optimization problem can then be mathematically expressed as follows:
\r
662 \begin{equation} %\label{eq:ip2r}
\r
665 \min \sum_{j \in S} \sum_{i \in I_j} (\alpha^j_i ~ M^j_i + \beta^j_i ~ V^j_i )&\\
\r
666 \textrm{subject to :}&\\
\r
667 \sum_{k \in A} ( a^j_{ik} ~ X_{k}) + M^j_i \geq l \quad \forall i \in I_j, \forall j \in S\\
\r
669 \sum_{k \in A} ( a^j_{ik} ~ X_{k}) - V^j_i \leq l \quad \forall i \in I_j, \forall j \in S\\
\r
671 % \Theta_{p}\in \mathbb{N}, &\forall p \in P\\
\r
672 % U_{p} \in \{0,1\}, &\forall p \in P\\
\r
673 X_{k} \in \{0,1\}, \forall k \in A
\r
678 $\alpha^j_i$ and $\beta^j_i$ are nonnegative weights selected according to the
\r
679 relative importance of satisfying the associated level of coverage. For example,
\r
680 weights associated with coverage intervals of a specified part of a region may
\r
681 be given by a relatively larger magnitude than weights associated with another
\r
682 region. This kind of integer program is inspired from the model developed for
\r
683 brachytherapy treatment planning for optimizing dose distribution
\r
684 \cite{0031-9155-44-1-012}. The integer program must be solved by the leader in
\r
685 each subregion at the beginning of each sensing phase, whenever the environment
\r
686 has changed (new leader, death of some sensors). Note that the number of
\r
687 constraints in the model is constant (constraints of coverage expressed for all
\r
688 sensors), whereas the number of variables $X_k$ decreases over periods, since we
\r
689 consider only alive sensors (sensors with enough energy to be alive during one
\r
690 sensing phase) in the model.
\r
692 \section{Performance Evaluation and Analysis}
\r
693 \label{sec:Simulation Results and Analysis}
\r
694 %\noindent \subsection{Simulation Framework}
\r
696 \subsection{Simulation Settings}
\r
699 The WSN area of interest is supposed to be divided into 16~regular subregions
\r
700 and we use the same energy consumption than in our previous work~\cite{Idrees2}.
\r
701 Table~\ref{table3} gives the chosen parameters settings.
\r
704 \tbl{Relevant parameters for network initialization \label{table3}}{
\r
707 % used for centering table
\r
708 \begin{tabular}{c|c}
\r
709 % centered columns (4 columns)
\r
711 Parameter & Value \\ [0.5ex]
\r
714 % inserts single horizontal line
\r
715 Sensing field & $(50 \times 25)~m^2 $ \\
\r
717 WSN size & 100, 150, 200, 250, and 300~nodes \\
\r
719 Initial energy & in range 500-700~Joules \\
\r
721 Sensing period & duration of 60 minutes \\
\r
722 $E_{th}$ & 36~Joules\\
\r
725 $\alpha^j_i$ & 0.6 \\
\r
726 % [1ex] adds vertical space
\r
729 %inserts single line
\r
732 % is used to refer this table in the text
\r
734 To obtain experimental results which are relevant, simulations with five
\r
735 different node densities going from 100 to 300~nodes were performed considering
\r
736 each time 25~randomly generated networks. The nodes are deployed on a field of
\r
737 interest of $(50 \times 25)~m^2 $ in such a way that they cover the field with a
\r
738 high coverage ratio. Each node has an initial energy level, in Joules, which is
\r
739 randomly drawn in the interval $[500-700]$. If its energy provision reaches a
\r
740 value below the threshold $E_{th}=36$~Joules, the minimum energy needed for a
\r
741 node to stay active during one period, it will no more participate in the
\r
742 coverage task. This value corresponds to the energy needed by the sensing phase,
\r
743 obtained by multiplying the energy consumed in active state (9.72 mW) with the
\r
744 time in seconds for one period (3600 seconds), and adding the energy for the
\r
745 pre-sensing phases. According to the interval of initial energy, a sensor may
\r
746 be active during at most 20 periods.
\r
748 The values of $\alpha^j_i$ and $\beta^j_i$ have been chosen to ensure a good
\r
749 network coverage and a longer WSN lifetime. We have given a higher priority to
\r
750 the undercoverage (by setting the $\alpha^j_i$ with a larger value than
\r
751 $\beta^j_i$) so as to prevent the non-coverage for the interval~$i$ of the
\r
752 sensor~$j$. On the other hand, we have assigned to
\r
753 $\beta^j_i$ a value which is slightly lower so as to minimize the number of active sensor nodes which contribute
\r
754 in covering the interval.
\r
756 We introduce the following performance metrics to evaluate the efficiency of our
\r
759 %\begin{enumerate}[i)]
\r
761 \item {\bf Network Lifetime}: the lifetime is defined as the time elapsed until
\r
762 the coverage ratio falls below a fixed threshold. $Lifetime_{95}$ and
\r
763 $Lifetime_{50}$ denote, respectively, the amount of time during which is
\r
764 guaranteed a level of coverage greater than $95\%$ and $50\%$. The WSN can
\r
765 fulfill the expected monitoring task until all its nodes have depleted their
\r
766 energy or if the network is no more connected. This last condition is crucial
\r
767 because without network connectivity a sensor may not be able to send to a
\r
768 base station an event it has sensed.
\r
769 \item {\bf Coverage Ratio (CR)} : it measures how well the WSN is able to
\r
770 observe the area of interest. In our case, we discretized the sensor field as
\r
771 a regular grid, which yields the following equation:
\r
776 \mbox{CR}(\%) = \frac{\mbox{$n$}}{\mbox{$N$}} \times 100
\r
780 where $n$ is the number of covered grid points by active sensors of every
\r
781 subregions during the current sensing phase and $N$ is total number of grid
\r
782 points in the sensing field. In our simulations we have set a layout of
\r
783 $N~=~51~\times~26~=~1326$~grid points.
\r
784 \item {\bf Active Sensors Ratio (ASR)}: a major objective of our protocol is to
\r
785 activate as few nodes as possible, in order to minimize the communication
\r
786 overhead and maximize the WSN lifetime. The active sensors ratio is defined as
\r
791 \mbox{ASR}(\%) = \frac{\sum\limits_{r=1}^R \mbox{$|A_r^p|$}}{\mbox{$|S|$}} \times 100
\r
794 where $|A_r^p|$ is the number of active sensors in the subregion $r$ in the
\r
795 current sensing period~$p$, $|S|$ is the number of sensors in the network, and
\r
796 $R$ is the number of subregions.
\r
797 \item {\bf Energy Consumption (EC)}: energy consumption can be seen as the total
\r
798 energy consumed by the sensors during $Lifetime_{95}$ or $Lifetime_{50}$,
\r
799 divided by the number of periods. The value of EC is computed according to
\r
804 \mbox{EC} = \frac{\sum\limits_{p=1}^{P} \left( E^{\mbox{com}}_p+E^{\mbox{list}}_p+E^{\mbox{comp}}_p
\r
805 + E^{a}_p+E^{s}_p \right)}{P},
\r
808 where $P$ corresponds to the number of periods. The total energy consumed by
\r
809 the sensors comes through taking into consideration four main energy
\r
810 factors. The first one, denoted $E^{\scriptsize \mbox{com}}_p$, represents the
\r
811 energy consumption spent by all the nodes for wireless communications during
\r
812 period $p$. $E^{\scriptsize \mbox{list}}_p$, the next factor, corresponds to
\r
813 the energy consumed by the sensors in LISTENING status before receiving the
\r
814 decision to go active or sleep in period $p$. $E^{\scriptsize \mbox{comp}}_p$
\r
815 refers to the energy needed by all the leader nodes to solve the integer
\r
816 program during a period. Finally, $E^a_{p}$ and $E^s_{p}$ indicate the energy
\r
817 consumed by the WSN during the sensing phase (active and sleeping nodes).
\r
821 \subsection{Simulation Results}
\r
823 In order to assess and analyze the performance of our protocol we have
\r
824 implemented PeCO protocol in OMNeT++~\cite{varga} simulator. Besides PeCO, two
\r
825 other protocols, described in the next paragraph, will be evaluated for
\r
826 comparison purposes. The simulations were run on a DELL laptop with an Intel
\r
827 Core~i3~2370~M (2.4~GHz) processor (2 cores) whose MIPS (Million Instructions
\r
828 Per Second) rate is equal to 35330. To be consistent with the use of a sensor
\r
829 node based on Atmels AVR ATmega103L microcontroller (6~MHz) having a MIPS rate
\r
830 equal to 6, the original execution time on the laptop is multiplied by 2944.2
\r
831 $\left(\frac{35330}{2} \times \frac{1}{6} \right)$. The modeling language for
\r
832 Mathematical Programming (AMPL)~\cite{AMPL} is employed to generate the integer
\r
833 program instance in a standard format, which is then read and solved by the
\r
834 optimization solver GLPK (GNU linear Programming Kit available in the public
\r
835 domain) \cite{glpk} through a Branch-and-Bound method.
\r
837 As said previously, the PeCO is compared to three other approaches. The first
\r
838 one, called DESK, is a fully distributed coverage algorithm proposed by
\r
839 \cite{ChinhVu}. The second one, called GAF~\cite{xu2001geography}, consists in
\r
840 dividing the monitoring area into fixed squares. Then, during the decision
\r
841 phase, in each square, one sensor is chosen to remain active during the sensing
\r
842 phase. The last one, the DiLCO protocol~\cite{Idrees2}, is an improved version
\r
843 of a research work we presented in~\cite{idrees2014coverage}. Let us notice that
\r
844 PeCO and DiLCO protocols are based on the same framework. In particular, the
\r
845 choice for the simulations of a partitioning in 16~subregions was made because
\r
846 it corresponds to the configuration producing the best results for DiLCO. The
\r
847 protocols are distinguished from one another by the formulation of the integer
\r
848 program providing the set of sensors which have to be activated in each sensing
\r
849 phase. DiLCO protocol tries to satisfy the coverage of a set of primary points,
\r
850 whereas the PeCO protocol objective is to reach a desired level of coverage for each
\r
851 sensor perimeter. In our experimentations, we chose a level of coverage equal to
\r
854 \subsubsection{\bf Coverage Ratio}
\r
856 Figure~\ref{fig333} shows the average coverage ratio for 200 deployed nodes
\r
857 obtained with the four protocols. DESK, GAF, and DiLCO provide a slightly better
\r
858 coverage ratio with respectively 99.99\%, 99.91\%, and 99.02\%, compared to the 98.76\%
\r
859 produced by PeCO for the first periods. This is due to the fact that at the
\r
860 beginning the DiLCO protocol puts to sleep status more redundant sensors (which
\r
861 slightly decreases the coverage ratio), while the three other protocols activate
\r
862 more sensor nodes. Later, when the number of periods is beyond~70, it clearly
\r
863 appears that PeCO provides a better coverage ratio and keeps a coverage ratio
\r
864 greater than 50\% for longer periods (15 more compared to DiLCO, 40 more
\r
865 compared to DESK). The energy saved by PeCO in the early periods allows later a
\r
866 substantial increase of the coverage performance.
\r
871 \includegraphics[scale=0.5] {R/CR.eps}
\r
872 \caption{Coverage ratio for 200 deployed nodes.}
\r
876 %When the number of periods increases, coverage ratio produced by DESK and GAF protocols decreases. This is due to dead nodes. However, DiLCO protocol maintains almost a good coverage from the round 31 to the round 63 and it is close to PeCO protocol. The coverage ratio of PeCO protocol is better than other approaches from the period 64.
\r
878 %because the optimization algorithm used by PeCO has been optimized the lifetime coverage based on the perimeter coverage model, so it provided acceptable coverage for a larger number of periods and prolonging the network lifetime based on the perimeter of the sensor nodes in each subregion of WSN. Although some nodes are dead, sensor activity scheduling based optimization of PeCO selected another nodes to ensure the coverage of the area of interest. i.e. DiLCO-16 showed a good coverage in the beginning then PeCO, when the number of periods increases, the coverage ratio decreases due to died sensor nodes. Meanwhile, thanks to sensor activity scheduling based new optimization model, which is used by PeCO protocol to ensure a longer lifetime coverage in comparison with other approaches.
\r
881 \subsubsection{\bf Active Sensors Ratio}
\r
883 Having the less active sensor nodes in each period is essential to minimize the
\r
884 energy consumption and thus to maximize the network lifetime. Figure~\ref{fig444}
\r
885 shows the average active nodes ratio for 200 deployed nodes. We observe that
\r
886 DESK and GAF have 30.36 \% and 34.96 \% active nodes for the first fourteen
\r
887 rounds and DiLCO and PeCO protocols compete perfectly with only 17.92~\% and
\r
888 20.16~\% active nodes during the same time interval. As the number of periods
\r
889 increases, PeCO protocol has a lower number of active nodes in comparison with
\r
890 the three other approaches, while keeping a greater coverage ratio as shown in
\r
891 Figure \ref{fig333}.
\r
895 \includegraphics[scale=0.5]{R/ASR.eps}
\r
896 \caption{Active sensors ratio for 200 deployed nodes.}
\r
900 \subsubsection{\bf Energy Consumption}
\r
902 We studied the effect of the energy consumed by the WSN during the communication,
\r
903 computation, listening, active, and sleep status for different network densities
\r
904 and compared it for the four approaches. Figures~\ref{fig3EC}(a) and (b)
\r
905 illustrate the energy consumption for different network sizes and for
\r
906 $Lifetime95$ and $Lifetime50$. The results show that our PeCO protocol is the
\r
907 most competitive from the energy consumption point of view. As shown in both
\r
908 figures, PeCO consumes much less energy than the three other methods. One might
\r
909 think that the resolution of the integer program is too costly in energy, but
\r
910 the results show that it is very beneficial to lose a bit of time in the
\r
911 selection of sensors to activate. Indeed the optimization program allows to
\r
912 reduce significantly the number of active sensors and so the energy consumption
\r
913 while keeping a good coverage level.
\r
917 \begin{tabular}{@{}cr@{}}
\r
918 \includegraphics[scale=0.475]{R/EC95.eps} & \raisebox{2.75cm}{(a)} \\
\r
919 \includegraphics[scale=0.475]{R/EC50.eps} & \raisebox{2.75cm}{(b)}
\r
921 \caption{Energy consumption per period for (a)~$Lifetime_{95}$ and (b)~$Lifetime_{50}$.}
\r
925 %The optimization algorithm, which used by PeCO protocol, was improved the lifetime coverage efficiently based on the perimeter coverage model.
\r
927 %The other approaches have a high energy consumption due to activating a larger number of sensors. In fact, a distributed method on the subregions greatly reduces the number of communications and the time of listening so thanks to the partitioning of the initial network into several independent subnetworks.
\r
930 %\subsubsection{Execution Time}
\r
932 \subsubsection{\bf Network Lifetime}
\r
934 We observe the superiority of PeCO and DiLCO protocols in comparison with the
\r
935 two other approaches in prolonging the network lifetime. In
\r
936 Figures~\ref{fig3LT}(a) and (b), $Lifetime95$ and $Lifetime50$ are shown for
\r
937 different network sizes. As highlighted by these figures, the lifetime
\r
938 increases with the size of the network, and it is clearly largest for DiLCO
\r
939 and PeCO protocols. For instance, for a network of 300~sensors and coverage
\r
940 ratio greater than 50\%, we can see on Figure~\ref{fig3LT}(b) that the lifetime
\r
941 is about twice longer with PeCO compared to DESK protocol. The performance
\r
942 difference is more obvious in Figure~\ref{fig3LT}(b) than in
\r
943 Figure~\ref{fig3LT}(a) because the gain induced by our protocols increases with
\r
944 time, and the lifetime with a coverage of 50\% is far longer than with
\r
949 \begin{tabular}{@{}cr@{}}
\r
950 \includegraphics[scale=0.475]{R/LT95.eps} & \raisebox{2.75cm}{(a)} \\
\r
951 \includegraphics[scale=0.475]{R/LT50.eps} & \raisebox{2.75cm}{(b)}
\r
953 \caption{Network Lifetime for (a)~$Lifetime_{95}$ \\
\r
954 and (b)~$Lifetime_{50}$.}
\r
958 %By choosing the best suited nodes, for each period, by optimizing the coverage and lifetime of the network to cover the area of interest and by letting the other ones sleep in order to be used later in next rounds, PeCO protocol efficiently prolonged the network lifetime especially for a coverage ratio greater than $50 \%$, whilst it stayed very near to DiLCO-16 protocol for $95 \%$.
\r
960 Figure~\ref{figLTALL} compares the lifetime coverage of our protocols for
\r
961 different coverage ratios. We denote by Protocol/50, Protocol/80, Protocol/85,
\r
962 Protocol/90, and Protocol/95 the amount of time during which the network can
\r
963 satisfy an area coverage greater than $50\%$, $80\%$, $85\%$, $90\%$, and $95\%$
\r
964 respectively, where the term Protocol refers to DiLCO or PeCO. Indeed there are applications
\r
965 that do not require a 100\% coverage of the area to be monitored. PeCO might be
\r
966 an interesting method since it achieves a good balance between a high level
\r
967 coverage ratio and network lifetime. PeCO always outperforms DiLCO for the three
\r
968 lower coverage ratios, moreover the improvements grow with the network
\r
969 size. DiLCO is better for coverage ratios near 100\%, but in that case PeCO is
\r
970 not ineffective for the smallest network sizes.
\r
973 \centering \includegraphics[scale=0.5]{R/LTa.eps}
\r
974 \caption{Network lifetime for different coverage ratios.}
\r
978 %Comparison shows that PeCO protocol, which are used distributed optimization over the subregions, is the more relevance one for most coverage ratios and WSN sizes because it is robust to network disconnection during the network lifetime as well as it consume less energy in comparison with other approaches. PeCO protocol gave acceptable coverage ratio for a larger number of periods using new optimization algorithm that based on a perimeter coverage model. It also means that distributing the algorithm in each node and subdividing the sensing field into many subregions, which are managed independently and simultaneously, is the most relevant way to maximize the lifetime of a network.
\r
981 \section{Conclusion and Future Works}
\r
982 \label{sec:Conclusion and Future Works}
\r
984 In this paper we have studied the problem of Perimeter-based Coverage Optimization in
\r
985 WSNs. We have designed a new protocol, called Perimeter-based Coverage Optimization, which
\r
986 schedules nodes' activities (wake up and sleep stages) with the objective of
\r
987 maintaining a good coverage ratio while maximizing the network lifetime. This
\r
988 protocol is applied in a distributed way in regular subregions obtained after
\r
989 partitioning the area of interest in a preliminary step. It works in periods and
\r
990 is based on the resolution of an integer program to select the subset of sensors
\r
991 operating in active status for each period. Our work is original in so far as it
\r
992 proposes for the first time an integer program scheduling the activation of
\r
993 sensors based on their perimeter coverage level, instead of using a set of
\r
994 targets/points to be covered.
\r
996 %To cope with this problem, the area of interest is divided into a smaller subregions using divide-and-conquer method, and then a PeCO protocol for optimizing the lifetime coverage in each subregion. PeCO protocol combines two efficient techniques: network
\r
997 %leader election, which executes the perimeter coverage model (only one time), the optimization algorithm, and sending the schedule produced by the optimization algorithm to other nodes in the subregion ; the second, sensor activity scheduling based optimization in which a new lifetime coverage optimization model is proposed. The main challenges include how to select the most efficient leader in each subregion and the best schedule of sensor nodes that will optimize the network lifetime coverage
\r
998 %in the subregion.
\r
999 %The network lifetime coverage in each subregion is divided into
\r
1000 %periods, each period consists of four stages: (i) Information Exchange,
\r
1001 %(ii) Leader Election, (iii) a Decision based new optimization model in order to
\r
1002 %select the nodes remaining active for the last stage, and (iv) Sensing.
\r
1003 We have carried out several simulations to evaluate the proposed protocol. The
\r
1004 simulation results show that PeCO is more energy-efficient than other
\r
1005 approaches, with respect to lifetime, coverage ratio, active sensors ratio, and
\r
1006 energy consumption.
\r
1007 %Indeed, when dealing with large and dense WSNs, a distributed optimization approach on the subregions of WSN like the one we are proposed allows to reduce the difficulty of a single global optimization problem by partitioning it in many smaller problems, one per subregion, that can be solved more easily. We have identified different research directions that arise out of the work presented here.
\r
1008 We plan to extend our framework so that the schedules are planned for multiple
\r
1010 %in order to compute all active sensor schedules in only one step for many periods;
\r
1011 We also want to improve our integer program to take into account heterogeneous
\r
1012 sensors from both energy and node characteristics point of views.
\r
1013 %the third, we are investigating new optimization model based on the sensing range so as to maximize the lifetime coverage in WSN;
\r
1014 Finally, it would be interesting to implement our protocol using a
\r
1015 sensor-testbed to evaluate it in real world applications.
\r
1023 As a Ph.D. student, Ali Kadhum IDREES would like to gratefully
\r
1024 acknowledge the University of Babylon - IRAQ for financial support and Campus
\r
1025 France for the received support. This work is also partially funded by the Labex ACTION program (contract ANR-11-LABX-01-01).
\r
1026 %The authors would like to thank Dr. Maura Turolla of Telecom
\r
1027 %Italia for providing specifications about the application scenario.
\r
1031 \bibliographystyle{ACM-Reference-Format-Journals}
\r
1032 \bibliography{biblio}
\r
1033 % Sample .bib file with references that match those in
\r
1034 % the 'Specifications Document (V1.5)' as well containing
\r
1035 % 'legacy' bibs and bibs with 'alternate codings'.
\r
1036 % Gerry Murray - March 2012
\r
1039 \received{February 2015}{}{}
\r
1044 % End of v2-acmsmall-sample.tex (March 2012) - Gerry Murray, ACM
\r
