Collision-free path coloring with application to minimum-delay gathering in sensor networks

DOI10.1016/j.dam.2009.01.015zbMath1198.68181OpenAlexW2009769295MaRDI QIDQ1026148

Luisa Gargano, Adele A. Rescigno

Publication date: 24 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.dam.2009.01.015

zbMATH Keywords

timesensor networksdata gathering

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Round weighting problem and gathering in radio networks with symmetrical interference ⋮ A tight bound for conflict-free coloring in terms of distance to cluster ⋮ Optimal time data gathering in wireless networks with multidirectional antennas ⋮ Spanning trees with few branch vertices in graphs of bounded neighborhood diversity ⋮ Data gathering and personalized broadcasting in radio grids with interference ⋮ GATHERING RADIO MESSAGES IN THE PATH

Cites Work

• Unnamed Item
• Real-time data gathering in sensor networks
• Faster broadcasting in unknown radio networks
• Exact and approximate balanced data gathering in energy-constrained sensor networks
• Gathering Algorithms on Paths Under Interference Constraints
• Energy-Efficient Multihop Polling in Clusters of Two-Layered Heterogeneous Sensor Networks
• Algorithmic Aspects of Wireless Sensor Networks
• Principles of Distributed Systems
• An Approximation Algorithm for the Wireless Gathering Problem

This page was built for publication: Collision-free path coloring with application to minimum-delay gathering in sensor networks