The distributed wireless gathering problem

DOI10.1016/J.TCS.2010.10.018zbMath1206.68031OpenAlexW4205413114MaRDI QIDQ627160

Alberto Marchetti-Spaccamela, Vincenzo Bonifaci, Peter Korteweg, Leen Stougie

Publication date: 21 February 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.10.018

zbMATH Keywords

wireless networksdistributed algorithmresource augmentationdata gathering

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• An approximation algorithm for the wireless gathering problem
• Optimal gathering protocols on paths under interference constraints
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Maximum throughput of multiple access channels in adversarial environments
• Multiple Communication in Multihop Radio Networks
• Minimizing flow time in the wireless gathering problem
• Speed is as powerful as clairvoyance
• Maximal independent sets in radio networks
• Optimal time-critical scheduling via resource augmentation

This page was built for publication: The distributed wireless gathering problem