Optimal time data gathering in wireless networks with multidirectional antennas
From MaRDI portal
(Redirected from Publication:392209)
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- An approximation algorithm for the wireless gathering problem
- Collision-free path coloring with application to minimum-delay gathering in sensor networks
- Data gathering in wireless networks
- Optimal gathering protocols on paths under interference constraints
Cited in
(7)- Spanning trees with few branch vertices in graphs of bounded neighborhood diversity
- Fast algorithm for multicast and data gathering in wireless networks
- Data gathering in wireless networks
- Gathering with Minimum Delay in Tree Sensor Networks
- Round weighting problem and gathering in radio networks with symmetrical interference
- Optimal coloring for data collection in tree-based wireless sensor networks
- An Approximation Algorithm for the Wireless Gathering Problem
This page was built for publication: Optimal time data gathering in wireless networks with multidirectional antennas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q392209)