Efficient Content Delivery in User-Centric and Cache-Enabled Vehicular Edge Networks with Deadline-Constrained Heterogeneous Demands

被引:5
作者
Pervej, Md Ferdous [1 ]
Jin, Richeng [2 ,3 ]
Lin, Shih-Chun [1 ]
Dai, Huaiyu [1 ]
机构
[1] NC State Univ, Dept Elect & Comp Engn, Raleigh, NC 27695 USA
[2] Zhejiang Univ, Dept Informat & Commun Engn, Zhejiang Singapore Innovat & AI Joint Res Lab, Hangzhou 310007, Peoples R China
[3] Zhejiang Univ, Zhejiang Prov Key Lab Informat Proc Commun & Netwo, Hangzhou 310007, Peoples R China
关键词
Connected vehicle (CV); content caching; delay minimization; software-defined networking (SDN); user-centric networking; vehicular edge network (VEN); 5G RAN; COMMUNICATION; VEHICLES;
D O I
10.1109/TVT.2023.3300954
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Modern connected vehicles (CVs) frequently require diverse types of content for mission-critical decision-making and onboard users' entertainment. These contents are required to be fully delivered to the requester CVs within stringent deadlines that the existing radio access technology (RAT) solutions may fail to ensure. Motivated by the above consideration, this article exploits content caching in vehicular edge networks (VENs) with a software-defined user-centric virtual cell (VC) based RAT solution for delivering the requested contents from a proximity edge server. Moreover, to capture the heterogeneous demands of the CVs, we introduce a preference-popularity tradeoff in their content request model. To that end, we formulate a joint optimization problem for content placement, CV scheduling, VC configuration, VC-CV association and radio resource allocation to minimize long-term content delivery delay. However, the joint problem is highly complex and cannot be solved efficiently in polynomial time. As such, we decompose the original problem into a cache placement problem and a content delivery delay minimization problem given the cache placement policy. We use deep reinforcement learning (DRL) as a learning solution for the first sub-problem. Furthermore, we transform the delay minimization problem into a priority-based weighted sum rate (WSR) maximization problem, which is solved leveraging maximum bipartite matching (MWBM) and a simple linear search algorithm. Our extensive simulation results demonstrate the effectiveness of the proposed method compared to existing baselines in terms of cache hit ratio (CHR), deadline violation and content delivery delay.
引用
收藏
页码:1129 / 1145
页数:17
相关论文
共 53 条
  • [1] 3rd Generation Partnership Project, 2019, Tech. Rep.38.901 v16.1.0
  • [2] 3rd Generation Partnership Project, 2020, Tech. Rep. 38.886 V0.5.0
  • [3] [Anonymous], Connected and Automated Vehicles
  • [4] [Anonymous], AUTOMATED VEHICLES S
  • [5] Caching With Time-Varying Popularity Profiles: A Learning-Theoretic Perspective
    Bharath, B. N.
    Nagananda, K. G.
    Gunduz, D.
    Poor, H. Vincent
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2018, 66 (09) : 3837 - 3847
  • [6] Buttazzo GC, 2011, HARD REAL-TIME COMPUTING SYSTEMS: PREDICTABLE SCHEDULING ALGORITHMS AND APPLICATIONS, THIRD EDITION, P1, DOI 10.1007/978-1-14614-0676-1
  • [7] Chandupatla S., 2020, Tech. Paper, 2020-01-1035
  • [8] Flexible Virtual Cell Design for Ultradense Networks: A Machine Learning Approach
    Cheng, Zhiyang
    Zhu, Dongzhi
    Zhao, Youping
    Sun, Chen
    [J]. IEEE ACCESS, 2021, 9 : 91575 - 91583
  • [9] Deep Reinforcement Learning and Permissioned Blockchain for Content Caching in Vehicular Edge Computing and Networks
    Dai, Yueyue
    Xu, Du
    Zhang, Ke
    Maharjan, Sabita
    Zhang, Yan
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2020, 69 (04) : 4312 - 4324
  • [10] On the Content Delivery Efficiency of NOMA Assisted Vehicular Communication Networks With Delay Constraints
    Fang, Sangsha
    Chen, Hongyang
    Khan, Zahid
    Fan, Pingzhi
    [J]. IEEE WIRELESS COMMUNICATIONS LETTERS, 2020, 9 (06) : 847 - 850