Optimal gathering in radio grids with interference
From MaRDI portal
Publication:714836
DOI10.1016/J.TCS.2012.07.021zbMATH Open1253.68028OpenAlexW2059986173MaRDI QIDQ714836FDOQ714836
Authors: Jean-Claude Bermond, Joseph G. Peters 
Publication date: 11 October 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.021
Recommendations
- Optimal gathering protocols on paths under interference constraints
- Data gathering and personalized broadcasting in radio grids with interference
- The Distributed Wireless Gathering Problem
- The distributed wireless gathering problem
- Gathering Algorithms on Paths Under Interference Constraints
- Round weighting problem and gathering in radio networks with symmetrical interference
- Efficient broadcasting in radio networks with long-range interference
Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)
Cites Work
Cited In (7)
- GATHERING RADIO MESSAGES IN THE PATH
- Optimal gathering protocols on paths under interference constraints
- Data gathering and personalized broadcasting in radio grids with interference
- Conflict-Free Data Aggregation on a Square Grid When Transmission Distance is Not Less Than 3
- Round weighting problem and gathering in radio networks with symmetrical interference
- Gathering information in a graph
- Gathering Algorithms on Paths Under Interference Constraints
This page was built for publication: Optimal gathering in radio grids with interference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714836)
