2020
DOI: 10.1109/tcomm.2020.3009369
|View full text |Cite
|
Sign up to set email alerts
|

Decentralized User Scheduling for Rate-Constrained Sum-Utility Maximization in the MIMO IBC

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 47 publications
0
2
0
Order By: Relevance
“…Other works, such as [20], [21], have focused on the sum-energy efficiency maximization problem, that consists in minimizing the energy consumption per transmitted bit. The weighted sum-rate maximization problem with QoS guarantees was considered in [22]- [24]. In [22] the authors proposed centralized and distributed solutions based on successive convex approximation (SCA), difference of convex functions program (DCP) and Lagrangian relaxation.…”
Section: Trafficmentioning
confidence: 99%
See 1 more Smart Citation
“…Other works, such as [20], [21], have focused on the sum-energy efficiency maximization problem, that consists in minimizing the energy consumption per transmitted bit. The weighted sum-rate maximization problem with QoS guarantees was considered in [22]- [24]. In [22] the authors proposed centralized and distributed solutions based on successive convex approximation (SCA), difference of convex functions program (DCP) and Lagrangian relaxation.…”
Section: Trafficmentioning
confidence: 99%
“…In [22] the authors proposed centralized and distributed solutions based on successive convex approximation (SCA), difference of convex functions program (DCP) and Lagrangian relaxation. Centralized, semidistributed and distributed solutions were proposed in [23], [24] based on the BB method, geometric programming and second-order cone programming (SOCP), SCA and DCP.…”
Section: Trafficmentioning
confidence: 99%