Literature Database Entry


Gurjashan Singh Pannu, Seyhan Ucar, Takamasa Higuchi, Onur Altintas and Falko Dressler, "Data Sharing in Virtual Edge Computing using Coded Caching," Proceedings of 14th IEEE Vehicular Networking Conference (VNC 2023), Istanbul, Turkey, April 2023, pp. 104–111.


Multi-access edge computing (MEC) has been identified as a powerful concept for offloading computational tasks and for storing popular data in close proximity of end users; avoiding frequent communication to a back-end cloud server. In the context of vehicular applications, similar functionality can be provided by vehicles collaboratively offering storage and computational resources on-board, i.e., a virtual MEC concept. Data management in a virtual edge is particularly challenging due to the high degree of mobility. Coded caching is a concept to store data on distributed systems in form of fragments. When needed, these fragments are transmitted to the requesting node in a coded form so that the total number of transmissions is reduced (i.e., optimizing for reduced download times and reduced resource utilization). In this paper, we introduce a new protocol for data sharing among vehicles participating in virtual edge computing using coded caching. Our results show that coded caching improve the efficiency of data sharing by up to 50% in a virtual edge computing environment.

Quick access

Original Version DOI (at publishers web site)
Authors' Version PDF (PDF on this web site)
BibTeX BibTeX


Gurjashan Singh Pannu
Seyhan Ucar
Takamasa Higuchi
Onur Altintas
Falko Dressler

BibTeX reference

    author = {Pannu, Gurjashan Singh and Ucar, Seyhan and Higuchi, Takamasa and Altintas, Onur and Dressler, Falko},
    doi = {10.1109/VNC57357.2023.10136281},
    title = {{Data Sharing in Virtual Edge Computing using Coded Caching}},
    pages = {104--111},
    publisher = {IEEE},
    issn = {2157-9865},
    address = {Istanbul, Turkey},
    booktitle = {14th IEEE Vehicular Networking Conference (VNC 2023)},
    month = {4},
    year = {2023},

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at

This page was automatically generated using BibDB and bib2web.