A Cooperative Multi-RSU Caching Scheme in Vehicular Networks with Fountain Codes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

In this paper, we propose an edge caching scheme in vehicular networks, which allows multiple roadside units (RSUs) to collaboratively cache part of content in a distributed way and delivery coded packets by using fountain codes. The overlapping placement algorithm is proposed to increase the correlation of data packets cached in RSUs. When distributing content, the unequal probability selection algorithm of generating fountain codes is proposed to decrease the decoding overhead. The simulation results prove the scheme above that the transmission efficiency and the successful content acquisition rate can be improved than the traditional coded caching when the caching memory is limited.

Original languageEnglish
Title of host publication2021 IEEE 32nd Annual International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2021
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1445-1450
Number of pages6
ISBN (Electronic)9781728175867
DOIs
StatePublished - 13 Sep 2021
Event32nd IEEE Annual International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2021 - Virtual, Helsinki, Finland
Duration: 13 Sep 202116 Sep 2021

Publication series

NameIEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC
Volume2021-September

Conference

Conference32nd IEEE Annual International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2021
Country/TerritoryFinland
CityVirtual, Helsinki
Period13/09/2116/09/21

Keywords

  • cooperative edge caching
  • fountain codes
  • overlapping placement
  • unequal probability selection
  • vehicular networks

Fingerprint

Dive into the research topics of 'A Cooperative Multi-RSU Caching Scheme in Vehicular Networks with Fountain Codes'. Together they form a unique fingerprint.

Cite this