turcanu2021high
Abstract
High-fidelity content distribution and other emerging applications of 5G and beyond-5G mobile broadband networking can put massive load on the core and radio access network (RAN). To address this, direct device-to-device (D2D) communication has recently become a first-class citizen of these networks. While information-centric vehicular networking (ICVN) based on fog computing can exploit such D2D links to alleviate the load on the RAN by proactively seeding content in the network, it has been shown that such seeding can cause even more load if performed where not needed. In addition, trying to determine where to seed content often causes additional load, negating the benefit of seeding. Therefore, in this work, we propose to adaptively seed fog nodes based on a purely virtual clustering approach. Here, vehicles are unaware of clustering decisions, so that an explicit exchange of control messages is no longer required. We show that the benefit of such an adaptive approach goes beyond simply being able to flexibly trade off one performance metric for another; in fact, it can consistently lower the load on the RAN link. We also demonstrate that this property holds even if the only available node location information is as coarsely grained as macroscale grid cells.
Quick access
- Original Version (at publishers web site)
- Authors' Version (PDF on this web site)
- BibTeX
Contact
- Ion Turcanu
- Thomas Engel
- Christoph Sommer
BibTeX reference
@article{turcanu2021high,
author = {Turcanu, Ion and Engel, Thomas and Sommer, Christoph},
title = {{Adaptive Content Seeding for Information-Centric Networking under High Topology Dynamics: Where You Seed Matters}},
journal = {IEEE Vehicular Technology Magazine},
doi = {10.1109/MVT.2021.3050728},
issn = {1556-6072},
month = {February},
number = {2},
pages = {68--75},
publisher = {IEEE},
volume = {16},
year = {2021},
}
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.
The following applies to all papers listed above that have IFIP copyrights: © IFIP, (YEAR). This is the author's version of the work. It is posted here by permission of IFIP for your personal use. Not for redistribution. The definitive version was published in PUBLICATION, {VOL#, ISS#, (DATE)}, http://IFIP DL URL.