Literature Database Entry

turcanu2019fog


Ion Turcanu, Thomas Engel and Christoph Sommer, "Fog Seeding Strategies for Information-Centric Heterogeneous Vehicular Networks," Proceedings of 11th IEEE Vehicular Networking Conference (VNC 2019), Los Angeles, CA, December 2019, pp. 282–289.

Abstract

Content downloading of mobile broadband users today routinely causes network load to exceed what the Radio Access Network (RAN) can sustain without degrading user experience. Many works are therefore considering edge or fog computing paradigms and Device to Device (D2D) communication using 4G/5G C-V2X or IEEE 802.11p/bd links to obtain content. When content originates (or is maintained) at a central location, however, this requires expensive seeding of the content into the mobile network. We thus advocate basing the decision of when and where to perform fog seeding on a network graph that respects connectivity metrics while performing community detection and exploiting node centrality. We present different seeding strategies and investigate their respective benefits compared to traditional information-centric networking. Using simulations, we demonstrate that choosing a suitable strategy can yield substantial benefits - and vice versa.

Quick access

Authors' Version PDF (PDF on this web site)
BibTeX BibTeX

Contact

Ion Turcanu
Thomas Engel
Christoph Sommer

BibTeX reference

@inproceedings{turcanu2019fog,
    address = {Los Angeles, CA},
    author = {Turcanu, Ion and Engel, Thomas and Sommer, Christoph},
    booktitle = {11th IEEE Vehicular Networking Conference (VNC 2019)},
    editor = {Cabric, Danijela and Altintas, Onur and Leinmueller, Tim and Zhang, Hongwei and Higuchi, Takamasa},
    isbn = {978-1-7281-4571-6},
    issn = {2157-9865},
    month = {12},
    pages = {282--289},
    publisher = {Institute of Electrical and Electronics Engineers},
    title = {{Fog Seeding Strategies for Information-Centric Heterogeneous Vehicular Networks}},
    year = {2019},
   }
   
   

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 permissions@acm.org.

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

This page was automatically generated using BibDB and bib2web.