Coloring unstructured wireless multi-hop networks
From MaRDI portal
ad hoc networksbounded independence graphscoloringdistributed algorithmsgrowth bounded graphslocal algorithmsparallel algorithmssensor networksunit disk graphsunstructured radio networks
Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Randomized algorithms (68W20)
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)- Distributed backup placement
- Coloring unstructured radio networks
- Simple Distributed Δ + 1 Coloring in the SINR Model
- Nearly optimal local broadcasting in the SINR model with feedback
- Deploying wireless networks with beeps
- The backbone packet radio network coloring for time division multiple access link scheduling in wireless multihop networks
- Enabling minimal dominating set in highly dynamic distributed systems
- Experimental evaluation of distributed node coloring algorithms for wireless networks
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Bounds on contention management algorithms
- Distributed \((\varDelta + 1)\)-coloring in the physical model
- An optimal maximal independent set algorithm for bounded-independence graphs
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)
