ABSTRACT
This chapter considers various concepts of coverage and connectivity and provides a survey of work on sensing and coverage and communication connectivity required to exfiltrate data to a gateway node in a static sensor network. It also considers the joint problem of scheduling sensors for coverage and information routing so as to maximize the network lifetime. A cover ensures that every point in the region of interest is within the sensing range of at least one sensor. The chapter discusses approaches, characteristics and assumptions of various coverage. It studies the problem of network lifetime maximization for quality of service-specific information retrieval for the reconstruction of a spatially correlated signal field in a wireless sensor network. The chapter derives an upper bound and shows that the performance of the suboptimal design is close to a derived upper bound. An upper bound is derived for the network lifetime, and suboptimal greedy algorithms are shown to perform close to the upper bound.
