Gathering with Minimum Delay in Tree Sensor Networks

DOI10.1007/978-3-540-69355-0_22zbMath1143.68334OpenAlexW2132258040MaRDI QIDQ3511404

Adele A. Rescigno, Jean-Claude Bermond, Luisa Gargano

Publication date: 10 July 2008

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69355-0_22

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (3)

Round weighting problem and gathering in radio networks with symmetrical interference ⋮ Spanning trees with few branch vertices in graphs of bounded neighborhood diversity ⋮ Gathering with Minimum Delay in Tree Sensor Networks

Cites Work

• Gathering Algorithms on Paths Under Interference Constraints
• Gathering with Minimum Delay in Tree Sensor Networks
• Algorithmic Aspects of Wireless Sensor Networks
• Algorithmic Aspects of Wireless Sensor Networks
• Optimally Fast Data Gathering in Sensor Networks
• An Approximation Algorithm for the Wireless Gathering Problem

This page was built for publication: Gathering with Minimum Delay in Tree Sensor Networks