Markov Clustering-Based Content Placement in Roadside-Unit Caching With Deadline Constraint

• Published in: IEEE transactions on intelligent transportation systems Vol. 25; no. 9; pp. 11881 - 11892
• Main Authors: Wang, Yu-Ting, Lin, Ting-Yu, Sou, Sok-Ian, Chen, Lo-An, Tsai, Meng-Hsun, Chen, Yean-Ru, Tu, Chia-Heng
• Format: Journal Article
• Language: English
• Published: IEEE 01.09.2024
• Subjects: Cache storage; Caching; Clustering algorithms; Computer science; deadline constraint; Markov clustering; Mobility models; Probabilistic logic; roadside unit; Vehicle dynamics; Vehicular ad hoc networks
• ISSN: 1524-9050; 1558-0016
• DOI: 10.1109/TITS.2024.3368413

With the explosive growth of mobile data traffic, roadside-unit (RSU) caching is considered an effective way to offload download traffic in vehicular ad hoc networks (VANETs). Many existing works investigate the content placement of RSU caching. However, few of them consider the download deadline constraint when caching the content in the RSUs. In this paper, the main objective is to maximize the hit rate of downloading the requested content from the RSUs before the deadline expires. We propose a Markov-based mobility model and a Markov clustering-based content placement algorithm to group the RSUs into clusters and allocate the content to the cache of the RSUs in the cluster. We also investigate the impact on the cache hit rate under different simulation parameters, such as the total number of RSUs, the cache size, and the number of RSUs visited by vehicles during the download period. According to the simulations conducted, when the region of interest (RoI) is small, the MVP method increases the cache hit rate by at least 21.40% compared to the existing methods. When the RoI is large, our approach outperforms other existing methods by at least 26.16% and at most 337.77%, which significantly increases the efficiency of the download session in VANET.