Coded Caching Clusters with Device-to-Device Communications
| dc.contributor | Aalto-yliopisto | fi |
| dc.contributor | Aalto University | en |
| dc.contributor.author | Paakkonen, Joonas | en_US |
| dc.contributor.author | Barreal, Amaro | en_US |
| dc.contributor.author | Hollanti, Camilla | en_US |
| dc.contributor.author | Tirkkonen, Olav | en_US |
| dc.contributor.department | Department of Communications and Networking | en |
| dc.contributor.department | Department of Mathematics and Systems Analysis | en |
| dc.contributor.groupauthor | Algebra and Discrete Mathematics | en |
| dc.contributor.groupauthor | Communications Theory | en |
| dc.date.accessioned | 2018-11-02T08:44:17Z | |
| dc.date.available | 2018-11-02T08:44:17Z | |
| dc.date.issued | 2019-02-01 | en_US |
| 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.description.version | Peer reviewed | en |
| dc.format.extent | 12 | |
| dc.format.mimetype | application/pdf | en_US |
| 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.doi | 10.1109/TMC.2018.2832636 | en_US |
| dc.identifier.issn | 1536-1233 | |
| dc.identifier.other | PURE UUID: 67f28b5d-564e-4c11-a725-7b8d817fd4b4 | en_US |
| dc.identifier.other | PURE ITEMURL: https://research.aalto.fi/en/publications/67f28b5d-564e-4c11-a725-7b8d817fd4b4 | en_US |
| 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.identifier.urn | URN:NBN:fi:aalto-201811025576 | |
| dc.language.iso | en | en |
| dc.publisher | IEEE | |
| dc.relation.ispartofseries | IEEE Transactions on Mobile Computing | en |
| dc.relation.ispartofseries | Volume 18, issue 2, pp. 264 - 275 | en |
| dc.rights | openAccess | en |
| dc.subject.keyword | Device-to-Device Communications | en_US |
| dc.subject.keyword | Distributed Data Storage | en_US |
| dc.subject.keyword | Markov Processes | en_US |
| dc.subject.keyword | Regenerating Codes | en_US |
| dc.subject.keyword | Wireless Caching | en_US |
| dc.title | Coded Caching Clusters with Device-to-Device Communications | en |
| dc.type | A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä | fi |
| dc.type.version | acceptedVersion |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- ELEC_paakkonen_et_al_Coded_caching_clusters_ieee.pdf
- Size:
- 560.51 KB
- Format:
- Adobe Portable Document Format