University of Oulu

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

Implicit cooperative caching based on information popularity for vehicular networks

Saved in:
Author: Li, Yuhong1,2; Wang, Ji3; Anders Lindgren4,5;
Organizations: 1State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications
2The Key Laboratory of Embedded System and Service Computing, Ministry of Education, Tongji University
3State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications
4RISE SICS
5Luleå University of Technology
6Centre for Ubiquitous Computing, University of Oulu
Format: article
Version: accepted version
Access: open
Online Access: PDF Full Text (PDF, 0.7 MB)
Persistent link: http://urn.fi/urn:nbn:fi-fe2018081533675
Language: English
Published: Association for Computing Machinery, 2017
Publish Date: 2018-08-15
Description:

Abstract

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.

see all

ISBN Print: 978-1-4503-5144-7
DOI: 10.1145/3124087.3124091
OADOI: https://oadoi.org/10.1145/3124087.3124091
Host publication: CHANTS ’17 : proceedings of the 12th Workshop on Challenged Networks
Host publication editor: Tarkoma, Sasu
Wolf, Lars C.
Conference: CHANTS '17 : the 12th Workshop on Challenged Networks
Type of Publication: A4 Article in conference proceedings
Field of Science: 113 Computer and information sciences
Subjects:
Copyright information: © 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