Algorithms for scheduling with power control in wireless networks
From MaRDI portal
Abstract: In this paper the problem of scheduling with power control in wireless networks is studied: given a set of communication requests, one needs to assign the powers of the network nodes, and schedule the transmissions so that they can be done in a minimum time, taking into account the signal interference of concurrently transmitting nodes. The signal interference is modeled by SINR constraints. Approximation algorithms are given for this problem, which use the mean power assignment. The problem of schduling with fixed mean power assignment is also considered, and approximation guarantees are proven.
Recommendations
Cited in
(11)- An efficient DCA based algorithm for power control in large scale wireless networks
- A joint solution to scheduling and power control for multicasting in wireless ad hoc networks
- Optimal scheduling and power allocation in wireless networks with heavy traffic
- Exact formulations for the minimum interference problem in \(k\)-connected \textit{ad hoc} wireless networks
- Broadcast scheduling problem in SINR model
- Wireless scheduling with power control
- Convergence time of power-control dynamics
- Wireless Link Scheduling With Power Control and SINR Constraints
- Wireless Scheduling with Power Control
- A constant-factor approximation for wireless capacity maximization with power control in the SINR model
- Comparative study of approximation algorithms and heuristics for SINR scheduling with power control
This page was built for publication: Algorithms for scheduling with power control in wireless networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999351)