Next Article in Journal
Empirical Model of Radio Wave Propagation in the Presence of Vegetation inside Greenhouses Using Regularized Regressions
Next Article in Special Issue
A Novel GBSM for Non-Stationary V2V Channels Allowing 3D Velocity Variations
Previous Article in Journal
Remaining Useful Life Prognosis for Turbofan Engine Using Explainable Deep Neural Networks with Dimensionality Reduction
Article

A Stackelberg Game-Based Caching Incentive Scheme for Roadside Units in VANETs

School of Informatics, Xiamen University, Xiamen 361005, China
*
Author to whom correspondence should be addressed.
Sensors 2020, 20(22), 6625; https://doi.org/10.3390/s20226625
Received: 28 October 2020 / Revised: 17 November 2020 / Accepted: 18 November 2020 / Published: 19 November 2020
(This article belongs to the Special Issue Vehicle-to-Everything (V2X) Communications)
As a key technology of intelligent transportation systems (ITS), vehicular ad hoc networks (VANETs) have been promising to provide safety and infotainment for drivers and passengers. To support different applications about traffic safety, traffic efficiency, autonomous driving and entertainment, it is important to investigate how to effectively deliver content in VANETs. Since it takes resources such as bandwidth and power for base stations (BSs) or roadside units (RSUs) to deliver content, the optimal pricing strategy for BSs and the optimal caching incentive scheme for RSUs need to be studied. In this paper, a framework of content delivery is proposed first, where each moving vehicle can obtain small-volume content files from either the nearest BS or the nearest RSU according to the competition among them. Then, the profit models for both BSs and RSUs are established based on stochastic geometry and point processes theory. Next, a caching incentive scheme for RSUs based on Stackelberg game is proposed, where both competition sides (i.e., BSs and RSUs) can maximize their own profits. Besides, a backward introduction method is introduced to solve the Stackelberg equilibrium. Finally, the simulation results demonstrate that BSs can obtain their own optimal pricing strategy for maximizing the profit as well as RSUs can obtain the optimal caching scheme with the maximum profit during the content delivery. View Full-Text
Keywords: vehicular ad hoc networks; Stackelberg game; caching scheme; pricing strategy vehicular ad hoc networks; Stackelberg game; caching scheme; pricing strategy
Show Figures

Figure 1

MDPI and ACS Style

Wang, Y.; Lin, Y.; Chen, L.; Shi, J. A Stackelberg Game-Based Caching Incentive Scheme for Roadside Units in VANETs. Sensors 2020, 20, 6625. https://doi.org/10.3390/s20226625

AMA Style

Wang Y, Lin Y, Chen L, Shi J. A Stackelberg Game-Based Caching Incentive Scheme for Roadside Units in VANETs. Sensors. 2020; 20(22):6625. https://doi.org/10.3390/s20226625

Chicago/Turabian Style

Wang, Yang, Yuankun Lin, Lingyu Chen, and Jianghong Shi. 2020. "A Stackelberg Game-Based Caching Incentive Scheme for Roadside Units in VANETs" Sensors 20, no. 22: 6625. https://doi.org/10.3390/s20226625

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop