Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 421753, 8 pages
Research Article

Distributed Multitarget Probabilistic Coverage Control Algorithm for Wireless Sensor Networks

1College of Engineering, Bohai University, Jinzhou 121000, China
2College of Navigation, Dalian Maritime University, Dalian 116026, China
3Department of Engineering, Faculty of Engineering and Science, University of Agder, 4898 Grimstad, Norway

Received 23 December 2013; Accepted 13 January 2014; Published 4 March 2014

Academic Editor: Xudong Zhao

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.


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.