Abstract: Sensing coverage is a fundamental problem in wireless sensor networks (WSNs), which has attracted considerable attention. Conventional research on this topic focuses on the 0/1 coverage model, which is only a coarse approximation to the practical sensing model. In this paper, we study the target coverage problem, where the objective is to find the least number of sensor nodes in randomly-deployed WSNs based on the probabilistic sensing model. We analyze the joint detection probability of target with multiple sensors. Based on the theoretical analysis of the detection probability, we formulate the minimum -detection coverage problem. We prove that the minimum -detection coverage problem is NP-hard and present an approximation algorithm called the Probabilistic Sensor Coverage Algorithm (PSCA) with provable approximation ratios. To evaluate our design, we analyze the performance of PSCA theoretically and also perform extensive simulations to demonstrate the effectiveness of our proposed algorithm.
The probabilistic sensors coverage algorithm (PSCA) with provable approximation ratios REF for the minimum -detection coverage problem aims to reduce the number of active sensors.
Target Coverage in Wireless Sensor Networks with Probabilistic Sensors
Sensors (Basel, Switzerland)
Sensors (Basel, Switzerland)
Engineering Medicine Computer Science