Open AccessResource allocation in small cell networks with time‐averaged rate constraints
Author(s) -
Guo Yashuang,
Yang Qinghai,
Liu Jiayi,
Kwak Kyung Sup
Publication year - 2016
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2016.0018
Subject(s) - computer science , subcarrier , mathematical optimization , resource allocation , heuristic , constraint (computer aided design) , base station , time complexity , power (physics) , wireless , wireless network , small cell , channel (broadcasting) , algorithm , computer network , mathematics , orthogonal frequency division multiplexing , telecommunications , quantum mechanics , physics , geometry
This work is motivated by the following observation: modern wireless applications such as content prefetching, allow different extent of delay tolerance, thus in practice users may have different time‐averaged data rates during a certain period of time. In this study, the authors consider resource allocation in small cell networks under time‐varying channels while each user has an individual time‐averaged rate requirement. Stochastic optimisation model is employed to minimise the time‐averaged power consumption of small base stations subject to individual user's time‐averaged rate constraint. They develop an online power optimal resource allocation (PORA) algorithm to achieve the optimal power allocation and subcarrier assignment decisions without prior knowledge of channel statistics. Furthermore, considering that the power allocation and subcarrier assignment problem is a nonconvex combinatorial problem, they further develop an iterative heuristic algorithm with polynomial complexity. Simulation results show the effectiveness of PORA and verify the theoretical analysis on the network performance.