2013
DOI: 10.1109/twc.2013.092513.121922
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Joint Resource Optimization for LTE-Advanced Relay Networks

Abstract: Abstract-A dynamic optimization algorithm is proposed for the joint allocation of subframes, resource blocks, and power in the Type 1 inband relaying scheme mandatory in the LTEAdvanced standard. Following the general framework of Lyapunov optimization, we decompose the original problem into three sub-problems in the forms of convex programming, linear programming, and mixed-integer programming. We solve the last sub-problem in the Lagrange dual domain, showing that it has zero duality gap, and that a primal o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
30
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 35 publications
(30 citation statements)
references
References 26 publications
0
30
0
Order By: Relevance
“…5. Comparisons of the energy efficiency of the network and each link among the NEP [16], [39], the MEP with Algorithms 1 and 2, the MEP with Algorithms 3 and 4, the rate adaptive [4], [5], the margin adaptive [6], [7], and the utility adaptive [8], [9] under K = 8 and N = 128 with P C k = 0.4 W, ξ k = 18 [37], R req k = 15 bits/s/Hz, and P max k = 0.2 W for all k. Note that Lk in the figure denotes the k-th link and this figure is plotted based on one random sample. Fig.…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…5. Comparisons of the energy efficiency of the network and each link among the NEP [16], [39], the MEP with Algorithms 1 and 2, the MEP with Algorithms 3 and 4, the rate adaptive [4], [5], the margin adaptive [6], [7], and the utility adaptive [8], [9] under K = 8 and N = 128 with P C k = 0.4 W, ξ k = 18 [37], R req k = 15 bits/s/Hz, and P max k = 0.2 W for all k. Note that Lk in the figure denotes the k-th link and this figure is plotted based on one random sample. Fig.…”
Section: Discussionmentioning
confidence: 99%
“…5 and 6, we provide performance comparisons among the six schemes, namely the NEP [16], [39], the MEP with Algorithms 1 and 2, the MEP with Algorithms 3 and 4, the rate adaptive [4], [5], the margin adaptive [6], [7], and the utility adaptive [8], [9], in terms of energy efficiency from different perspectives. Fig.…”
Section: Performance Comparisons Of the Mep And Other Existing Algmentioning
confidence: 99%
See 1 more Smart Citation
“…The Lyapunov optimization theory also has applications in the network layer traffic flow control when the exogenous arrival rates are outside of the network stability region. By incorporating the congestion control into the radio resource optimization using the lyapunov optimization technique, the delay-aware cross-layer algorithm is proposed in [114] to maintain the delay performance and maximize the throughput utility for LTE-A networks. The problem of EE-guaranteed throughput-delay tradeoff in interference-free C-RANs is investigated in [115] under a unified Lyapunov optimization framework, where simulation results demonstrate that the traffic flow control has the advantages of stabilizing traffic queues and reducing power consumption.…”
Section: B Dynamic Crra With Queue-awarenessmentioning
confidence: 99%
“…However, these works did not take the random traffic arrivals into consideration and assumed that the backlogs of traffic queues could be infinite. To adapt to the traffic and channel fluctuations dynamically and ensure the network stability, the dynamic joint allocation of frames, RB and power was investigated in [8] with the consideration of congestion control.…”
Section: Introductionmentioning
confidence: 99%