Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Proceedings of the 8th annual international conference on Mobile computing and networking
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms
Proceedings of the 3rd international symposium on Information processing in sensor networks
On deriving the upper bound of α-lifetime for large sensor networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Power conservation and quality of surveillance in target tracking sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
On k-coverage in a mostly sleeping sensor network
Proceedings of the 10th annual international conference on Mobile computing and networking
IEEE Communications Magazine
Multiobjective K-connected deployment and power assignment in WSNs using constraint handling
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
Hi-index | 0.01 |
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network with n sensors deployed independently and uniformly in a square field of unit area. Each sensor is active with probability p, independently from others, and each active sensor can sense a disc area with radius rs. Moreover, considering the inherent irregularity of a sensor's sensing range caused by time-varying environments, we model the sensing radius rs as a random variable with mean r0 and variance r$_{\rm 0}^{\rm 2}$σ$_{s}^{\rm 2}$. Two active sensors can communicate with each other if and only if the distance between them is smaller than or equal to the communication radius rc. The key contributions of this paper are: (1) we introduce a new definition of a wireless sensor network's lifetime from a novel probabilistic perspective, called ω-lifetime (0 ≤ ω ≤ 1). It is defined as the expectation of the time interval during which the probability of guaranteeing connectivity and k-coverage simultaneously is at least ω; and (2) based on the analysis results, we propose a near-optimal scheduling algorithm, called PIS (Pre-planned Independent Sleeping), to achieve the network's maximum ω-lifetime, which is validated by simulation results, and present a possible implementation of the PIS scheme in the distributed manner.