K-Coverage Reliability Evaluation for Wireless Sensor Networks Using 2 Dimensional k / r×s / m×n:F System

WSNs are widely used in many fields, therefore, the reliability evaluation of WSNs in specific scenarios is of great significance. An issue of reliability evaluation of targets tracking is addressed in this paper. A target traverses a region, and the traversing path is k-covered. However, due to fault, a sensor does not work sometimes. We evaluated the reliability of full k-coverage for a traversing path under the premise that nodes fail in a certain probability. Most of existing related work on k-coverage focus on the judgment of k-coverage and construction of k-coverage. No existing work has addressed the issue of evaluating the reliability of k-coverage. In this paper, when sensors are deployed deterministically, we use a 2-dimensional k/r×s/m×n:F system to describe above k-coverage problem. A recursive algorithm is proposed to calculate the k-coverage reliability for a path. The algorithm is illustrated by an example, and the result shows that it can effectively calculate the reliability of k-coverage for a traversing path.