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

DOI10.1016/J.TCS.2017.07.024zbMath1379.68016OpenAlexW2744578615MaRDI QIDQ2410361

Wu-Hsiung Lin, Chiuyuan Chen, S. M. Lo, Yu-Chee Tseng

Publication date: 17 October 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.07.024

zbMATH Keywords

graph theorycoloringcommunication networkwireless sensor networkdata collection

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Distributed colorings for collision-free routing in sink-centric sensor networks
• Efficient corona training protocols for sensor networks
• ON THE PERFORMANCE OF HEURISTICS FOR BROADCAST SCHEDULING

This page was built for publication: Optimal coloring for data collection in tree-based wireless sensor networks