Socially Driven Joint Optimization of Communication, Caching, and Computing Resources in Vehicular Networks

To support multifarious vehicular applications, content sharing among vehicles or between vehicles and infrastructures can enable efficient service provisioning. In this work, we investigate joint communication, caching, and computing (3C) resource allocation to support efficient content sharing bet...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on wireless communications Vol. 21; no. 1; pp. 461 - 476
Main Authors Xu, Lianming, Yang, Zexuan, Wu, Huaqing, Zhang, Yanru, Wang, Yanhui, Wang, Li, Han, Zhu
Format Journal Article
LanguageEnglish
Published New York IEEE 01.01.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Algorithms
Caching
Communication
Complexity
Computation
computing (3C)
Contract theory
Contracts
Delays
Optimization
Provisioning
Quality of service
Resource allocation
Resource management
Social networking (online)
social networks
Vehicles
vehicular networks
Videos
Wireless communication
Online AccessGet full text

Cover

More Information
Summary:To support multifarious vehicular applications, content sharing among vehicles or between vehicles and infrastructures can enable efficient service provisioning. In this work, we investigate joint communication, caching, and computing (3C) resource allocation to support efficient content sharing between content providers (CPs) and content requesters (CRs) in vehicular networks. To tackle the high complexity of joint 3C resource allocation, we decouple the problem into a long-term content caching strategy to allocate caching resources plus a method for short-term CP-CR pairing and corresponding communication-computing resource allocation. Specifically, a popularity and social similarity (P-SS) based caching strategy is proposed by incorporating both physical and social information. As selfish CRs may refuse to reveal their quality of service (QoS) requirements to the CPs and lead to the information asymmetry, we adopt contract theory to allocate communication and computing resources for each potential CR-CP pair. We then propose a stable-matching based algorithm to match CPs and CRs for efficient content sharing. Simulation results verify that the proposed scheme can effectively solve the problem with low complexity.
ISSN:1536-1276
1558-2248
DOI:10.1109/TWC.2021.3096881