Coded Caching Clusters with Device-to-Device Communications

Tutkimustuotos: Lehtiartikkelivertaisarvioitu

Standard

Coded Caching Clusters with Device-to-Device Communications. / Paakkonen, Joonas; Barreal, Amaro; Hollanti, Camilla; Tirkkonen, Olav.

julkaisussa: IEEE Transactions on Mobile Computing, Vuosikerta 18, Nro 2, 8353772, 01.02.2019, s. 264 - 275.

Tutkimustuotos: Lehtiartikkelivertaisarvioitu

Harvard

APA

Vancouver

Author

Paakkonen, Joonas ; Barreal, Amaro ; Hollanti, Camilla ; Tirkkonen, Olav. / Coded Caching Clusters with Device-to-Device Communications. Julkaisussa: IEEE Transactions on Mobile Computing. 2019 ; Vuosikerta 18, Nro 2. Sivut 264 - 275.

Bibtex - Lataa

@article{67f28b5d564e4c11a7257b8d817fd4b4,
title = "Coded Caching Clusters with Device-to-Device Communications",
abstract = "We consider a geographically constrained caching community where popular data files are cached on mobile terminals and distributed through Device-to-Device (D2D) communications. To ensure availability, data files are protected against user mobility, or churn, with select caching and erasure coding methods. Communication and storage costs are considered, with an objective of minimizing the consumption of radio resources, given an available storage size. We focus on finding the coding method that minimizes the overall cost. Closed-form expressions for the expected consumption of radio resources incurred by data delivery and redundancy maintenance are derived. Closed form transmission costs in a circular caching community with a specific node density and caching method are calculated, when cost obeys a power law of distance. Our results are illustrated by numerical examples and verified by extensive computer simulations.",
keywords = "Device-to-Device Communications, Distributed Data Storage, Markov Processes, Regenerating Codes, Wireless Caching",
author = "Joonas Paakkonen and Amaro Barreal and Camilla Hollanti and Olav Tirkkonen",
year = "2019",
month = "2",
day = "1",
doi = "10.1109/TMC.2018.2832636",
language = "English",
volume = "18",
pages = "264 -- 275",
journal = "IEEE Transactions on Mobile Computing",
issn = "1536-1233",
number = "2",

}

RIS - Lataa

TY - JOUR

T1 - Coded Caching Clusters with Device-to-Device Communications

AU - Paakkonen, Joonas

AU - Barreal, Amaro

AU - Hollanti, Camilla

AU - Tirkkonen, Olav

PY - 2019/2/1

Y1 - 2019/2/1

N2 - We consider a geographically constrained caching community where popular data files are cached on mobile terminals and distributed through Device-to-Device (D2D) communications. To ensure availability, data files are protected against user mobility, or churn, with select caching and erasure coding methods. Communication and storage costs are considered, with an objective of minimizing the consumption of radio resources, given an available storage size. We focus on finding the coding method that minimizes the overall cost. Closed-form expressions for the expected consumption of radio resources incurred by data delivery and redundancy maintenance are derived. Closed form transmission costs in a circular caching community with a specific node density and caching method are calculated, when cost obeys a power law of distance. Our results are illustrated by numerical examples and verified by extensive computer simulations.

AB - We consider a geographically constrained caching community where popular data files are cached on mobile terminals and distributed through Device-to-Device (D2D) communications. To ensure availability, data files are protected against user mobility, or churn, with select caching and erasure coding methods. Communication and storage costs are considered, with an objective of minimizing the consumption of radio resources, given an available storage size. We focus on finding the coding method that minimizes the overall cost. Closed-form expressions for the expected consumption of radio resources incurred by data delivery and redundancy maintenance are derived. Closed form transmission costs in a circular caching community with a specific node density and caching method are calculated, when cost obeys a power law of distance. Our results are illustrated by numerical examples and verified by extensive computer simulations.

KW - Device-to-Device Communications

KW - Distributed Data Storage

KW - Markov Processes

KW - Regenerating Codes

KW - Wireless Caching

UR - http://www.scopus.com/inward/record.url?scp=85046376481&partnerID=8YFLogxK

U2 - 10.1109/TMC.2018.2832636

DO - 10.1109/TMC.2018.2832636

M3 - Article

VL - 18

SP - 264

EP - 275

JO - IEEE Transactions on Mobile Computing

JF - IEEE Transactions on Mobile Computing

SN - 1536-1233

IS - 2

M1 - 8353772

ER -

ID: 21276557