Radio aggregation scheduling
From MaRDI portal
Publication:2202004
Recommendations
- Approximation for a scheduling problem with application in wireless networks
- An approximation algorithm for the wireless gathering problem
- An Approximation Algorithm for the Wireless Gathering Problem
- Latency Constrained Aggregation in Chain Networks Admits a PTAS
- Constant-approximation for optimal data aggregation with physical interference
Cites work
- A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem
- A lower bound for radio broadcast
- Approximation Algorithms for Minimum-Time Broadcast
- Message Multicasting in Heterogeneous Networks
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Optimal deterministic broadcasting in known topology radio networks
- Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem
- Scheduling algorithms for tree-based data collection in wireless sensor networks
- Sublogarithmic approximation for telephone multicast
- Wireless connectivity and capacity
- Zero knowledge and the chromatic number
Cited in
(6)- Latency Constrained Aggregation in Chain Networks Admits a PTAS
- Approximation for a scheduling problem with application in wireless networks
- Spanning trees with edge conflicts and wireless connectivity
- Constant-approximation for optimal data aggregation with physical interference
- Conflict-Free Data Aggregation on a Square Grid When Transmission Distance is Not Less Than 3
- Network design under general wireless interference
This page was built for publication: Radio aggregation scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2202004)