TY - JOUR
T1 - Request delay-based pricing for proactive caching
T2 - A stackelberg game approach
AU - Huang, Wei
AU - Chen, Wei
AU - Poor, H. Vincent
N1 - Funding Information:
Manuscript received October 14, 2018; revised February 10, 2019; accepted February 21, 2019. Date of publication March 18, 2019; date of current version June 10, 2019. The work of W. Huang and W. Chen was supported in part by the National Natural Science Foundation of China under Grant 61671269, in part by the Beijing Natural Science Foundation under Grant 4191001, and in part by the National Program for Special Support of Eminent Professionals of China (10,000-Talent Program). The work of H. V. Poor was supported by the U.S. National Science Foundation under Grants CCF-0939370 and CCF-1513915. The associate editor coordinating the review of this paper and approving it for publication was K. Choi. (Corresponding author: Wei Chen.) W. Huang and W. Chen are with the Department of Electronic Engineering, Tsinghua University, Beijing 100084, China, and also with the Beijing National Research Center for Information Science and Technology, Tsinghua University, Beijing 100084, China (e-mail: huangw15@mails.tsinghua.edu.cn; wchen@tsinghua.edu.cn).
Publisher Copyright:
© 2002-2012 IEEE.
PY - 2019/6
Y1 - 2019/6
N2 - Proactively pushing content to users has emerged as a promising approach to improve the spectrum usage in off-peak times for fifth-generation mobile networks. However, owing to the uncertainty of future user demands, base stations (BSs) may not receive payments for the pushed files. To motivate content pushing, providing economic incentives to BSs becomes essential. Based on request delay information (RDI) that characterizes the users' request time for content files, this paper studies the profit maximization for a BS and a spectrum provider (SP) by developing a Stackelberg game. Specifically, the SP sets different selling prices of bandwidth for pushing and on-demand services, while the BS responds with the optimal quantity to purchase. In the game with non-causal RDI, a sub-gradient algorithm is presented to achieve a Stackelberg equilibrium (SE). For the game with statistical RDI, a closed-form expression is derived for an SE in the single-user scenario and a simulated annealing-based algorithm is designed to obtain an SE in the multi-user scenario. It is shown that the proposed games achieve greater profit for both the SP and the BS, compared with the on-demand scheme. Furthermore, pricing with statistical RDI attains performance closely approaching that with non-causal RDI, while being more practical.
AB - Proactively pushing content to users has emerged as a promising approach to improve the spectrum usage in off-peak times for fifth-generation mobile networks. However, owing to the uncertainty of future user demands, base stations (BSs) may not receive payments for the pushed files. To motivate content pushing, providing economic incentives to BSs becomes essential. Based on request delay information (RDI) that characterizes the users' request time for content files, this paper studies the profit maximization for a BS and a spectrum provider (SP) by developing a Stackelberg game. Specifically, the SP sets different selling prices of bandwidth for pushing and on-demand services, while the BS responds with the optimal quantity to purchase. In the game with non-causal RDI, a sub-gradient algorithm is presented to achieve a Stackelberg equilibrium (SE). For the game with statistical RDI, a closed-form expression is derived for an SE in the single-user scenario and a simulated annealing-based algorithm is designed to obtain an SE in the multi-user scenario. It is shown that the proposed games achieve greater profit for both the SP and the BS, compared with the on-demand scheme. Furthermore, pricing with statistical RDI attains performance closely approaching that with non-causal RDI, while being more practical.
KW - Content pushing
KW - Stackelberg game
KW - pricing
KW - request delay information
KW - spectrum market
UR - http://www.scopus.com/inward/record.url?scp=85067106219&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85067106219&partnerID=8YFLogxK
U2 - 10.1109/TWC.2019.2904261
DO - 10.1109/TWC.2019.2904261
M3 - Article
AN - SCOPUS:85067106219
SN - 1536-1276
VL - 18
SP - 2903
EP - 2918
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 6
M1 - 8668720
ER -