Optimal wake-up scheduling of data gathering trees for wireless sensor networks
From MaRDI portal
(Redirected from Publication:433434)
Recommendations
- Understanding optimal data gathering in the energy and latency domains of a wireless sensor network
- Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
- Minimum-latency aggregation scheduling in wireless sensor network
- Scheduling algorithms for tree-based data collection in wireless sensor networks
- Contribution to the optimization of data aggregation scheduling in wireless sensor networks
Cites work
Cited in
(11)- Delivery ratio-maximized wakeup scheduling for ultra-low duty-cycled wsns under real-time constraints
- Adaptive energy efficient sensor scheduling for wireless sensor networks
- scientific article; zbMATH DE number 1978166 (Why is no real title available?)
- Heterogenous Quorum-Based Wake-Up Scheduling in Wireless Sensor Networks
- Dynamic task scheduling for energy harvesting nodes in wireless sensor networks
- Energy-efficient optimal sub-sink selection for data collection in wireless sensor networks
- Understanding optimal data gathering in the energy and latency domains of a wireless sensor network
- Scheduling algorithms for tree-based data collection in wireless sensor networks
- Application of vertex subset degree preserving spanning trees in sensor networks
- Cost-Aware Activity Scheduling for Compressive Sleeping Wireless Sensor Networks
- Exact Algorithms for Maximum Lifetime Data-Gathering Tree in Wireless Sensor Networks
This page was built for publication: Optimal wake-up scheduling of data gathering trees for wireless sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q433434)