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

Shengfeng Xu,Gang Zhu,Zhangdui Zhong,Chao Shen,Yan Lei

doi:10.1186/1687-1499-2014-68

Abstract

AbstractIn 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.

Highlights

In recent years, high-speed trains are being deployed rapidly all over the world, serving as a fast, convenient and green public transportation system
Maximize the total utility at a base station under the average power constraint, the resource allocation optimization problem was formulated as an mixed-integer non-linear programming (MINLP) problem
With the help of integer constraint relaxation, the MINLP problem was simplified into a convex optimization problem

Summary

Introduction

High-speed trains are being deployed rapidly all over the world, serving as a fast, convenient and green public transportation system. The data transmission rate is highly determined by the transmit power and the distance between the base station and the train, which makes it feasible to implement power allocation along the time in HSR wireless networks [10]. We investigate the utility-based resource allocation problem at a base station in HSR wireless networks, jointly taking into account the power allocation along time and the packet allocation among services. The data transmission rate is highly determined by the transmit power and the distance between the base station and the train; the power allocation along the time has a large influence on transmission performance in HSR wireless networks. With the help of the utility function, we present a utility-based resource allocation framework in HSR wireless networks, which can jointly consider the power allocation along the time and packet allocation among services.

Problem formulation

Problem transformation

The greedy algorithm

Findings

Conclusion