Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Next century challenges: mobile networking for “Smart Dust”
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
On k-connectivity for a geometric random graph
Random Structures & Algorithms
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Proceedings of the 7th annual international conference on Mobile computing and networking
Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Proceedings of the 8th annual international conference on Mobile computing and networking
A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Lifetime analysis of a sensor network with hybrid automata modelling
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Connected sensor cover: self-organization of sensor networks for efficient query execution
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
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
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
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
Maximising α-lifetime for wireless sensor networks
International Journal of Sensor Networks
Monitoring schedules for randomly deployed sensor networks
Proceedings of the fifth international workshop on Foundations of mobile computing
Fault tolerance measures for large-scale wireless sensor networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
On the lifetime of wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Brief paper: Complete coverage and point coverage in randomly distributed sensor networks
Automatica (Journal of IFAC)
Lifetime Maximization Based on Coverage and Connectivity in Wireless Sensor Networks
Journal of Signal Processing Systems
International Journal of Sensor Networks
Connected partial target coverage and network lifetime in wireless sensor networks
WD'09 Proceedings of the 2nd IFIP conference on Wireless days
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
The balance of routing energy consumption in wireless sensor networks
Journal of Parallel and Distributed Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the lifetime of node-to-node communication in wireless ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Adaptive k-coverage contour evaluation and deployment in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 0.00 |
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)loglog ℓ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.