Research Article
Repairable Fountain Codes with Unequal Repairing Locality in D2D Storage System
@INPROCEEDINGS{10.1007/978-3-030-05888-3_25, author={Yue Li and Shushi Gu and Ye Wang and Juan Li and Qinyu Zhang}, title={Repairable Fountain Codes with Unequal Repairing Locality in D2D Storage System}, proceedings={Ad Hoc Networks. 10th EAI International Conference, ADHOCNETS 2018, Cairns, Australia, September 20-23, 2018, Proceedings}, proceedings_a={ADHOCNETS}, year={2018}, month={12}, keywords={D2D data storage system Repairable fountain codes Unequal repairing locality Repair and download bandwidth}, doi={10.1007/978-3-030-05888-3_25} }- Yue Li
Shushi Gu
Ye Wang
Juan Li
Qinyu Zhang
Year: 2018
Repairable Fountain Codes with Unequal Repairing Locality in D2D Storage System
ADHOCNETS
Springer
DOI: 10.1007/978-3-030-05888-3_25
Abstract
In this paper, we propose a novel repairable fountain codes (RFC) used in D2D data storage systems for failure data recovery. This RFC has the priority of unequal repairing locality (URL), which can provide unequal data protection for different nodes’ bandwidth and power in different areas. The lower locality of URL-RFC can reduce the repair bandwidth in D2D storage system, and tradeoff different nodes’ capabilities of transmitting. We firstly give the heterogeneous D2D storage network model, and analysis the communication cost for data download and node repair. Then, the construction method of URL-RFC is given based on generated matrix. Simulation results show that, URL-RFC significant outperforms conventional distributed codes on communication cost in heterogeneous D2D storage system.
