Device-to-device data storage with regenerating codes

Pääkkönen, Joonas; Hollanti, Camilla; Tirkkonen, Olav

Aaltodoc
→
6b Artikkelit / Articles from Research information portal
→
[article-cris] Perustieteiden korkeakoulu / SCI
→
View Item

Device-to-device data storage with regenerating codes

Altmetrics



Title:	Device-to-device data storage with regenerating codes
Author(s):	Pääkkönen, Joonas ; Hollanti, Camilla ; Tirkkonen, Olav
Date:	2015
Language:	en
Pages:	13 57-69
Department:	Communications Theory Department of Mathematics and Systems Analysis Department of Communications and Networking
ISBN:	978-3-319-23439-7
Series:	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Volume 9305
ISSN:	03029743 16113349
DOI-number:	10.1007/978-3-319-23440-3_5
» Show full item record
This publication is imported from Aalto University Research information portal: https://research.aalto.fi > View this publication in Research information portal > Other link related to publication (Research information portal) > View/Open full text file from Research information portal
Citation: Pääkkönen , J , Hollanti , C & Tirkkonen , O 2015 , Device-to-device data storage with regenerating codes . in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , vol. 9305 , Springer , pp. 57-69 , International Workshop on Multiple Access Communications , Helsinki , Finland , 03/09/2015 . https://doi.org/10.1007/978-3-319-23440-3_5
Abstract: Caching data files directly on mobile user devices combined with device-to-device (D2D) communications has recently been suggested to improve the capacity of wireless networks. We investigate the performance of regenerating codes in terms of the total energy consumption of a cellular network. We show that regenerating codes can offer large performance gains. It turns out that using redundancy against storage node failures is only beneficial if the popularity of the data is between certain thresholds. As our major contribution, we investigate under which circumstances regenerating codes with multiple redundant data fragments outdo uncoded caching.

Permanent link to this item: http://urn.fi/URN:NBN:fi:aalto-201705315151 Email this Export to RefWorks QR Code Print BibTex Tweet