Distributed colorings for collision-free routing in sink-centric sensor networks

DOI10.1016/j.jda.2011.12.007zbMath1247.68029OpenAlexW1988701488MaRDI QIDQ450566

Andrea Formisano, Alfredo Navarra, Cristina M. Pinotti

Publication date: 13 September 2012

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2011.12.007

zbMATH Keywords

coloringcollisionroutingwireless sensor networkscombinatorial coloring problemleader-election mechanism

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Distributed systems (68M14)

Related Items (1)

Optimal coloring for data collection in tree-based wireless sensor networks

Cites Work

• Unnamed Item
• Efficient corona training protocols for sensor networks
• Collision-Free Routing in Sink-Centric Sensor Networks with Coarse-Grain Coordinates
• List Colouring Squares of Planar Graphs
• Coloring the square of a planar graph

This page was built for publication: Distributed colorings for collision-free routing in sink-centric sensor networks