A cost-efficient hybrid redundancy coding scheme for wireless storage systems

被引:1
作者
Zhou, Anan [1 ]
Zhou, Nanhao [2 ]
Yi, Benshun [3 ]
Zhu, Chao [3 ]
机构
[1] Guangxi Med Univ, Sch Publ Hlth, Nanning 530021, Peoples R China
[2] Wuhan Univ Technol, Sch Informat Engn, Wuhan 430070, Peoples R China
[3] Wuhan Univ, Elect Informat Sch, Wuhan 430072, Peoples R China
基金
中国国家自然科学基金;
关键词
Distributed storage technique; Fault tolerance; Access frequency; Repairable fountain code; Hybrid code scheme; DISTRIBUTED STORAGE; REPLICATION; CODES;
D O I
10.1016/j.comcom.2023.03.012
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With distributed storage technique becoming a promising technology for storing massive data in wireless environment, how to improve the reliability of the storage systems has become the focus of researchers. As a redundancy scheme, the erasure coding has been widely used because of its high fault tolerance and low storage overhead performance. However, a large amount of repair overhead consumed to reconstruct lost data has become the most significant issue in erasure-coded storage systems. In this paper, a wireless heteroge-neous storage network with two-layer is designed, where processing units and storage nodes communicate cooperatively. Furthermore, with the consideration of the access frequency skew of stored information and the performance difference of storage nodes, we propose a novel repairable fountain code scheme based on partial duplication technique (PD-RFC), which can modify the repair bandwidth and improve the availability of links between nodes without almost increasing additional storage space overhead. Furthermore, a hybrid code scheme combined by PD-RFC scheme and RFC scheme is designed for the heterogeneous two-layer storage network. The simulation results have shown that the hybrid scheme significantly outperforms other redundant schemes in energy communication cost saving.
引用
收藏
页码:226 / 237
页数:12
相关论文
共 44 条
[1]   An Exponential Lower Bound on the Sub-Packetization of Minimum Storage Regenerating Codes [J].
Alrabiah, Omar ;
Guruswami, Venkatesan .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (12) :8086-8093
[2]  
Araujo Julio, 2011, Data Management in Grid and Peer-to-Peer Systems. Proceedings 4th International Conference (GLOBE 2011), P1, DOI 10.1007/978-3-642-22947-3_1
[3]   Repairable Fountain Codes [J].
Asteris, Megasthenis ;
Dimakis, Alexandros G. .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2014, 32 (05) :1037-1047
[4]   Massive Data Storage Algorithm Based on Node Performance Evaluation [J].
Chen, Qiang .
2018 14TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), 2018, :408-411
[5]   Sparse and Balanced MDS Codes Over Small Fields [J].
Chen, Tingting ;
Zhang, Xiande .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (08) :5112-5125
[6]   Interactive Analytical Processing in Big Data Systems: A Cross-Industry Study of MapReduce Workloads [J].
Chen, Yanpei ;
Alspaugh, Sara ;
Katz, Randy .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2012, 5 (12) :1802-1813
[7]   Optimizing Content Placement and Delivery in Wireless Distributed Cache Systems Through Belief Propagation [J].
Chuan, Jianbin ;
Bai, Bo ;
Wu, Xuewei ;
Zhang, Hongming .
IEEE ACCESS, 2020, 8 :100684-100701
[8]   Network Coding for Distributed Storage Systems [J].
Dimakis, Alexandros G. ;
Godfrey, P. Brighten ;
Wu, Yunnan ;
Wainwright, Martin J. ;
Ramchandran, Kannan .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (09) :4539-4551
[9]   A New Distributed Fault Detection Method for Wireless Sensor Networks [J].
Gharamaleki, Mahdi Mojed ;
Babaie, Shahram .
IEEE SYSTEMS JOURNAL, 2020, 14 (04) :4883-4890
[10]   DR-MDS: An Energy-Efficient Coding Scheme in D2D Distributed Storage Network for the Internet of Things [J].
Gu, Shushi ;
Li, Juan ;
Wang, Ye ;
Wang, Niannian ;
Zhang, Qinyu .
IEEE ACCESS, 2019, 7 :24179-24191