Gathering Algorithms on Paths Under Interference Constraints

DOI10.1007/11758471_14MaRDI QIDQ3434549zbMATH OpenOpenAlexFDO

Authors Jean-Claude Bermond, Ricardo C. Corrêa, Min-Li Yu

Publication date 2 May 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11758471_14

zbMATH Keywords

gatheringinterferencemulti-hop radio networkpath

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12) Communication networks in operations research (90B18)

Recommendations

• Optimal gathering protocols on paths under interference constraints
• GATHERING RADIO MESSAGES IN THE PATH
• Optimal gathering in radio grids with interference
• Data gathering in wireless networks
• Data gathering and personalized broadcasting in radio grids with interference

Cited in

(10)

• Collision-free path coloring with application to minimum-delay gathering in sensor networks
• Optimal gathering protocols on paths under interference constraints
• Resolving interferences of triple‐crossover‐cranes by determining paths in networks
• Round weighting problem and gathering in radio networks with symmetrical interference
• Data gathering in wireless networks
• Gathering with Minimum Delay in Tree Sensor Networks
• Data gathering and personalized broadcasting in radio grids with interference
• Optimal gathering in radio grids with interference
• On the complexity of bandwidth allocation in radio networks
• An approximation algorithm for the wireless gathering problem

This page was built for publication: Gathering Algorithms on Paths Under Interference Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434549)