Delay-Minimized Edge Caching in Heterogeneous Vehicular Networks: A Matching-Based Approach

• Published in: IEEE transactions on wireless communications Vol. 19; no. 10; pp. 6409 - 6424
• Main Authors: Wu, Huaqing, Chen, Jiayin, Xu, Wenchao, Cheng, Nan, Shi, Weisen, Wang, Li, Shen, Xuemin
• Format: Journal Article
• Language: English
• Published: New York IEEE 01-10-2020; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Ad hoc networks; Caching; Coding; Complexity theory; Delay; Delays; edge content caching; Encoding; fountain coding; Heterogeneous vehicular networks; Integer programming; Linear programming; Matching; Optimization; Roadsides; stable matching; Stations; Vehicles; Wireless fidelity; Wireless networks
• ISSN: 1536-1276; 1558-2248
• DOI: 10.1109/TWC.2020.3003339

To enable ever-increasing vehicular applications, heterogeneous vehicular networks (HetVNets) are recently emerged to provide enhanced and cost-effective wireless network access. Meanwhile, edge caching is imperative to future vehicular content delivery to reduce the delivery delay and alleviate the unprecedented backhaul pressure. This work investigates content caching in HetVNets where Wi-Fi roadside units (RSUs), TV white space (TVWS) stations, and cellular base stations are considered to cache contents and provide content delivery. Particularly, to characterize the intermittent network connection provided by Wi-Fi RSUs and TVWS stations, we establish an on-off model with service interruptions to describe the content delivery process. Content coding then is leveraged to resist the impact of unstable network connections with optimized coding parameters. By jointly considering file characteristics and network conditions, we minimize the average delivery delay by optimizing the content placement, which is formulated as an integer linear programming (ILP) problem. Adopting the idea of student admission model, the ILP problem is then transformed into a many-to-one matching problem and solved by our proposed stable-matching-based caching scheme. Simulation results demonstrate that the proposed scheme can achieve near-optimal performances in terms of delivery delay and offloading ratio with low complexity.