GATHERING RADIO MESSAGES IN THE PATH
From MaRDI portal
Publication:4928335
DOI10.1142/S1793830913500043zbMath1267.90026OpenAlexW2126017076MaRDI QIDQ4928335
Stéphane Pérennes, Ralf Klasing, Patricio Reyes, Jean-Claude Bermond, Nelson Morales
Publication date: 11 June 2013
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830913500043
Related Items (1)
Cites Work
- Optimal gathering in radio grids with interference
- On the complexity of bandwidth allocation in radio networks
- An approximation algorithm for the wireless gathering problem
- Collision-free path coloring with application to minimum-delay gathering in sensor networks
- Optimal gathering protocols on paths under interference constraints
- Optimal sequential gossiping by short messages
- Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
- Fast broadcasting and gossiping in radio networks
- Data Gathering in Wireless Networks
- Fast Gossiping by Short Messages
- Centralized broadcast in multihop radio networks
- Logarithmic inapproximability of the radio broadcast problem
- Optimally Fast Data Gathering in Sensor Networks
This page was built for publication: GATHERING RADIO MESSAGES IN THE PATH