Journal on Communications ›› 2021, Vol. 42 ›› Issue (5): 216-229.doi: 10.11959/j.issn.1000-436x.2021050

• Correspondences • Previous Articles    

Research on linear solvability of network coding based cooperative recovery scheme

Jun YIN1,2, Xueqi SHA2, Lei WANG1,2, Dengyin ZHANG1,2, Yuwang YANG3   

  1. 1 Jiangsu Key Laboratory of Broadband Wireless Communication, Nanjing University of Posts and Telecommunications, Nanjing 210003, China
    2 School of Internet of Things, Nanjing University of Posts and Telecommunications, Nanjing 210003, China
    3 School of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing 210004, China
  • Revised:2021-02-07 Online:2021-05-25 Published:2021-05-01
  • Supported by:
    The National Natural Science Foundation of China(61971235);The National Natural Science Foundation of China(61801236);Basic Research Foundation of China(JCKY201760xxx003);Basic Research Foundation of China(JCKY201860xxx001);Nanjing University of Posts and Telecommunications Science Foundation(NY217148);Nanjing University of Posts and Telecommunications Science Foundation(NY219111);Research Program of Suzhou(SYG201826)

Abstract:

The linear solvability of network coding based cooperative recovery/repair (CR) scheme was studied.Specifically, the solvability analysis model for network coding based CR scheme was established, the upper and lower bounds of the probability for any receiver to decode all original information under arbitrary order of Galois coding field were proposed and proved, and an on-line solvability judgement algorithm was designed by improvement of Gauss-Jordan algorithm.Numerical results validate the compactness of the proposed upper and lower bounds as well as the short-time decoding waiting delay of the improved Gauss-Jordan algorithm.Node deployment experiments show that the decoding complexity of the improved Gauss Jordan algorithm is reduced by 35% compared with the traditional Gauss algorithm.

Key words: cooperative recovery/repair, network coding, linear solvability, improved Gauss-Jordan algorithm

CLC Number: 

No Suggested Reading articles found!