In this paper, 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 each 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 required to be covered at any time. We also carry out simulations to validate the derived results. Simulation results indicate that the derived upper bounds apply not only to networks of large areas but also to small-area networks.
For earlier studies, the work in REF shows the upper bound of the network lifespan when only -portion of the whole area is covered.
On deriving the upper bound of α-lifetime for large sensor networks
MobiHoc '04
Mathematics Computer Science