Optimal gathering in radio grids with interference

DOI10.1016/J.TCS.2012.07.021MaRDI QIDQ714836zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

interferencegatheringgridsradio communication

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

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

Cites work

• An approximation algorithm for the wireless gathering problem
• Data gathering in wireless networks
• On the complexity of bandwidth allocation in radio networks
• Optimal gathering protocols on paths under interference constraints
• Optimally Fast Data Gathering in Sensor Networks

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
• Round weighting problem and gathering in radio networks with symmetrical interference
• Conflict-Free Data Aggregation on a Square Grid When Transmission Distance is Not Less Than 3
• Gathering Algorithms on Paths Under Interference Constraints
• Gathering information in a graph

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)