Gathering with Minimum Delay in Tree Sensor Networks

DOI10.1007/978-3-540-69355-0_22MaRDI QIDQ3511404zbMATH OpenOpenAlexFDO

Authors Jean-Claude Bermond, Adele A. Rescigno, 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)

Recommendations

• Optimal time data gathering in wireless networks with multidirectional antennas
• Collision-free path coloring with application to minimum-delay gathering in sensor networks
• Optimally Fast Data Gathering in Sensor Networks
• Data gathering in wireless networks
• Real-time data gathering in sensor networks

Cites work

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

Cited in

(9)

• Collision-free path coloring with application to minimum-delay gathering in sensor networks
• Optimal coloring for data collection in tree-based wireless sensor networks
• Round weighting problem and gathering in radio networks with symmetrical interference
• Gathering with Minimum Delay in Tree Sensor Networks
• Optimal time data gathering in wireless networks with multidirectional antennas
• Convergecast tree on temporal graphs
• Scheduling algorithms for tree-based data collection in wireless sensor networks
• Spanning trees with few branch vertices in graphs of bounded neighborhood diversity
• Spanning trees minimizing branching costs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511404)