Coloring unstructured wireless multi-hop networks
From MaRDI portal
Publication:5170318
distributed algorithmsparallel algorithmssensor networkscoloringad hoc networkslocal algorithmsunit disk graphsgrowth bounded graphsbounded independence graphsunstructured radio networks
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15) Distributed algorithms (68W15)
Recommendations
- Coloring unstructured radio networks
- Distributed \((\varDelta + 1)\)-coloring in the physical model
- Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Simple Distributed Δ + 1 Coloring in the SINR Model
Cited in
(12)- An optimal maximal independent set algorithm for bounded-independence graphs
- Simple Distributed Δ + 1 Coloring in the SINR Model
- Nearly optimal local broadcasting in the SINR model with feedback
- Coloring unstructured radio networks
- Enabling minimal dominating set in highly dynamic distributed systems
- The backbone packet radio network coloring for time division multiple access link scheduling in wireless multihop networks
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Distributed \((\varDelta + 1)\)-coloring in the physical model
- Bounds on contention management algorithms
- Experimental evaluation of distributed node coloring algorithms for wireless networks
- Distributed backup placement
- Deploying wireless networks with beeps
This page was built for publication: Coloring unstructured wireless multi-hop networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5170318)
