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.

Abstract-We present an algorithm to dynamically allocate transmission power to maximize the throughput-utility in an interference-limited network under an instantaneous sum power constraint with time-varying channels. We consider the equivalent problem of maximum admission with queue stability constraint through Lyapunov optimization. The resultant non-convex minimization problem is solved by an online algorithm consisting of two components: first, successive convex approximations to randomly choose a local minimum, and second, a modified pickand-compare method for low-complexity convergence to a global minimum. We prove the optimality of this approach, derive its tradeoff between throughput-utility and delay, and demonstrate its performance advantage against existing methods.

No abstract

No abstract

No abstract