Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Implicit Cooperative Caching based on Information Popularity for Vehicular Networks
State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing.
State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing.
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.ORCID iD: 0000-0003-3932-4144
Centre for Ubiquitous Computing, University of Oulu.
Show others and affiliations
2017 (English)In: CHANTS 2017: Proceedings of the 12th Workshop on Challenged Networks, co-located with MobiCom 201720 October 2017, New York: ACM Digital Library, 2017, p. 51-56Conference paper, Published paper (Refereed)
Abstract [en]

Information dissemination is one of the most important tasks of vehicular networks. Therefore, information-centric networking (ICN) technology is being more and more widely used 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 use in vehicular networks on account of the dynamicity and wireless transmission of 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 to be distributed. By introducing the “interval” metric and estimating the popularity of information and current networking conditions of the vehicles on road, cooperative caching among nodes can be realized without exchanging cache management information among them. Simulation results show that the proposed approach can increase the storage space utilization and has low data response time for vehicular networks.

Place, publisher, year, edition, pages
New York: ACM Digital Library, 2017. p. 51-56
National Category
Communication Systems Media and Communication Technology
Research subject
Pervasive Mobile Computing
Identifiers
URN: urn:nbn:se:ltu:diva-66618DOI: 10.1145/3124087.3124091Scopus ID: 2-s2.0-85041533208ISBN: 9781450351447 (electronic)OAI: oai:DiVA.org:ltu-66618DiVA, id: diva2:1157992
Conference
12th ACM Workshop on Challenged Networks (CHANTS 2017), Snowbird, Utah, USA, October 20, 2017
Available from: 2017-11-17 Created: 2017-11-17 Last updated: 2018-05-09Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Lindgren, Anders
By organisation
Computer Science
Communication SystemsMedia and Communication Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 40 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf