A node scheduling scheme for energy conservation in large wireless sensor networks

By Di Tian, Nicolas D. Georganas. Wireless Communications and Mobile Computing, 2003

301 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

ALARM-NET: Wireless Sensor Networks for Assisted-Living and Residential Monitoring (2006, background): “Many power management schemes in the literature save power using scheduling-based and/or sentry-based algorithms, often to maintain complete sensing coverage for unexpected events [22].”
A distributed coverage- and connectivity-centric technique for selecting active nodes in wireless sensor networks (2005, methodology): “We also present an integer linear programming model to solve the coverage-centric problem in a centralized manner.”
Differentiated surveillance for sensor networks (2003, background): “5.2 Related Work for Comparisons [18] and [22] are the first works to address the sensing coverage problem in sensor networks.”
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks (2003, background): “[ 14 ] schedules sensors for monitoring using a backo mechanism, where a sensor becomes o-dut y when its neighbors can monitor the areas it covers.”
Towards optimal sleep scheduling in sensor networks for rare-event detection (2005, background): “nodes to sleep while maintaining full coverage at a specified degree of redundancy [5], [6], [7], [8].”