## New Trends in Networked Control of Complex Dynamic Systems: Theories and Applications

View this Special IssueResearch Article | Open Access

Ying Tian, Yang Ou, Hamid Reza Karimi, Yan Tao Liu, Jian Qun Han, "Distributed Multitarget Probabilistic Coverage Control Algorithm for Wireless Sensor Networks", *Mathematical Problems in Engineering*, vol. 2014, Article ID 421753, 8 pages, 2014. https://doi.org/10.1155/2014/421753

# Distributed Multitarget Probabilistic Coverage Control Algorithm for Wireless Sensor Networks

**Academic Editor:**Xudong Zhao

#### Abstract

This paper is concerned with the problem of multitarget coverage based on probabilistic detection model. Coverage configuration is an effective method to alleviate the energy-limitation problem of sensors. Firstly, considering the attenuation of node’s sensing ability, the target probabilistic coverage problem is defined and formalized, which is based on Neyman-Peason probabilistic detection model. Secondly, in order to turn off redundant sensors, a simplified judging rule is derived, which makes the probabilistic coverage judgment execute on each node locally. Thirdly, a distributed node schedule scheme is proposed for implementing the distributed algorithm. Simulation results show that this algorithm is robust to the change of network size, and when compared with the physical coverage algorithm, it can effectively minimize the number of active sensors, which guarantees all the targets -covered.

#### 1. Introduction

Wireless sensor networks (WSNs) have attracted a great deal of attention. They are widely used in the fields of military affairs, intelligent family, environment surveillance and commercial management, and so on [1, 2]. However, many applications put on them lots of constraints that make issues in WSNs particularly challenging [3, 4]. Among them, the power constraint of sensor devices imposes many fundamental design limitations in WSNs. According to this problem, coverage control is one of the most effective ways on energy saving for energy-constrained WSNs [5–7], which can make the fewest sensors cover the sensing area or targets in the network.

Recently, many literatures focus on the coverage problems in WSNs. They are generally classified into three types [8]: the first one is the area coverage, where the objective is to cover an area [9–14]; the second one, which our paper also focuses on, is the target coverage, where the objective is to cover a set of targets [15–18]; the last is coverage problems that have the objective to determine the maximal support/breach path that traverses a sensor field [19]. In the first type, literatures [9–14] introduce different eligibility rules for the WSN based on the problem requirements, such as energy efficiency, area monitoring, and network connectivity. The network activity is organized in rounds, with sensors in the active set performing the area coverage, while all other sensors are in the sleep mode. Different techniques have been proposed to select which sensors will be active in the next round. According to the second type, literatures [15–18] present and develop the target problem. In literature [15], disjoint sensor sets are modeled as disjoint set covers, such that every cover completely monitors all the target points. The disjoint set cover problem [15] is reduced to a maximum flow problem, which is modeled as mixed integer programming. The problem is further extended in literature [16], where sensors are not restricted to participation in only disjoint sets; that is, a sensor can be active in more than one set. Furthermore, literature [17] develops the target coverage problem in [16]. In order to reduce both energy consumption and interference at the MAC layer, the sensing range of the active sensors in [17] can be reduced, while the coverage requirements are maintained. Literature [18] formalizes the -(connected) coverage set (-CCS/-CS) problems, develops a linear programming algorithm, and designs two nonglobal solutions for them. In the last type, a different coverage formulation is given in [19]. A path has the worst (best) coverage, if it has the property that. for any point on the path, the distance to the closest sensor is maximized (minimized). Among these papers mentioned above, the sensing range is a critical parameter, which determines the sensing ability of the sensor. In fact, with the increasing of sensing distance between the sensor and the target, the sensing ability of a sensor decays dramatically. We called this kind of sensing model probabilistic detection model. Literatures [13, 14] discuss the area coverage problem based on probabilistic detection model, but the objective of them focuses on area coverage problem. Most of literatures, such as [9–11, 15, 16, 18, 19], make the sensing range fixed. In these papers, a simplified circular sensing model is supposed which follows the yes/no binary detection model, called physical detection model. Obviously, the physical detection model does not obey the signal attenuation characteristic. The adjusted sensing range is adopted by literatures [12, 17], but the sensing ability is still fixed after the sensing range is adjusted.

In this paper we address the multitarget coverage problem based on probabilistic detection model; our contributions are as follows: based on Neyman-Peason probabilistic detection model, the multitarget probabilistic coverage problem is defined and formalized, the simplified probabilistic coverage judging rule is derived for the distributed coverage control of the network, and using the simplified judging rule, a distributed node schedule scheme is proposed, which not only minimizes the number of active sensors, but also guarantees all the targets monitored at the requirement of coverage probability.

The rest of this paper is organized into the following sections. In Section 2, the problem formulation and preliminaries are given. Section 3 presents the probabilistic coverage judging rule and the distributed coverage control algorithm. Section 4 simulates our algorithm and analyzes the simulation results. In Section 5, conclusions and further research directions are given.

#### 2. Problem Formulation and Preliminaries

In this paper, we deal with the multitarget coverage problem based on Neyman-Peason probabilistic detection model. The goal is to minimize the number of active sensors while guaranteeing that each target can be covered with the required coverage probability.

We consider a WSN consisting of large number of sensors and a set of targets deployed in the WSN region randomly. To reduce the energy consumption of network, we want to find the minimum number of active sensors with the property that each target is monitored by sensors around it with the required network coverage probability.

##### 2.1. Probabilistic Detection Model

We assume that sensors, , and targets, , are distributed randomly in the monitoring region, with location of the sensor, , , and location of the target , , . Then can make a measurement from the target by the following equation: where is the signal strength emitted by the target ; is the signal decay exponent, ; is the distance from the target to the sensor ; that is, . Assuming is the noise at sensor, , and follows a Gaussian distribution with zero mean, that is, .

For sensor , the binary hypothesis testing problem is presented as follows:

Assume that all the sensors use the same detection threshold to make a decision; based on Neyman-Peason detection rule, the relationship between threshold and the false alarm rate is given as follows: where is the complementary distribution function of the standard Gaussian; that is

The detection probability to by is where is the normal distribution function of the standard Gaussian; that is,

In WSN, many sensors are deployed in the monitoring region to detect the targets. Usually, a target in the monitoring region can be sensed by more than one sensor. The detection probability of by sensors, , , motivated by [20] is

The relationship of total detection probability and single detection probability with different number of active sensors is given in Figure 1.

From Figure 1, a target can be detected by three sensors in the same distance with the detection probability of while it can be detected by two sensors with the probability of . At the same condition, the target can be detected by single sensor at the probability of .

##### 2.2. Problem Definitions

*Definition 1. *Probabilistic Covered. Given targets and sensors randomly deployed in the target’s vicinity, if one target is detected by sensors together and the total detection probability is more than , that is, , then the target is -probabilistic covered or -probabilistic covered in more detail. For simplicity, we use the notations as -covered or -covered.

*Definition 2. *-Probabilistic Cover Radius. Assuming the required total detection probability is , there are sensors around one target, the distances between each sensor and the target are the same, denoted as . When these sensors working together, the target can be -covered. Then, the distance is the -Probabilistic Cover Radius.

*Remark 3. *From Definition 2, when and (7) is , then we can get

*Definition 4. *Probabilistic Cover Set. If a target can be -covered by working together with a set of sensors, denoted by , we can say is a probabilistic cover set of the target .

*Definition 5. *Basic Cover Set. If is a probabilistic cover set of the target, , and will not become the probabilistic cover set when any sensor in is not in active, then is the basic cover set of target .

#### 3. Multitarget Probabilistic Coverage Control Algorithm

In this section, we first propose a simplified judging rule which can make the sensor judge whether the target can be -covered easily; then we present a distributed node schedule scheme which can make the sensor decide whether it needs to be active locally or not, in order to minimize the number of active sensors, while guaranteeing that all the targets can be -covered.

##### 3.1. Probabilistic Coverage Judging Rule (PCJ-Rule)

The PCJ-Rule is proposed based on Neyman-Peason probabilistic detection model. In this paper, we assume that each sensor can obtain the distances between itself and the targets in its sensing range.

Theorem 6. *Suppose a target is around active sensors, , , and the distance between and is . If , then target must be -covered.*

*Proof. *Given the requested total detection probability is , then from Definition 2, we can obtain
Let
then is a monotonic increasing function about . From (7), (9), and (10), we get

Due to the mean value theorem, then
when , (13) is found.

Considering the fact that is a monotonic increasing function about , when , there must be ; therefore, we can obtain where is the average value of .

It is assumed in Theorem 6 that ; there must be , and we obtain that From (12), (14), and (15), we have where when , .

Form Theorem 6, a target can be judged whether it satisfied -covered or not. However, in order to reduce the amount of data transmission in the network and simplified calculation executed on each sensor, we proposed the PCJ-Rule which simplifies Theorem 6 further and makes the coverage judgment easily. The sensing distance between the sensor and the target can be quantified.

The method of quantification is presented as follows.

Assuming that sensors and targets are distributed randomly in the monitoring region, the distance between the sensor and the target is . We set the maximum number of nodes sensing together is ; then from Definition 2 and (8), we can calculate the values of . Because of the constraint of the actual sensing abilities of sensors, we can quantify the is smaller than ; that is, , as the quantification distance, notated as . In this paper, we consider the maximum sensing range as . Then we divided the range of , that is, , into quantification ranges as , ,, and the corresponding quantification values are ; then we have , where .

*Definition 7. *Quantification Coefficient. If a sensing distance can be quantified as , where , the quantification coefficient corresponding to is denoted by as follows:

Figure 2 shows an example with one target and four sensors with . The distances between and are ; after the quantification, we can get the quantification coefficients as follows:

*Definition 8. *Quantification Cover Set. If a sensor set is a cover set of target , the distances between and can be quantified as . If the distances between and are , we can say that the sensor set is the quantification cover set of .

*Remark 9. *From Definition 8, there must be , where .

Theorem 10. *Suppose is the quantification cover set of sensor set ; if a target can be -covered by , the target must be -covered by .*

*Proof. *Given is the quantification cover set of , where , the distances between and the target are , where , and the distances between and the target are . From the quantification method, the quantified distance can be obtained, where and .

As the assumption in Theorem 10 that a target can be -covered by , there must be ; then . Therefore, the target must be -covered by .

Corollary 11 (PCJ-Rule). *Suppose there is a target detected by active sensors together, and is the maximum allowable number of sensing nodes working on ; that is, ; the corresponding quantification coefficients are , where , and the number of nonzero is . If , then , and the target must be -covered.*

*Proof. *Given the distance between sensor, , where and target, , is , where , is the quantified value of , then . Form the Corollary 11, when , there must be more than quantification coefficients with , so we have the minimum with ; therefore, .

When , the corresponding quantified distance of the has , where . And when , the corresponding quantified distance of the has , . Because of , we have ; then . From Theorem 6, when , the target must be -covered by .

*Remark 12. *From the proof of Corollary 11, the condition is the sufficient condition for judging the target whether it satisfied -covered or not.

In our paper, through the information interaction between nodes, a sensor can receive quantification coefficients of the targets in its sensing range. Using Corollary 11, named PCJ-Rule, the sensor will calculate whether the target has been covered by other active sensors and then decide the state of itself in active or others.

##### 3.2. Distributed Node Schedule Scheme

In this section, we design a distributed node schedule scheme, which make the sensor decide the self-working state by local judgment.

The flow chart of the node schedule scheme executed by a sensor locally is shown in Figure 3. When the sensor runs the schedule scheme, there are three working states switched dynamically on each sensor, as shown in Figure 4. They are IDLE state, ACTIVE state, and SLEEP state.

From Figure 3, firstly, a sensor initializes the local information, including the number of targets in its sensing range and the distances between the node and the targets, where . And then, the node quantifies the sensing distances and calculates the quantification coefficients , where . Finally, the sensor sets the backoff time based on : where is the number of about the sensor ; , called backoff weighted coefficient, is weight of when , where . Therefore, the backoff time of is mainly decided by the quantification coefficients . For example, when , it means that the more a sensor can -cover the targets, the shorter the backoff time of .

After the initialization, if the sensor does not receive any message from the others during the backoff time, it will switch to the ACTIVE state and broadcast the ACTIVE-Msg messages to its neighbor sensors.

The data format of ACTIVE-Msg contains three fields: the local ID, targets’ ID in the sensing range of the sensor, and the coverage coefficients about the sensor and targets in its sensing range.

Before the step of “execute the PCJ-Rule” in Figure 3, the sensor should collect the ACTIVE-Msg messages from other active sensors to refresh the local coverage data. Then, based on the PCJ-Rule, the sensor will calculate the value of for each target to judge whether the target has been covered by other active sensors, where is the number of targets in the sensing range of . There are three cases of the judgment results described as follows.

*Case 1. *None of the targets can be -covered, and then the sensor will continue the backoff timer; the sensor is still in IDLE state.

*Case 2. *Some but not all of the targets can be -covered; then the sensor will set the , where is the local ID of sensor and is the ID of target which is -covered. The backoff time will be reset and restarted; the sensor is still in IDLE state.

*Case 3. *All of the targets are -covered; the sensor will be required to switch in SLEEP state, and then the sensor works with low energy consumption, which is still listening to the network for the reconfiguration.

At last of the node schedule scheme, the sensor will work in ACTIVE state or SLEEP state. However, the node schedule scheme can be executed when the topology of network changes. The sensor will return to the IDLE state when the network coverage needs to be reconfigured.

#### 4. Simulation Results and Analysis

In this section, we evaluate the performance of our distributed node schedule scheme. We simulate a stationary network with sensors and targets randomly deployed in a area. Confidently, all results in this section are from average of 20 runs. In the simulation, some parameters are listed as follows:(i)signal strength from the target ,(ii)standard deviation of noise in the channel ,(iii)signal decay exponent ,(iv)false alarm rate of Neyman-Peason detection rule ,(v)number of sensors varied between 200 and 800,(vi)number of targets varied between 100 and 400,(vii)maximum node number of sensing together which varies between and ,(viii)requirement probabilistic coverage probability which varies between and ,(ix)backoff weighted coefficient .

In Figure 5, the numbers of active nodes based on physical detection model and ours based on probabilistic model are compared. The same physical detection model is adopted by literatures [15, 16]; therefore, we call methods in [15, 16] as the physical coverage configuration. In physical detection model, when the target is in the sensing range, it will consider the target is covered, the same as [15, 16]. While, in our simulation, the sensing range of physical coverage is set as the 1-probabilistic cover radius, which means that we consider the physical coverage configuration as the special one of our probability coverage configuration which satisfies -covered. It is obvious that we relax the requirement of the physical coverage configuration. We set and . Figure 5 shows the following. Our algorithm saves about active nodes comparing with the physical coverage configuration. The number of active sensors that make the network satisfy the coverage requirement becomes smaller with the increasing , where is from 2 to 5. However, the number of active sensors decreases slowly when varies from 2 to 5. Meanwhile, if the bigger is chosen, there will be a need for more data transfer in network [3, 8]. Therefore, the suitable value of can make our algorithm the most efficient. Therefore, we choose in the next simulations. When the maximum number of sensors detects that one target together, that is, the parameter , is kept, the number of active sensors decreases slightly when the number of sensors deployed increases from 200 to 400, and then the number becomes stable in spite of the increasing of deployed number of sensors. It is because of the fact that when the density of sensors increases, the probability of the sensor deployed on the suitable location increases, where the sensor can make more contribution on sensing multitargets. Figure 5 shows that, in our algorithm, there are less than 40 active nodes required for monitoring all the targets in the WSN under our simulation environment, which is an effective method to save sensors’ energy and prolong the network lifetime.

In Figure 6, we compare the number of active sensors which make the network satisfy the -covered, when the number of targets is 200, 300, and 400. Obviously, the number of active sensors is stable when the target number is unchanged. In our simulation, there are about 38, 48, 52, and 55 active sensors needed when we deployed 100, 200, 300, and 400 targets in the network. When the number of targets increased from 100 to 200, there are about 10 active sensors added. And when the number becomes from 200 to 300, only 5 new active sensors increased. It means that the more targets in the network, the more efficiency of our algorithm. In fact, when the number of active sensors increases to the degree that any point in the network can be probabilistic covered, there will no longer need any new active sensor even though the number of targets is increasing in the network.

In Figure 7, our algorithms executed with the requirement detection probability as , , and are compared. We set the number of targets and . It is shown that more sensors are in active state when the requirement detection probability increases from to . From Figure 7, the number of active sensors is steady at 33 and 38 when the network is -covered and -covered; while , with the increasing of the deployed nodes’ number from 200 to 400, the number of active nodes decreases slightly and becomes stable at 42 active nodes at last. It is because of the fact that when , the network with less than 400 nodes cannot make all the targets -covered. At the same time, our algorithm turns off many sensors, which have no contribution to the uncovered targets even though they are in active state. This simulation also indicates that our algorithm can switch a large number of redundant sensors in SLEEP state on the premise of keeping the network coverage degree even though the coverage-hole exists in the network.

The simulation result can be summarized as follows. Our algorithm is robust with the increasing of network size; it needs only a few number of active sensors to guarantee all the targets monitored at the requirement coverage probability. Considering the amount of data transmission in the network, the efficiency of our algorithm can be improved by choosing the proper value of , where we set . Our algorithm will no longer need the new active sensors with the number of targets increasing, when the density of active sensors increases to the degree that any points in the network can be probabilistic covered. Our algorithm can turn off the redundant sensors on the premise of keeping the network coverage degree, even though the coverage-hole exists in the monitor region.

#### 5. Conclusion

In this paper, based on probabilistic detection model, we propose a distributed probabilistic coverage algorithm for the WSN with multiple static targets. The goal of our work is to find a simplified judging method, which can turn off the redundant sensors and guarantee all the targets covered by active sensors. In this paper, we define and formalize the target probabilistic coverage problems based on Neyman-Peason probabilistic detection model and propose a distributed node schedule scheme using the simplified judging rule. Simulation results show that our algorithm is robust to the change of network size. When compared with the physical coverage algorithm, the number of active sensors based on probabilistic detection model is smaller than that based on a physical one; at the same time, all the targets can be monitored at the requirement of network coverage probability.

In our future work, we will try to design a distributed and localized protocol that organizes the sensor nodes in disjoint set covers. By this way, the disjoint covers will work in turns, which can avoid sensors judging the local state frequently. Furthermore, we will integrate the sensor network connectivity requirement. The network connectivity is another important requirement of the network quantity of service (Qos), which makes the exchange of information between sensors easy.

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### References

- I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless sensor networks: a survey,”
*Computer Networks*, vol. 38, no. 4, pp. 393–422, 2002. View at: Publisher Site | Google Scholar - M. Cardei and J. Wu, “Coverage problems in wireless ad hoc sensor networks,” in
*Handbook of Sensor Networks*, M. Ilyas and I. Mahgoub, Eds., CRC Press, Boca Raton, Fla, USA, 2004. View at: Google Scholar - S. Yin, S. Ding, A. Haghani, and H. Hao, “Data-driven monitoring for stochastic systems and its application on batch process,”
*International Journal of Systems Science*, vol. 44, no. 7, pp. 1366–1376, 2013. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - S. Yin, S. Ding, A. Haghani, H. Hao, and P. Zhang, “A comparison study of basic data-driven fault diagnosis and process monitoring methods on the benchmark Tennessee Eastman process,”
*Journal of Process Control*, vol. 22, no. 9, pp. 1567–1581, 2012. View at: Publisher Site | Google Scholar - S. Yin, H. Luo, and S. Ding, “Real-time implementation of fault-tolerant control systems with performance optimization,”
*IEEE Transactions on Industrial Electronics*, vol. 64, no. 5, pp. 2402–2411, 2014. View at: Google Scholar - C.-F. Huang and Y.-C. Tseng, “A survey of solutions to the coverage problems in wireless sensor networks,”
*Journal of Internet Technology*, vol. 6, no. 1, pp. 1–8, 2005. View at: Google Scholar - M. Cardei and J. Wu, “Energy-efficient coverage problems in wireless ad-hoc sensor networks,”
*Computer Communications*, vol. 29, no. 4, pp. 413–420, 2006. View at: Publisher Site | Google Scholar - S. Yin, G. Wang, and H. Karimi, “Data-driven design of robust fault detection system for wind turbines,”
*Mechatronics*, 2013. View at: Publisher Site | Google Scholar - J. Carle and D. Simplot, “Energy-efficient area monitoring for sensor networks,”
*IEEE Computer*, vol. 37, no. 2, pp. 40–46, 2004. View at: Publisher Site | Google Scholar - D. Tian and N. D. Georganas, “A coverage-preserving node scheduling scheme for large wireless sensor networks,” in
*Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications (WSNA '02)*, pp. 32–41, Atlanta, Ga, USA, September 2002. View at: Publisher Site | Google Scholar - X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C. D. Gill, “Integrated coverage and connectivity configuration in wireless sensor networks,” in
*Proceedings of the 1st International Conference on Embedded Networked Sensor Systems (SenSys '03)*, pp. 28–39, Los Angeles, Calif, USA, November 2003. View at: Google Scholar - J. Wu and S. Yang, “Coverage and connectivity in sensor networks with adjustable ranges,” in
*Proceedings of the IEEE International Workshop on Mobile and Wireless Networking (MWN '04)*, Montreal, Canada, August 2004. View at: Google Scholar - J.-P. Sheu and H.-F. Lin, “Probabilistic coverage preserving protocol with energy efficiency in wireless sensor networks,” in
*Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC '07)*, pp. 2633–2638, Kowloon, China, March 2007. View at: Publisher Site | Google Scholar - Y. Tian, S.-F. Zhang, and Y. Wang, “Distributed probabilistic coverage-preserving configuration protocol for wireless sensor network,”
*Journal on Communications*, vol. 30, no. 1, pp. 70–75, 2009. View at: Google Scholar - M. Cardei and D.-Z. Du, “Improving wireless sensor network lifetime through power aware organization,”
*Wireless Networks*, vol. 11, no. 3, pp. 333–340, 2005. View at: Publisher Site | Google Scholar - M. Cardei, M. T. Thai, Y. Li, and W. Wu, “Energy-efficient target coverage in wireless sensor networks,” in
*Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM '05)*, vol. 3, pp. 1976–1984, Miami, Fla, USA, March 2005. View at: Publisher Site | Google Scholar - M. Cardei, J. Wu, M. Lu, and M. O. Pervaiz, “Maximum network lifetime in wireless sensor networks with adjustable sensing ranges,” in
*Proceedings of the IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob '05)*, vol. 3, pp. 438–445, Montreal, Canada, August 2005. View at: Publisher Site | Google Scholar - S. H. Yang, F. Dai, M. Cardei, J. Wu, and F. Patterson, “On connected multiple point coverage in wireless sensor networks,”
*International Journal of Wireless Information Networks*, vol. 13, no. 4, pp. 289–301, 2006. View at: Publisher Site | Google Scholar - S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. B. Srivastava, “Coverage problems in wireless ad-hoc sensor networks,” in
*Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE INFORM '01)*, pp. 1380–1387, Anchorage, Alaska, USA, April 2001. View at: Google Scholar - N. Ahmed, S. S. Kanhere, and S. Jha, “Probabilistic coverage in wireless sensor networks,” in
*Proceedings of the 30th Anniversary of the IEEE Conference on Local Computer Networks (LCN '05)*, pp. 672–681, Sydney, Australia, November 2005. View at: Publisher Site | Google Scholar

#### Copyright

Copyright © 2014 Ying Tian et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.