Distributed time-optimal scheduling for convergecast in wireless sensor networks
From MaRDI portal
Publication:2474028
Recommendations
- The minimum scheduling time for convergecast in wireless sensor networks
- Time-optimum packet scheduling for many-to-one routing in wireless sensor networks
- Fast distributed algorithm for convergecast in ad hoc geometric radio networks
- Minimum-time aggregation scheduling in duty-cycled wireless sensor networks
- Tight analysis of shortest path convergecast in wireless sensor networks
Cited in
(12)- Time-optimum packet scheduling for many-to-one routing in wireless sensor networks
- Weighted total acquisition
- Minimum-time aggregation scheduling in duty-cycled wireless sensor networks
- Convergecast tree on temporal graphs
- The minimum scheduling time for convergecast in wireless sensor networks
- Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks
- Approximating All-to-All Broadcast in Wireless Networks
- Scheduling algorithms for tree-based data collection in wireless sensor networks
- Optimal multi-TDMA scheduling in ring topology networks
- Tight analysis of shortest path convergecast in wireless sensor networks
- Lower and upper bounds for deterministic convergecast with labeling schemes
- Hypergraph-based data link layer scheduling for reliable packet delivery in wireless sensing and control networks with end-to-end delay constraints
This page was built for publication: Distributed time-optimal scheduling for convergecast in wireless sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2474028)