2016
DOI: 10.1109/jsac.2016.2600543
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Resource Allocation for Smart-Grid Powered MIMO Downlink Transmissions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
32
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 46 publications
(32 citation statements)
references
References 26 publications
0
32
0
Order By: Relevance
“…Defining the performance as in (6) in the constraint in (3) reflects a maximization with respect to the long term capacity experienced by the users. A constraint of the form u(r) ≥ 0 enforces a minimum average capacity for all users if u(r) := r − c min .…”
Section: A Examplesmentioning
confidence: 99%
“…Defining the performance as in (6) in the constraint in (3) reflects a maximization with respect to the long term capacity experienced by the users. A constraint of the form u(r) ≥ 0 enforces a minimum average capacity for all users if u(r) := r − c min .…”
Section: A Examplesmentioning
confidence: 99%
“…To solve the problem in [93], [94] over an infinite scheduling period by an online algorithm, Wang et al [97] rely on the stochastic subgradient method to obtain resource schedules "on-the-fly" by suppressing (decoupling) the time-coupling between the variables and constraints. The random variables are supposed to be i.i.d..…”
Section: B Distributed Schedulingmentioning
confidence: 99%
“…Using stochastically estimated Lagrange multipliers, this method updates the subgradients with their online approximations based on the instantaneous decision variables per time slot. It is proven in [97] that asymptotically optimal and feasible solutions can be achieved in no need of any prior knowledge of underlying randomnesses. The optimality gap diminishes when the iteration stepsize approaches zero.…”
Section: B Distributed Schedulingmentioning
confidence: 99%
See 1 more Smart Citation
“…In the aforementioned three cases, we are able to derive the closed-form expressions of the auxiliary variables ν k (t) that solve (16). For other concave non-decreasing utility functions, the closed-form solutions might not be available, standard convex solvers can be used to find the optimal solutions.…”
Section: ) Max-min Fairness (Mmf)mentioning
confidence: 99%