Coloring unstructured radio networks
- 30 August 2008
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 21 (4) , 271-284
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Energy-efficient communication protocol for wireless microsensor networks2005
- Bootstrapping a Hop-Optimal Network in the Weak Sensor ModelLecture Notes in Computer Science, 2005
- Contention-Free MAC Protocols for Wireless Sensor NetworksLecture Notes in Computer Science, 2004
- Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks2002
- Weak Communication in Radio NetworksLecture Notes in Computer Science, 2002
- The wakeup problem in synchronous broadcast systems (extended abstract)2000
- Parallel (Δ + 1)-coloring of constant-degree graphsInformation Processing Letters, 1987
- Parallel symmetry-breaking in sparse graphs1987
- On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization1987
- Deterministic coin tossing with applications to optimal parallel list rankingInformation and Control, 1986