当前位置: X-MOL 学术Transp. Res. Part A Policy Pract. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
An efficient caching policy for content retrieval in autonomous connected vehicles
Transportation Research Part A: Policy and Practice ( IF 6.4 ) Pub Date : 2020-08-31 , DOI: 10.1016/j.tra.2020.08.005
Muddasir Rahim , Muhammad Awais Javed , Ahmad Naseem Alvi , Muhammad Imran

Connected vehicles will enable the smart and autonomous transportation systems in the future. Cellular Vehicle-to-Everything (C-V2X) communication will provide wireless connectivity to enable large number of connected vehicle applications. Vehicles will receive traffic and infotainment contents from the city traffic command center using C-V2X communications. In this context, infrastructure Road Side Units (RSUs) will cache urgent and popular data in their memory storage, hence providing vehicles to retrieve information from a closer vicinity at a RSU. In this paper, we present a content caching policy for the connected vehicles operator to improve the efficiency of the content retrieval in terms of download rate and delay. We propose the utility functions for the RSUs and vehicles to cache a particular content at a given RSU. Moreover, Gale-Shapley stable matching algorithm is used to efficiently allocate RSU cache to the contents. We also provide rules to update the cache slots. The proposed caching scheme is compared with random caching policy and market matching based caching policies. Results show that the proposed content caching policy improves the efficiency of the content retrieval with 60% more data transmission with reduced downloading time and better link utilization as compared to other two scheme.



中文翻译:

用于自动连接车辆中内容检索的有效缓存策略

联网汽车将在未来实现智能和自动交通系统。蜂窝车辆到一切(C-V2X)通信将提供无线连接,以实现大量联网车辆应用。车辆将使用C-V2X通信从城市交通指挥中心接收交通和信息娱乐内容。在这种情况下,基础设施路边单元(RSU)将在其内存存储中缓存紧急和流行的数据,从而为车辆提供了从RSU的较近区域检索信息的机会。在本文中,我们提出了一种针对互联车辆运营商的内容缓存策略,以从下载率和延迟方面提高内容检索的效率。我们为RSU和车辆提出实用程序功能,以在给定RSU上缓存特定内容。此外,Gale-Shapley稳定匹配算法用于有效地将RSU缓存分配给内容。我们还提供了更新缓存插槽的规则。将提出的缓存方案与随机缓存策略和基于市场匹配的缓存策略进行了比较。结果表明,所提出的内容缓存策略提高了内容检索的效率。60 与其他两种方案相比,更多的数据传输具有减少的下载时间和更好的链接利用率。

更新日期:2020-08-31
down
wechat
bug