Gathering Algorithms on Paths Under Interference Constraints

DOI10.1007/11758471_14zbMath1183.90085OpenAlexW1604294455MaRDI QIDQ3434549

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

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

pathinterferencegatheringmulti-hop radio network

Mathematics Subject Classification ID

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

Related Items (5)

Gathering with Minimum Delay in Tree Sensor Networks ⋮ 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

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