Cluster based node scheduling method for wireless sensor networks
From MaRDI portal
Recommendations
- Distributed Computing – IWDC 2005
- Maximum lifetime coverage preserving scheduling algorithms in sensor networks
- Designing k-coverage schedules in wireless sensor networks
- Distributed multitarget probabilistic coverage control algorithm for wireless sensor networks
- ENERGY-EFFICIENT NODE SCHEDULING MODELS IN SENSOR NETWORKS WITH ADJUSTABLE RANGES
Cites work
Cited in
(10)- Maximum lifetime coverage preserving scheduling algorithms in sensor networks
- Localization and scheduling protocols for actor-centric sensor networks
- A dynamic \(N\) threshold prolong lifetime method for wireless sensor nodes
- A location-free algorithm of energy-efficient connected coverage for high density wireless sensor networks
- ENERGY-EFFICIENT NODE SCHEDULING MODELS IN SENSOR NETWORKS WITH ADJUSTABLE RANGES
- A dynamic scheduling method for industrial wireless sensor networks
- Distributed Computing – IWDC 2005
- Energy-aware node placement, topology control and MAC scheduling for wireless sensor networks
- Stochastic sleeping protocol based on energy and neighbor message in wireless sensor network
- Energy-efficient node scheduling algorithms for wireless sensor networks using Markov random field model
This page was built for publication: Cluster based node scheduling method for wireless sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439766)