Learning Centre

Coded Caching Clusters with Device-to-Device Communications

 |  Login

Show simple item record

dc.contributor Aalto-yliopisto fi
dc.contributor Aalto University en
dc.contributor.author Paakkonen, Joonas
dc.contributor.author Barreal, Amaro
dc.contributor.author Hollanti, Camilla
dc.contributor.author Tirkkonen, Olav
dc.date.accessioned 2018-11-02T08:44:17Z
dc.date.available 2018-11-02T08:44:17Z
dc.date.issued 2019-02-01
dc.identifier.citation Paakkonen , J , Barreal , A , Hollanti , C & Tirkkonen , O 2019 , ' Coded Caching Clusters with Device-to-Device Communications ' , IEEE Transactions on Mobile Computing , vol. 18 , no. 2 , 8353772 , pp. 264 - 275 . https://doi.org/10.1109/TMC.2018.2832636 en
dc.identifier.issn 1536-1233
dc.identifier.issn 1558-0660
dc.identifier.other PURE UUID: 67f28b5d-564e-4c11-a725-7b8d817fd4b4
dc.identifier.other PURE ITEMURL: https://research.aalto.fi/en/publications/67f28b5d-564e-4c11-a725-7b8d817fd4b4
dc.identifier.other PURE LINK: http://www.scopus.com/inward/record.url?scp=85046376481&partnerID=8YFLogxK
dc.identifier.other PURE FILEURL: https://research.aalto.fi/files/29058399/ELEC_paakkonen_et_al_Coded_caching_clusters_ieee.pdf
dc.identifier.uri https://aaltodoc.aalto.fi/handle/123456789/34523
dc.description.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. en
dc.format.extent 12
dc.format.mimetype application/pdf
dc.language.iso en en
dc.relation.ispartofseries IEEE Transactions on Mobile Computing en
dc.rights openAccess en
dc.title Coded Caching Clusters with Device-to-Device Communications en
dc.type A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä fi
dc.description.version Peer reviewed en
dc.contributor.department Department of Communications and Networking
dc.contributor.department Department of Mathematics and Systems Analysis
dc.subject.keyword Device-to-Device Communications
dc.subject.keyword Distributed Data Storage
dc.subject.keyword Markov Processes
dc.subject.keyword Regenerating Codes
dc.subject.keyword Wireless Caching
dc.identifier.urn URN:NBN:fi:aalto-201811025576
dc.identifier.doi 10.1109/TMC.2018.2832636
dc.type.version acceptedVersion

Files in this item

Files Size Format View

There are no open access files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search archive

Advanced Search

article-iconSubmit a publication