TY - JOUR
T1 - Energy Efficient Pushing in AWGN Channels Based on Content Request Delay Information
AU - Huang, Wei
AU - Chen, Wei
AU - Poor, H. Vincent
N1 - Funding Information:
Manuscript received August 21, 2017; revised December 13, 2017 and January 30, 2018; accepted March 3, 2018. Date of publication March 15, 2018; date of current version August 14, 2018. This research was supported in part by the U. S. National Science Foundation under Grants CCF-1420575 and CNS-1702808, the National Natural Science Foundation of China under Grant Nos. 61671269 and 61621091, and the National 973 Program of China under Project No.2013CB336600. The associate editor coordinating the review of this paper and approving it for publication was J. Choi. (Corresponding author: Wei Chen.) W. Huang and W. Chen are with the Department of Electronic Engineering and Tsinghua National Laboratory for Information Science and Technology, Tsinghua University, Beijing 100084, China (e-mail: huangw15@mails.tsinghua.edu.cn; wchen@tsinghua.edu.cn).
Publisher Copyright:
© 1972-2012 IEEE.
PY - 2018/8
Y1 - 2018/8
N2 - Proactively pushing content to users has emerged as a promising technology to cope with the explosively growing traffic demands of next-generation mobile networks. Yet, it is unclear whether content pushing can improve the energy efficiency (EE) of delay-constrained communications. With pushing, the energy consumption can be reduced by extending transmission time. However, if the user never needs the pushed content, pushing may incur wasted energy. Based on the random content request delay, this paper studies the maximization of EE subject to a hard delay constraint in an additive white Gaussian noise channel with pushing. In the scenarios of fixed and variable transmit powers, we propose transmission policies to allocate power based on difference of convex functions programming and dynamic programming. Moreover, the lower and upper bounds on EE are derived, and the user request probability thresholds are provided to determine whether or not to push a file for these two cases. It is shown that the EE of systems with pushing can be significantly improved with increasing content request probability and target transmission rate, compared with the on-demand scheme. Furthermore, pushing with variable power is found to bring extra EE gain at the expense of computational complexity.
AB - Proactively pushing content to users has emerged as a promising technology to cope with the explosively growing traffic demands of next-generation mobile networks. Yet, it is unclear whether content pushing can improve the energy efficiency (EE) of delay-constrained communications. With pushing, the energy consumption can be reduced by extending transmission time. However, if the user never needs the pushed content, pushing may incur wasted energy. Based on the random content request delay, this paper studies the maximization of EE subject to a hard delay constraint in an additive white Gaussian noise channel with pushing. In the scenarios of fixed and variable transmit powers, we propose transmission policies to allocate power based on difference of convex functions programming and dynamic programming. Moreover, the lower and upper bounds on EE are derived, and the user request probability thresholds are provided to determine whether or not to push a file for these two cases. It is shown that the EE of systems with pushing can be significantly improved with increasing content request probability and target transmission rate, compared with the on-demand scheme. Furthermore, pushing with variable power is found to bring extra EE gain at the expense of computational complexity.
KW - Content pushing
KW - energy efficiency
KW - hard delay constraint
KW - power allocation
KW - random request delay
UR - http://www.scopus.com/inward/record.url?scp=85043754264&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85043754264&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2018.2816069
DO - 10.1109/TCOMM.2018.2816069
M3 - Article
AN - SCOPUS:85043754264
SN - 1558-0857
VL - 66
SP - 3667
EP - 3682
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 8
M1 - 8316880
ER -