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 optimum can be obtained with probability one. The proposed algorithm dynamically adapts to traffic and channel fluctuations, it accommodates both instantaneous and average power constraints, and it obtains arbitrarily near-optimal sum utility of each user's average throughput. Simulation results demonstrate that the joint optimum can significantly outperform suboptimal alternatives.
A queue-weighted dynamic optimization algorithm using Lyapunov optimization approach was proposed in REF for the joint allocation of subframes, resource blocks, and power in the relay-based HetNets.
Dynamic Joint Resource Optimization for LTE-Advanced Relay Networks
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
Mathematics Computer Science