通信学报 ›› 2021, Vol. 42 ›› Issue (5): 216-229.doi: 10.11959/j.issn.1000-436x.2021050

• 学术通信 • 上一篇    

基于网络编码的协作恢复机制线性可解性研究

殷俊1,2, 沙雪琪2, 王磊1,2, 张登银1,2, 杨余旺3   

  1. 1 南京邮电大学江苏省宽带无线通信重点实验室,江苏 南京 210003
    2 南京邮电大学物联网学院,江苏 南京 210003
    3 南京理工大学计算机科学与工程学院,江苏 南京 210004
  • 修回日期:2021-02-07 出版日期:2021-05-01 发布日期:2021-05-01
  • 作者简介:殷俊(1989- ),男,安徽巢湖人,博士,南京邮电大学讲师,主要研究方向为网络编码及其应用
    沙雪琪(2000- ),女,江苏徐州人,南京邮电大学硕士生,主要研究方向为协作通信
    王磊(1986- ),男,安徽马鞍山人,博士,南京邮电大学副教授,主要研究方向为网络编码及其应用
    张登银(1964- ),男,江苏靖江人,博士,南京邮电大学研究员,主要研究方向为现代通信网络、信号与信息处理技术等
    杨余旺(1966- ),男,安徽桐城人,博士,南京理工大学教授,主要研究方向为网络编码、工业物联网等
  • 基金资助:
    国家自然科学基金资助项目(61971235);国家自然科学基金资助项目(61801236);国家基础科研计划基金资助项目(JCKY201760xxx003);国家基础科研计划基金资助项目(JCKY201860xxx001);南邮科研基金资助项目(NY217148);南邮科研基金资助项目(NY219111);苏州创新计划基金资助项目(SYG201826)

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-01 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)

摘要:

针对基于网络编码的协作恢复(CR)机制线性可解性未知问题,建立了CR机制网络编码包的线性可解性的量化分析模型,给出了在任意阶伽罗华编码有限域下接收方解码出所有源数据包的概率上下界,并提出了一种改进Gauss-Jordan的线性可解性在线判定算法。数值实验结果验证了所提上下界的紧密性和改进Gauss-Jordan算法解码的低等待时延特性,节点部署实验显示改进Gauss-Jordan算法较传统Gauss算法解码复杂度降低35%。

关键词: 协作恢复, 网络编码, 线性可解性, 改进Gauss-Jordan算法

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

中图分类号: 

No Suggested Reading articles found!