Conflict graphs and the SINR-capacity of the mean power scheme
From MaRDI portal
Publication:896135
Recommendations
- Conflict graphs and the capacity of the mean power scheme
- Wireless capacity with oblivious power in general metrics
- How well can graphs represent wireless interference?
- A constant-factor approximation for wireless capacity maximization with power control in the SINR model
- The price of local power control in wireless scheduling
Cites work
- A constant-factor approximation for wireless capacity maximization with power control in the SINR model
- Distributed contention resolution in wireless networks
- Lectures on analysis on metric spaces
- Oblivious interference scheduling
- On some bounds on the optimum schedule length in the SINR model
- Splitting digraphs
- The power of non-uniform wireless power
- Wireless Communication Is in APX
- Wireless capacity with oblivious power in general metrics
- Wireless scheduling with power control
Cited in
(5)- Beyond geometry: towards fully realistic wireless models
- Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model
- How well can graphs represent wireless interference?
- Conflict graphs and the capacity of the mean power scheme
- On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources
This page was built for publication: Conflict graphs and the SINR-capacity of the mean power scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896135)