Implicit cooperative caching based on information popularity for vehicular networks
Li, Yuhong; Wang, Ji; Anders Lindgren; Su, Xiang; Riekki, Jukka (2017-10-20)
Y. Li, J. Wang, A. Lindgren, X. Su, J. Riekki, "Implicit cooperative caching based on information popularity for vehicular networks,"12th Workshop on Challenged Networks (CHANTS '17), Snowbird (UT), 2017, pp. 51-56. doi: 10.1145/3124087.3124091
© ACM, 2017. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in CHANTS '17 : proceedings of the 12th Workshop on Challenged Networks, http://doi.acm.org/10.1145/3124087.3124091
Information-centric networking (ICN) technology is becoming a popular research topic in vehicular networks due to the connectionless and lightweight characteristics of this networking paradigm. Caching plays an essential role in information-centric networks, but current caching techniques for ICN are not ideal for the dynamic and wireless vehicular networks. This paper presents a caching approach for ICN-based vehicular networks that takes into account both the dynamicity of vehicular networks and the popularity of the information being distributed. We introduce an interval metric for selective caching. With this metric and estimates of information popularity and vehicle density, cooperative caching can be realized without exchanging cache management information among the vehicular nodes. Simulation results show that the proposed approach can increase the storage space utilization and has low data response time for vehicular networks.
- Avoin saatavuus