Distributed multitarget probabilistic coverage control algorithm for wireless sensor networks
Journal article, Peer reviewed
MetadataShow full item record
Original versionTian, Y., Ou, Y., Reza Karimi, H., Liu, Y. T., & Han, J. Q. (2014). Distributed multitarget probabilistic coverage control algorithm for wireless sensor networks. Mathematical Problems in Engineering, 2014. doi: 10.1155/2014/421753 10.1155/2014/421753
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. © 2014 Ying Tian et al.
Published version of an article in the journal: Mathematical Problems in Engineering. Also available from the publisher at: http://dx.doi.org/10.1155/2014/421753