The Distributed Wireless Gathering Problem

DOI10.1007/978-3-540-68880-8_9zbMath1143.68320OpenAlexW2158100355MaRDI QIDQ3511417

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

Publication date: 10 July 2008

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11590/381241

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (1)

The Distributed Wireless Gathering Problem

Cites Work

• Unnamed Item
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Adversarial queuing theory
• Universal-stability results and performance bounds for greedy contention-resolution protocols
• Multiple Communication in Multihop Radio Networks
• The Distributed Wireless Gathering Problem
• Multi-processor scheduling to minimize flow time with ε resource augmentation
• Speed is as powerful as clairvoyance
• Analysis of Backoff Protocols for Multiple Access Channels
• Maximal independent sets in radio networks
• An Approximation Algorithm for the Wireless Gathering Problem

This page was built for publication: The Distributed Wireless Gathering Problem