In this article, we explore the fundamental limits of sensor network lifetime that all algorithms can possibly achieve. Specifically, under the assumptions that nodes are deployed as a Poisson point process with density λ in a square region with side length and each sensor can cover a unit-area disk, we first derive the necessary and sufficient condition of the node density in order to maintain complete k-coverage with probability approaching 1. With this result, we obtain that if λ = log 2 + (k + 2) log log 2 + c( ), c( ) → −∞, as → +∞, the sensor network lifetime (for maintaining complete coverage) is upper bounded by kT with probability approaching 1 as → +∞, where T is the lifetime of a single sensor. Second, we derive, given a fixed node density in a finite (but reasonably large) region, the upper bounds of lifetime when only α-portion of the region is covered at any time. We also carry out several sets of experiments to validate the derived theoretical results. Numerical results indicate that the derived upper bounds apply not only to networks of large sizes and homogeneous nodal distributions but also to small size networks with clustering nodal distributions.
In paper REF , Zhang and Hou derive a tight upper bound for α-lifetime, that is, at least α portion of the monitored region is covered during the working period.
On the upper bound of α-lifetime for large sensor networks
TOSN
Computer Science Mathematics