Advertisement

Repairable Fountain Codes with Unequal Repairing Locality in D2D Storage System

  • Yue Li
  • Shushi GuEmail author
  • Ye Wang
  • Juan Li
  • Qinyu Zhang
Conference paper
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 258)

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.

Keywords

D2D data storage system Repairable fountain codes Unequal repairing locality Repair and download bandwidth 

Notes

Acknowledgments

This work was supported in part by the National Natural Sciences Foundation of China under Grant 61701136, Grant 61501140 and Grant 61525103, and China Postdoctoral Science Foundation Grant 2018M630357, and Shenzhen Basic Research Program under Grant JCY2017081114233370 and Grant ZDSYS20170728090330586.

References

  1. 1.
    Wang, L., Wu, H., Han, Z.: Wireless distributed storage in socially enabled D2D communications. IEEE Access 4, 1971–1984 (2017)CrossRefGoogle Scholar
  2. 2.
    Pääkkönen, J., Hollanti, C., Tirkkonen, O.: Device-to-device data storage for mobile cellular systems, pp. 671–676 (2013)Google Scholar
  3. 3.
    Pääkkönen, J., Hollanti, C., Tirkkonen, O.: Device-to-device data storage with regenerating codes. In: Jonsson, M., Vinel, A., Bellalta, B., Tirkkonen, O. (eds.) MACOM 2015. LNCS, vol. 9305, pp. 57–69. Springer, Cham (2015).  https://doi.org/10.1007/978-3-319-23440-3_5CrossRefGoogle Scholar
  4. 4.
    Pedersen, J., Amat, A.G.I., Andriyanova, I., Brännström, F.: Distributed storage in mobile wireless networks with device-to-device communication. IEEE Trans. Commun. 64(11), 4862–4878 (2016)CrossRefGoogle Scholar
  5. 5.
    Pedersen, J., Amat, A.G.I., Andriyanova, I., Brännström, F.: Optimizing MDS coded caching in wireless networks with device-to-device communication (2018)Google Scholar
  6. 6.
    Asteris, M., Dimakis, A.G.: Repairable fountain codes. IEEE J. Sel. Areas Commun. 32(5), 1037–1047 (2014)CrossRefGoogle Scholar
  7. 7.
    Luo, Z., Song, L., Zheng, S., Ling, N.: Raptor codes based unequal protection for compressed video according to packet priority. IEEE Trans. Multimedia 15(8), 2208–2213 (2013)CrossRefGoogle Scholar
  8. 8.
    Chen, Z., Xu, M., Yin, L., Lu, L.: Unequal error protected jpeg 2000 broadcast scheme with progressive fountain codes, pp. 1–5 (2012)Google Scholar
  9. 9.
    Hu, Y., et al.: Unequal failure protection coding technique for distributed cloud storage systems. IEEE Trans. Cloud Comput. PP(99), 1 (2017)Google Scholar
  10. 10.
    Miller, S., Childers, D.: Probability and Random Processes, 2nd edn (2012)CrossRefGoogle Scholar

Copyright information

© ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2019

Authors and Affiliations

  • Yue Li
    • 1
  • Shushi Gu
    • 1
    Email author
  • Ye Wang
    • 1
  • Juan Li
    • 1
  • Qinyu Zhang
    • 1
  1. 1.Communication Engineering Research CenterHarbin Institute of TechnologyShenzhenChina

Personalised recommendations