TY - GEN
T1 - Queue-Aware energy-efficient scheduling and power allocation in small-cell networks with interference
AU - Wei, Hongxin
AU - Xiao, Limin
AU - Li, Yunzhou
AU - Zhou, Shidong
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016
Y1 - 2016
N2 - We investigate the problem of throughput-guaranteed energy saving for base stations in small-cell networks with universal frequency reuse. The objective function is to minimize the time average of total power expenditure in each slot over infinite horizon, while the data arrival rate is constrained in the mean rate stable region. We take advantage of both queue state information and channel state information to find the optimal strategy of user scheduling and power allocation, which consumes the least energy and causes the least inter-cell interference. According to Lyapunov optimization theory, the problem is formulated into a non-convex combinatorial optimization problem of dynamic user scheduling and power allocation in each slot. In general, the problem is NP-hard, so we devise a two-step heuristic algorithm to solve it. Simulation results show that the performance of the proposed algorithm is close to exhaustive search algorithm, and better than Round Robin Algorithm and MaxWeight algorithm.
AB - We investigate the problem of throughput-guaranteed energy saving for base stations in small-cell networks with universal frequency reuse. The objective function is to minimize the time average of total power expenditure in each slot over infinite horizon, while the data arrival rate is constrained in the mean rate stable region. We take advantage of both queue state information and channel state information to find the optimal strategy of user scheduling and power allocation, which consumes the least energy and causes the least inter-cell interference. According to Lyapunov optimization theory, the problem is formulated into a non-convex combinatorial optimization problem of dynamic user scheduling and power allocation in each slot. In general, the problem is NP-hard, so we devise a two-step heuristic algorithm to solve it. Simulation results show that the performance of the proposed algorithm is close to exhaustive search algorithm, and better than Round Robin Algorithm and MaxWeight algorithm.
UR - https://www.scopus.com/pages/publications/84989939581
U2 - 10.1109/WCNC.2016.7565102
DO - 10.1109/WCNC.2016.7565102
M3 - 会议稿件
AN - SCOPUS:84989939581
T3 - IEEE Wireless Communications and Networking Conference, WCNC
BT - 2016 IEEE Wireless Communications and Networking Conference, WCNC 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2016 IEEE Wireless Communications and Networking Conference, WCNC 2016
Y2 - 3 April 2016 through 7 April 2016
ER -