Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • 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å tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.ORCID-id: 0000-0003-3932-4144
Centre for Ubiquitous Computing, University of Oulu.
Vise andre og tillknytning
2017 (engelsk)Inngår i: CHANTS 2017: Proceedings of the 12th Workshop on Challenged Networks, co-located with MobiCom 201720 October 2017, New York: ACM Digital Library, 2017, s. 51-56Konferansepaper, Publicerat paper (Fagfellevurdert)
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.

sted, utgiver, år, opplag, sider
New York: ACM Digital Library, 2017. s. 51-56
HSV kategori
Forskningsprogram
Distribuerade datorsystem
Identifikatorer
URN: urn:nbn:se:ltu:diva-66618DOI: 10.1145/3124087.3124091Scopus ID: 2-s2.0-85041533208ISBN: 9781450351447 (digital)OAI: oai:DiVA.org:ltu-66618DiVA, id: diva2:1157992
Konferanse
12th ACM Workshop on Challenged Networks (CHANTS 2017), Snowbird, Utah, USA, October 20, 2017
Tilgjengelig fra: 2017-11-17 Laget: 2017-11-17 Sist oppdatert: 2018-05-09bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Lindgren, Anders

Søk i DiVA

Av forfatter/redaktør
Lindgren, Anders
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 52 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf