空间信息网络中基于LT码的分布式存储策略

孔博; 张更新; 张威; 程磊

doi:10.11999/JEIT150674

空间信息网络中基于LT码的分布式存储策略

doi: 10.11999/JEIT150674

1.
(解放军理工大学通信工程学院南京 210007) ②(解放军国防信息学院武汉 430015)

基金项目:

国家自然科学基金(91338201, 91438109, 61401507, 61571464)

计量
- 文章访问数: 1422
- HTML全文浏览量: 112
- PDF下载量: 424
- 被引次数: 0
出版历程
- 收稿日期: 2015-06-04
- 修回日期: 2015-12-11
- 刊出日期: 2016-04-19

Distributed Storage Strategy Based on LT Codes in Space Information Network

1.
(College of Communication Engineering, PLA University of Science and Technology, Nanjing 210007, China)
2.
(PLA Academy of National Defense Information, Wuhan 430015, China)

Funds:

The National Natural Science Foundation of China (91338201, 91438109, 61401507, 61571464)

摘要

摘要: 针对空间信息网络(Space Information Network, SIN)节点存储资源严重受限及存储可靠性问题，该文提出一种基于LT(Luby Transform)码的分布式存储策略(Distributed Storage Strategy based on LT codes, DSSLT)。采用定向随机漫步机制，使得源数据包能够更快地遍历整个网络。在信息估计阶段利用基于ID的估计方法进行网络全局信息估计，使所有节点快速获得网络全局信息。合理的数据包选择机制使得最终编码度分布趋于期望的度分布。分析和仿真结果表明，与具有代表性的分布式存储策略相比，该方法大幅度减少了数据包传输时的随机漫步步长，同时提高了译码性能，简单易行。
- 空间信息网络 /
- 分布式存储 /
- 喷泉码 /
- LT码
Abstract: To solve the limited storage resource and the data storage reliability problem of Space Information Network (SIN), a novel Distributed Storage Strategy based on Luby Transform (LT) codes (DSSLT) is proposed. According to the proposed strategy, source data packets are transmitted quickly to every node in the network based on directional random walk. The ID-based estimation method is used to estimate the global information at the information estimation phase, the values are obtained without excessive random walks. The procedure of XORing packets is reasonable so that the distribution of code degree tends to the desired degree distribution. As presented by the analyses and simulations, random walk steps are greatly reduced compared with a representative distributed storage strategy, while improving the decoding performance.
- Space Information Network (SIN) /
- Distributed storage /
- Fountain codes /
- Luby Transform (LT) codes

HTML全文

参考文献(18)

DONG Feihong, Huang Qinfei, LI Hongjun, et al. A novel M2M backbone network architecture[J]. International Journal of Distributed Sensor Networks, 2015, 15(11): 1-10. doi: 10.1155/2015/512321.

ZHANG Wei, ZHANG Gengxin, GOU Liang, et al. A hierarchical autonomous system based topology control algorithm in space information network[J]. KSII Transactions on Internet and Information Systems, 2015, 9(9): 3572-3593. doi: 10.3837/tiis.2015.09.016.

ZHANG Gengxin, ZHANG Wei, and ZHANG Hua. A novel proposal of architecture and network model for space communication networks[C]. Proceeding of the 65th International Astronautical Congress, Toronto, Canada, 2014: 147-153.

LI Bo, WANG Mengdi, ZHAO Yongxin, et al. Modeling and verifying Google file system[C]. Proceeding of the 16th IEEE International Symposium on High Assurance Systems Engineering (HASE), Daytona Beach Shores, FL, 2015: 207-214.

王娟, 王萍. 一种自适应数据逐层分解的Reed-Solomon码迭代纠错方法及应用[J]. 电子与信息学报, 2015, 37(5): 1173-1179. doi: 10.11999/JEIT140907.

WANG Juan and WANG Ping. An adaptive Reed-Solomon iterative correction method based on data layer-wise decomposition and its application[J]. Journal of Electronics Information Technology, 2015, 37(5): 1173-1179. doi: 10.11999/JEIT140907.

Dimakis A G, Godfrey P B, Wainwright M, et al. Network coding for distributed storage systems[J]. IEEE Transactions on Information Theory, 2010, 56(9): 4539-4551. doi: 10.1109 /TIT.2010.2054295.

Toni E. Codes between MBR and MSR points with exact repair property[J]. IEEE Transactions on Information Theory, 2014, 60(11): 6993-7005. doi: 10.1109/TIT.2014. 2351252.

郭晓, 张更新, 徐任晖, 等. 一种用于RaptorQ码的降维快速译码算法[J]. 电子与信息学报, 2015, 37(6): 1310-1316. doi: 10.11999/JEIT141037.

GUO Xiao, ZHANG Gengxin, XU Renhui, et al. Fast decoding algorithm for RaptorQ code using matrix dimensionality reduction[J]. Journal of Electronics Information Technology, 2015, 37(6): 1310-1316. doi: 10. 11999/JEIT141037.

Byers J W, Luby M, and Mitzenmacher M A. Digital fountain approach to asynchronous reliable multicast[J]. IEEE Journal on Selected Areas in Communications, 2002, 20(3): 1528-1540. doi: 10.1109/JSAC.2002.803996.

LIN Yunfeng, LIANG Ben, and LI Baochun. Data persistence in large-scale sensor networks with decentralized fountain codes[C]. Proceeding of the 26th IEEE International Conference on Computer Communications (INFOCOM), Anchorage, AK, 2007: 1658-1666.

Tzeveleksa L, Oikonomou K, and Stavrakakis I. Random walk with jumps in large-scale random geometric graphs[J]. Computer Communications, 2010, 33(13): 1505-1514. doi: 10.1016/j.comcom.2010.01.026.

LIANG Junbin, WANG Jianxin, and CHEN Jianer. An overhearing-based scheme for improving data persistence in wireless sensor networks[C]. Proceeding of the IEEE International Conference on Communications (ICC), Cape Town, South Africa, AK, 2010: 1-5.

KONG Zhenning, Aly S A, and Soljanin E. Decentralized coding algorithms for distributed storage in wireless sensor networks[J]. IEEE Journal on Selected Areas in Communications, 2010, 28(2): 261-267. doi: 10.1109/JSAC. 2010.100215.

Avin C and Krishnamachari B. The power of choice in random walks: an empirical study[J]. Computer Networks, 2008, 52(1): 44-60. doi: 10.1016/j.comnet.2007.09.012.

Abdulhussein A, Oka A, and Nguyen T T. Rateless coding for hybrid free-space optical and radio-frequency communications[J]. IEEE Transactions on Wireless Communications, 2010, 9(3): 907-913. doi: 10.1109/TWC. 2010.03.090108.

Gianini G and Damiani E. The cover time of neighbor- avoiding gossiping on geometric random networks[C]. Proceeding of the 7th IEEE International Conference on Digital Ecosystems and Technologies (DEST), Menlo Park, CA, 2013: 7-12.

施引文献

资源附件(0)

访问统计