Introduction to the Theory of Coverage Processes.

TL;DR: This article investigates connectivity based on the degree of sensing coverage by studying k-covered WSNs, and shows that the sensor spatial density to guarantee k-coverage of a convex field is proportional to k and inversely proportional to the sensing range of the sensors.

TL;DR: This paper addresses the problem of k-coverage in WSNs such that in each scheduling round, every location in a monitored field is covered by at least k active sensors while all active sensors are being connected.

TL;DR: In this paper, it was shown that the eventual coverage of (0, 1) d depends on the be-haviour of xP(ˆ>x) as x!1 as well as on whether d= 1 or d======2.

TL;DR: Two novel algorithms for individual sensor nodes to identify whether they are on the coverage boundary, i.e., the boundary of a coverage hole or network partition, are proposed, which are of high scalability and energy efficiency.