Optimal wake-up scheduling of data gathering trees for wireless sensor networks
From MaRDI portal
Publication:433434
DOI10.1016/J.JPDC.2012.01.008zbMATH Open1242.68022OpenAlexW1970638910MaRDI QIDQ433434FDOQ433434
Authors: Ungjin Jang, Sunggu Lee, Sungjoo Yoo
Publication date: 13 July 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2012.01.008
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
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
Cited In (9)
- Delivery ratio-maximized wakeup scheduling for ultra-low duty-cycled wsns under real-time constraints
- Cost-Aware Activity Scheduling for Compressive Sleeping Wireless Sensor Networks
- Exact Algorithms for Maximum Lifetime Data-Gathering Tree in Wireless Sensor Networks
- Understanding optimal data gathering in the energy and latency domains of a wireless sensor network
- Heterogenous Quorum-Based Wake-Up Scheduling in Wireless Sensor Networks
- Title not available (Why is that?)
- Scheduling algorithms for tree-based data collection in wireless sensor networks
- Adaptive energy efficient sensor scheduling for wireless sensor networks
- Application of vertex subset degree preserving spanning trees in 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)