Match!

Request Delay-Based Pricing for Proactive Caching: A Stackelberg Game Approach

Published on Jun 1, 2019in IEEE Transactions on Wireless Communications6.394
· DOI :10.1109/TWC.2019.2904261
Wei Huang2
Estimated H-index: 2
(THU: Tsinghua University),
Chen Wei26
Estimated H-index: 26
(THU: Tsinghua University),
H. Vincent Poor98
Estimated H-index: 98
(Princeton University)
Abstract
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.
  • References (34)
  • Citations (0)
📖 Papers frequently viewed together
2015
6 Authors (Bo Gu, ..., Yoshiaki Tanaka)
1 Citations
7 Citations
2016ICC: International Conference on Communications
4 Authors (Zhuoqun Chen, ..., Meixia Tao)
45 Citations
78% of Scinapse members use related papers. After signing in, all features are FREE.
References34
Newest
#1Yilong Hui (SHU: Shanghai University)H-Index: 7
#2Zhou Su (SHU: Shanghai University)H-Index: 23
Last. Jun Cai (UM: University of Manitoba)H-Index: 20
view all 4 authors...
Content dissemination, in particular, small-volume localized content dissemination, represents a killer application in vehicular networks, such as advertising distribution and road traffic alerts. The dissemination of contents in vehicular networks typically relies on the roadside infrastructure and moving vehicles to relay and propagate contents. Due to instinct challenges posed by the features of vehicles (mobility, selfishness, and routes) and limited communication ability of infrastructures,...
9 CitationsSource
Dec 1, 2018 in GLOBECOM (Global Communications Conference)
#1Wei Huang (THU: Tsinghua University)H-Index: 2
#2Wei Chen (THU: Tsinghua University)H-Index: 8
Last. H. Vincent Poor (Princeton University)H-Index: 98
view all 3 authors...
Proactively pushing content to users has emerged as a promising approach to improve the spectrum usage in off-peak times and reduce the peak data rate for fifth-generation (5G) mobile networks. However, owing to uncertainty of future user demands, base stations (BSs) may not receive payments for the pushed files. To motivate content pushing, economic incentives and user demand predictions become essential. Based on random content request delays of users, this paper studies the profit maximizatio...
1 CitationsSource
#1Zhou Su (SHU: Shanghai University)H-Index: 23
#2Yilong Hui (SHU: Shanghai University)H-Index: 7
Last. Tom H. Luan (Xidian University)H-Index: 3
view all 3 authors...
The autonomous vehicles (AVs), like that in knight rider, were completely a scientific fiction just a few years ago, but are now already practical with real-world commercial deployments. A salient challenge of AVs, however, is the intensive computing tasks to carry out on board for the real-time traffic detection and driving decision making; this imposes heavy load to AVs due to the limited computing power. To explore more computing power and enable scalable autonomous driving, in this paper, we...
17 CitationsSource
#1Wei Huang (THU: Tsinghua University)H-Index: 2
#2Chen Wei (THU: Tsinghua University)H-Index: 26
Last. H. Vincent Poor (Princeton University)H-Index: 98
view all 3 authors...
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...
3 CitationsSource
#1Zijie Zheng (PKU: Peking University)H-Index: 8
#2Lingyang Song (PKU: Peking University)H-Index: 44
Last. H. Vincent Poor (Princeton University)H-Index: 98
view all 5 authors...
Caching popular files in the storage of edge networks, namely edge caching, is a promising approach for service providers (SPs) to reduce redundant backhaul transmission to edge nodes (ENs). It is still an open problem to design an efficient incentive mechanism for edge caching in 5G networks with a large number of ENs and mobile users. In this paper, an edge network with one SP, a large number of ENs and mobile users with time-dependent requests is investigated. A convergent and scalable Stacke...
8 CitationsSource
#1Yawei Lu (THU: Tsinghua University)H-Index: 3
#2Chen Wei (THU: Tsinghua University)H-Index: 26
Last. H. Vincent Poor (Princeton University)H-Index: 98
view all 3 authors...
Multicasting can reduce network traffic in multiuser systems by serving multiple users simultaneously. The benefits of multicasting basically come from the overlapping and synchronism of user requests. Pushing and caching are techniques that prestore content items in buffers closer to users based on the prediction of user requests, thereby providing a promising approach to eliminating the asynchronism of user requests and creating multicasting opportunities. This paper studies a multiuser wirele...
11 CitationsSource
#1Hamed Shah-Mansouri (UBC: University of British Columbia)H-Index: 8
#2Vincent Wai Sum Wong (UBC: University of British Columbia)H-Index: 52
Last. Jianwei Huang (CUHK: The Chinese University of Hong Kong)H-Index: 47
view all 3 authors...
Mobile data offloading can help the mobile network operator (MNO) cope with the explosive growth of cellular traffic, by delivering mobile traffic through third-party access points. However, the access point owners (APOs) would need proper incentives to participate in data offloading. In this paper, we consider a data offloading market that includes both price-taking and price-setting APOs. We formulate the interactions among the MNO and these two types of APOs as a three-stage Stackelberg game,...
16 CitationsSource
#1Mingzhe Chen (Beijing University of Posts and Telecommunications)H-Index: 11
#2Walid Saad (VT: Virginia Tech)H-Index: 49
Last. Merouane Debbah (Université Paris-Saclay)H-Index: 70
view all 4 authors...
In this paper, the problem of proactive caching is studied for cloud radio access networks (CRANs). In the studied model, the baseband units (BBUs) can predict the content request distribution and mobility pattern of each user and determine which content to cache at remote radio heads and the BBUs. This problem is formulated as an optimization problem, which jointly incorporates backhaul and fronthaul loads and content caching. To solve this problem, an algorithm that combines the machine learni...
62 CitationsSource
#1Mohammad Hajimirsadeghi (RU: Rutgers University)H-Index: 5
#2Narayan B. Mandayam (RU: Rutgers University)H-Index: 46
Last. Alexander Reznik (HP: Hewlett-Packard)H-Index: 19
view all 3 authors...
We develop an analytical framework for distribution of popular content in an information centric network (ICN) that is comprised of access ICNs, a transit ICN, and a content provider. Using a generalized Zipf distribution to model content popularity, we devise a game theoretic approach to jointly determine caching and pricing strategies in such an ICN. Under the assumption that the caching cost of the access and transit ICNs is inversely proportional to popularity, we show that the Nash caching ...
47 CitationsSource
#1Chen Wei (Princeton University)H-Index: 26
#2H. Vincent Poor (Princeton University)H-Index: 98
Pushing along with proactive caching, in which content items are transmitted prior to being requested by a user, holds the promise of trading scalable storage resources for substantial throughput increase in content-centric networks. In this paper, a joint pushing and caching (JPC) method is studied, which determines when and which content to be pushed to, and to be removed from, the receiver buffer based on content request delay information (RDI) that predicts a user’s request time for certain ...
25 CitationsSource
Cited By0
Newest
#1Safa Mrad (Tunis University)H-Index: 1
#2Soumaya Hamouda (Carthage University)H-Index: 3
Source
#1Bouchaib Assila (Mohammed V University)H-Index: 1
#2Abdellatif Kobbane (Mohammed V University)H-Index: 10
Last. Jalel Ben-Othman (Sorbonne)H-Index: 16
view all 3 authors...
Source
#1Junfei Qiu (Ebor: University of York)H-Index: 1
#1Junfei QiuH-Index: 4
Last. Qihui WuH-Index: 25
view all 5 authors...
Unmanned aerial vehicles (UAVs) are envisioned to be widely deployed as an integral component in the next generation cellular networks, where spectrum sharing between the aerial and terrestrial communication systems will play an important role. However, there exist significant security and privacy challenges due to the untrusted broadcast features and wireless transmission of the UAV networks. This paper endeavors to resolve the security issues through proposing a novel privacy-preserving secure...
Source