WSN sensing coverage based on correlation

The coverage problem is one of the most concerns in Wireless Sensor Networks (WSN). Many coverage algorithms are found in literature suppose that nodes are localizable or rely on a specific probability distribution to be located. In this paper, we assume that the nodes are randomly distributed, and their location is unknown. A new test for hole detection in the coverage of a domain is presented and illustrated through an example. Our method is based on the variance estimation of the field to be sensed, considered as a Gaussian process as well as on a translation of this variance into a simplicial complex. Topological characteristics are then computed on this complex to detect coverage holes.