Effective Wireless Scheduling via Hypergraph Sketches
From MaRDI portal
Recommendations
- On Some Distributed Scheduling Algorithms for Wireless Networks With Hypergraph Interference Models
- Practical scheduling schemes with throughput guarantees for multi-hop wireless networks
- Scheduling in wireless networks
- Approximation for a scheduling problem with application in wireless networks
- Universal framework for wireless scheduling problems
Cites work
- scientific article; zbMATH DE number 5318798 (Why is no real title available?)
- scientific article; zbMATH DE number 2065154 (Why is no real title available?)
- A constant-factor approximation for wireless capacity maximization with power control in the SINR model
- An efficient communication abstraction for dense wireless networks
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
- Approximation algorithms for intersection graphs
- Approximation algorithms for wireless link scheduling with flexible data rates
- Beyond geometry: towards fully realistic wireless models
- Coloring inductive graphs on-line
- Contention resolution on a fading channel
- Distributed contention resolution in wireless networks
- Dynamic packet scheduling in wireless networks
- Elimination graphs
- Fast Mixing of Parallel Glauber Dynamics and Low-Delay CSMA Scheduling
- Hardness of Low Delay Network Scheduling
- Improved algorithms for latency minimization in wireless networks
- Jamming-resistant learning in wireless networks
- Lectures on analysis on metric spaces
- Limitations of current wireless link scheduling algorithms
- On some bounds on the optimum schedule length in the SINR model
- Online capacity maximization in wireless networks
- Online independent set beyond the worst-case: secretaries, prophets, and periods
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
- The capacity of wireless networks
- The power of oblivious wireless power
- Vertex coloring edge-weighted digraphs
- Wireless capacity with oblivious power in general metrics
- Wireless connectivity and capacity
- Wireless scheduling with power control
- Zero knowledge and the chromatic number
Cited in
(8)- Hypergraph theory in wireless communication networks
- Universal framework for wireless scheduling problems
- How well can graphs represent wireless interference?
- Hypergraph modeling and approximation algorithms for the minimum length link scheduling in multiuser MIMO networks
- Conflict graphs and the capacity of the mean power scheme
- Efficiency of wireless networks: approximation algorithms for the physical interference model
- Limitations of current wireless link scheduling algorithms
- Practical scheduling schemes with throughput guarantees for multi-hop wireless networks
This page was built for publication: Effective Wireless Scheduling via Hypergraph Sketches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5858652)
