Optimal gathering protocols on paths under interference constraints
From MaRDI portal
Recommendations
Cites work
- An Approximation Algorithm for the Wireless Gathering Problem
- Centralized broadcast in multihop radio networks
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- Fast broadcasting and gossiping in radio networks
- Fast Gossiping by Short Messages
- Gathering Algorithms on Paths Under Interference Constraints
- scientific article; zbMATH DE number 2086637 (Why is no real title available?)
- Logarithmic inapproximability of the radio broadcast problem
- On the complexity of bandwidth allocation in radio networks
- Optimally Fast Data Gathering in Sensor Networks
Cited in
(10)- Round weighting problem and gathering in radio networks with symmetrical interference
- Minimizing flow time in the wireless gathering problem
- Gathering Algorithms on Paths Under Interference Constraints
- Optimal time data gathering in wireless networks with multidirectional antennas
- Data gathering and personalized broadcasting in radio grids with interference
- GATHERING RADIO MESSAGES IN THE PATH
- Optimal Information Gathering on the Internet with Time and Cost Constraints
- The distributed wireless gathering problem
- Gossiping with interference in radio ring networks
- Optimal gathering in radio grids with interference
This page was built for publication: Optimal gathering protocols on paths under interference constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045041)