Utility-based resource allocation in high-speed railway wireless networks

In this paper, we investigate the utility-based resource allocation problem at a base station in high-speed railway (HSR) wireless networks, jointly taking into account the power allocation along the time and the packet allocation among services. The problem to maximize the total utility under the average power constraint is formulated as a mixed-integer non-linear programming (MINLP) problem. Through the integer constraint relaxation, the MINLP problem can be simplified into a convex optimization problem. The detailed analysis reveals that the relaxed problem can be equivalently decomposed into power allocation problem along the time and packet allocation problem among services, which can reduce the problem size. When the optimality of the relaxed problem is achieved, the power allocation along the time and the packet allocation along the time for each service are both proportionally fair. Since the integer relaxation causes a non-integer solution not implementable in practice, a greedy algorithm is proposed to obtain a near-optimal integer solution of the MINLP problem. Finally, the performance of the proposed algorithm is analyzed by simulations under realistic conditions for HSR wireless networks.