Optimal gathering protocols on paths under interference constraints

DOI10.1016/j.disc.2008.04.037zbMath1176.90087OpenAlexW2134918076MaRDI QIDQ1045041

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

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.037

zbMATH Keywords

pathinterferencegathering algorithmsmulti-hop radio network

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items

Round weighting problem and gathering in radio networks with symmetrical interference ⋮ Optimal time data gathering in wireless networks with multidirectional antennas ⋮ The distributed wireless gathering problem ⋮ Data gathering and personalized broadcasting in radio grids with interference ⋮ GATHERING RADIO MESSAGES IN THE PATH ⋮ Optimal gathering in radio grids with interference

Cites Work

• Unnamed Item
• On the complexity of bandwidth allocation in radio networks
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• Fast broadcasting and gossiping in radio networks
• Gathering Algorithms on Paths Under Interference Constraints
• 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
• An Approximation Algorithm for the Wireless Gathering Problem