Minimum-latency aggregation scheduling in wireless sensor network
From MaRDI portal
Publication:5963622
DOI10.1007/S10878-014-9748-7zbMATH Open1332.90110OpenAlexW1971307840MaRDI QIDQ5963622FDOQ5963622
Longjiang Guo, Zhipeng Cai, Yingshu Li
Publication date: 23 February 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9748-7
Recommendations
- Layer-based data aggregation and performance analysis in wireless sensor networks
- Minimum-time aggregation scheduling in duty-cycled wireless sensor networks
- Improved algorithm for minimum data aggregation time problem in wireless sensor networks
- An improved distributed data aggregation scheduling in wireless sensor networks
- Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks
Deterministic scheduling theory in operations research (90B35) Communication networks in operations research (90B18)
Cites Work
Cited In (3)
- Metric and Distributed On-Line Algorithm for Minimizing Routing Interference in Wireless Sensor Networks
- OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks
- Improved algorithm for broadcast scheduling of minimal latency in wireless ad hoc networks
Uses Software
This page was built for publication: Minimum-latency aggregation scheduling in wireless sensor network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963622)