Real-Time Search-Driven Caching for Sensing Data in Vehicular Networks

被引:6
作者
Liu, Mingliu [1 ,2 ]
Li, Deshi [1 ]
Wu, Huaqing [3 ]
Lyu, Feng [4 ]
Shen, Xuemin [5 ]
机构
[1] Wuhan Univ, Sch Elect Informat, Wuhan 430072, Peoples R China
[2] State Grid Hubei Elect Power Res Inst, Elect Power Res Inst, Wuhan 430077, Peoples R China
[3] McMaster Univ, Dept Elect & Comp Engn, Hamilton, ON L8S 4L8, Canada
[4] Cent South Univ, Sch Comp Sci & Engn, Changsha 410083, Peoples R China
[5] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada
基金
中国国家自然科学基金; 加拿大自然科学与工程研究理事会; 中国博士后科学基金;
关键词
Sensors; Real-time systems; Delays; Data models; Servers; Distributed databases; Vehicle dynamics; Cooperative caching; real-time search; sensing data (SD) caching; vehicular networks;
D O I
10.1109/JIOT.2021.3134964
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Real-time search is essential for accessing specific sensing data (SD) in vehicular networks to support safe, efficient, and intelligent road services. Considering the tremendous data volume, the SD search process should be carefully devised to avoid excessive retrieval and transmission delay. To alleviate the communication and computational burden for sensing devices and the cloud server, roadside edges are adopted to cache the SD in advance. Given a short lifetime of SD, the caching scheme is required to be efficient in facilitating both the search process and uplink/downlink transmission, which is quite challenging due to the coupling of resource allocation decisions. To guarantee the search efficacy and enhance the caching resource utilization, we propose a real-time search-driven caching (RSC) paradigm to enable the cooperation among storage-constrained edges. A hierarchical indexing framework is first introduced for cached data, based on which we then devise a search utility model to quantify the expected data freshness and response delay. With the objective of maximizing the long-term search reward, the RSC problem is formulated by jointly considering the search requests and utility model. A deep-reinforcement-learning-based caching (DRLC) method is proposed to solve the problem. Specifically, an action transition module is introduced to lower the computational complexity via reducing the selection space of caching actions. Extensive simulations are carried out based on the real trace data in Creteil, France, and results show that the intelligent DRLC method can improve the real-time search performance significantly comparing to the benchmark methods.
引用
收藏
页码:12219 / 12230
页数:12
相关论文
共 33 条
[1]  
5GAA, 2019, C-V2X Use Cases: Methodology, Examples and Service Level Requirements
[2]  
Burkacky O., 2019, Automotive software and electronics 2030
[3]   Temporal Information Services in Large-Scale Vehicular Networks Through Evolutionary Multi-Objective Optimization [J].
Dai, Penglin ;
Liu, Kai ;
Feng, Liang ;
Zhang, Haijun ;
Lee, Victor Chung Sing ;
Son, Sang Hyuk ;
Wu, Xiao .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2019, 20 (01) :218-231
[4]   On the Complexity of Optimal Request Routing and Content Caching in Heterogeneous Cache Networks [J].
Dehghan, Mostafa ;
Jiang, Bo ;
Seetharam, Anand ;
He, Ting ;
Salonidis, Theodoros ;
Kurose, Jim ;
Towsley, Don ;
Sitaraman, Ramesh .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2017, 25 (03) :1635-1648
[5]   Femtocaching and Device-to-Device Collaboration: A New Architecture for Wireless Video Distribution [J].
Golrezaei, Negin ;
Molisch, Andreas F. ;
Dimakis, Alexandros G. ;
Caire, Giuseppe .
IEEE COMMUNICATIONS MAGAZINE, 2013, 51 (04) :142-149
[6]  
Hisaka S, 2011, IEEE INT C INTELL TR, P198, DOI 10.1109/ITSC.2011.6082853
[7]   Collaborative Content Delivery in Software-Defined Heterogeneous Vehicular Networks [J].
Hui, Yilong ;
Su, Zhou ;
Luan, Tom H. .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2020, 28 (02) :575-587
[8]  
Jiang Y., 2019, P IEEE GLOB COMM C G, P1
[9]  
Lebre M. A., 2016, PROC IEEE 83 VEH TEC, P1
[10]  
Lee P., 2017, REP