TY - GEN
T1 - An Incentivized Online Learning Approach for Context Information Caching and Sharing in V2X Networks
AU - Huang, Yuejiao
AU - Li, Xishuo
AU - Wang, Zhiyuan
AU - Zhang, Shan
AU - Luo, Hongbin
N1 - Publisher Copyright:
© 2022 IEEE.
PY - 2022
Y1 - 2022
N2 - Provisioning context information via vehicle-to-everything (V2X) networks can greatly enhance the context awareness and driving intelligence of vehicles. Considering the location-related interests, it is favorable to employ the cache-enabled vehicles for content sharing. In this work, we investigate how to incentivize the selfish vehicles to share their context information with the multi-dimensional imperfect information of content dynamics, requests, and cache costs. The incentivized interaction process between the Base Station (BS) and cache-enabled vehicles is modeled as an online learning problem from the BS aspect. Based on the reverse auction theorem, an incentivized online vehicle caching mechanism is proposed to ensure the vehicles' voluntary participation in edge services and maximize the social welfare (vehicle-offloaded traffic excluding the caching and sharing cost), which is proved to approach an idealistic performance with prior knowledge of reward of contents and cost of vehicle caching. Simulation results show that the proposed incentive method can enhance the social welfare by around 3X to 7X compared with the popularity based and random caching schemes.
AB - Provisioning context information via vehicle-to-everything (V2X) networks can greatly enhance the context awareness and driving intelligence of vehicles. Considering the location-related interests, it is favorable to employ the cache-enabled vehicles for content sharing. In this work, we investigate how to incentivize the selfish vehicles to share their context information with the multi-dimensional imperfect information of content dynamics, requests, and cache costs. The incentivized interaction process between the Base Station (BS) and cache-enabled vehicles is modeled as an online learning problem from the BS aspect. Based on the reverse auction theorem, an incentivized online vehicle caching mechanism is proposed to ensure the vehicles' voluntary participation in edge services and maximize the social welfare (vehicle-offloaded traffic excluding the caching and sharing cost), which is proved to approach an idealistic performance with prior knowledge of reward of contents and cost of vehicle caching. Simulation results show that the proposed incentive method can enhance the social welfare by around 3X to 7X compared with the popularity based and random caching schemes.
KW - Incentivized online learning
KW - V2X network
KW - context information sharing
KW - vehicle caching
UR - https://www.scopus.com/pages/publications/85141209668
U2 - 10.1109/ICCCWorkshops55477.2022.9896674
DO - 10.1109/ICCCWorkshops55477.2022.9896674
M3 - 会议稿件
AN - SCOPUS:85141209668
T3 - 2022 IEEE/CIC International Conference on Communications in China, ICCC Workshops 2022
SP - 428
EP - 433
BT - 2022 IEEE/CIC International Conference on Communications in China, ICCC Workshops 2022
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2022 IEEE/CIC International Conference on Communications in China, ICCC Workshops 2022
Y2 - 11 August 2022 through 13 August 2022
ER -