Energy Efficient Pushing in AWGN Channels Based on Content Request Delay Information

Wei Huang, Wei Chen, H. Vincent Poor

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Article number8316880
Pages (from-to)3667-3682
Number of pages16
JournalIEEE Transactions on Communications
Volume66
Issue number8
DOIs
StatePublished - Aug 1 2018

Fingerprint

Energy efficiency
Dynamic programming
Computational complexity
Wireless networks
Energy utilization
Communication

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

@article{6c42731f09314bd2bbd9a21fe1f4ffa0,
title = "Energy Efficient Pushing in AWGN Channels Based on Content Request Delay Information",
abstract = "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.",
author = "Wei Huang and Wei Chen and Poor, {H. Vincent}",
year = "2018",
month = "8",
day = "1",
doi = "https://doi.org/10.1109/TCOMM.2018.2816069",
language = "English (US)",
volume = "66",
pages = "3667--3682",
journal = "IEEE Transactions on Communications",
issn = "0090-6778",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "8",

}

Energy Efficient Pushing in AWGN Channels Based on Content Request Delay Information. / Huang, Wei; Chen, Wei; Poor, H. Vincent.

In: IEEE Transactions on Communications, Vol. 66, No. 8, 8316880, 01.08.2018, p. 3667-3682.

Research output: Contribution to journalArticle

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

PY - 2018/8/1

Y1 - 2018/8/1

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.

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 - https://doi.org/10.1109/TCOMM.2018.2816069

DO - https://doi.org/10.1109/TCOMM.2018.2816069

M3 - Article

VL - 66

SP - 3667

EP - 3682

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0090-6778

IS - 8

M1 - 8316880

ER -