Wireless scheduling with power control
From MaRDI portal
Online algorithms; streaming algorithms (68W27) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)
Recommendations
- Wireless Scheduling with Power Control
- Algorithms for scheduling with power control in wireless networks
- Wireless Link Scheduling With Power Control and SINR Constraints
- Scheduling in wireless networks
- scientific article; zbMATH DE number 5209969
- The price of local power control in wireless scheduling
- Scheduling broadcasts in wireless networks
- scientific article; zbMATH DE number 1670667
Cited in
(36)- Wireless Communication Is in APX
- Online capacity maximization in wireless networks
- Approximation and Online Algorithms
- Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs
- Effective Wireless Scheduling via Hypergraph Sketches
- Distributed wireless link scheduling in the SINR model
- Oblivious interference scheduling
- Broadcast scheduling problem in SINR model
- Improved Algorithms for Latency Minimization in Wireless Networks
- Universal framework for wireless scheduling problems
- Scheduling and power assignments in the physical model
- The power of oblivious wireless power
- Spanning trees with edge conflicts and wireless connectivity
- Comparative study of approximation algorithms and heuristics for SINR scheduling with power control
- Wireless capacity with arbitrary gain matrix
- How well can graphs represent wireless interference?
- Conflict graphs and the SINR-capacity of the mean power scheme
- Algorithms for scheduling with power control in wireless networks
- Approximation algorithms for wireless link scheduling with flexible data rates
- Exact formulations for the minimum interference problem in \(k\)-connected \textit{ad hoc} wireless networks
- Wireless capacity with oblivious power in general metrics
- A constant-factor approximation for wireless capacity maximization with power control in the SINR model
- The power of non-uniform wireless power
- An improved approximation algorithm for the shortest link scheduling in wireless networks under SINR and hypergraph models
- Convergence time of power-control dynamics
- Wireless Scheduling with Power Control
- On some bounds on the optimum schedule length in the SINR model
- A maximum clique based approximation algorithm for wireless link scheduling under SINR model
- Computing large independent sets in a single round
- The price of local power control in wireless scheduling
- Wireless connectivity and capacity
- Network design under general wireless interference
- Multi-channel assignment and link scheduling for prioritized latency-sensitive applications
- Efficiency of wireless networks: approximation algorithms for the physical interference model
- Limitations of current wireless link scheduling algorithms
- Wireless Link Scheduling With Power Control and SINR Constraints
This page was built for publication: Wireless scheduling with power control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933635)
