The distributed wireless gathering problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 6469247 (Why is no real title available?)
- An approximation algorithm for the wireless gathering problem
- Maximum throughput of multiple access channels in adversarial environments
- Minimizing flow time in the wireless gathering problem
- Multiple Communication in Multihop Radio Networks
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Optimal gathering protocols on paths under interference constraints
- Optimal time-critical scheduling via resource augmentation
- Speed is as powerful as clairvoyance
- \textsc{Maximal Independent Sets} in radio networks
Cited in
(8)- An approximation algorithm for the wireless gathering problem
- Minimizing flow time in the wireless gathering problem
- Data gathering in wireless networks
- Minimizing flow time in the wireless gathering problem
- Optimal gathering in radio grids with interference
- Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model
- Deterministic distributed data aggregation under the SINR model
- The Distributed Wireless Gathering Problem
This page was built for publication: The distributed wireless gathering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q627160)