Research on linear solvability of network coding based cooperative recovery scheme

Jun YIN; Xueqi SHA; Lei WANG; Dengyin ZHANG; Yuwang YANG

doi:10.11959/j.issn.1000-436x.2021050

您当前的位置：

首页 >

文章列表页 >

Research on linear solvability of network coding based cooperative recovery scheme

Correspondences | 更新时间：2024-06-06

- Research on linear solvability of network coding based cooperative recovery scheme
- Journal on Communications Vol. 42, Issue 5, Pages: 216-229(2021)
- 作者机构：
  
  1. 南京邮电大学江苏省宽带无线通信重点实验室，江苏南京 210003
  2. 南京邮电大学物联网学院，江苏南京 210003
  3. 南京理工大学计算机科学与工程学院，江苏南京 210004
- 作者简介：
- 基金信息：
  
  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)
- DOI：10.11959/j.issn.1000-436x.2021050
  CLC： TN92
- Online First：2021-05，
  
  Published：25 May 2021
- 稿件说明：
移动端阅览
Jun YIN, Xueqi SHA, Lei WANG, et al. Research on linear solvability of network coding based cooperative recovery scheme[J]. Journal on Communications, 2021, 42(5): 216-229.
DOI：

Jun YIN, Xueqi SHA, Lei WANG, et al. Research on linear solvability of network coding based cooperative recovery scheme[J]. Journal on Communications, 2021, 42(5): 216-229. DOI： 10.11959/j.issn.1000-436x.2021050.

摘要

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

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.

关键词

Keywords

references

GUO W , FUENTES M , CHRISTODOULOU L , et al . Roads to multimedia broadcast multicast services in 5G new radio [C ] // International Symposium on Broadband Multimedia Systems and Broadcasting,Piscataway:IEEE Press , 2018 : 1 - 5 .

DRESSLER F , KLINGLER F , SOMMER C , et al . Not all VANET broadcasts are the same:context-aware class based broadcast [J ] . IEEE/ACM Transactions on Networking , 2018 , 26 ( 1 ): 17 - 30 .

KARIMI P , SHERMAN M , BRONZINO F , et al . Evaluating 5G multihoming services in the MobilityFirst future Internet architecture [C ] // 2017 IEEE 85th Vehicular Technology Conference . Piscataway:IEEE Press , 2017 : 1 - 5 .

QIU C X , SHEN H Y , SOLTANI S , et al . CEDAR:a low-latency and distributed strategy for packet recovery in wireless networks [J ] . IEEE/ACM Transactions on Networking , 2015 , 23 ( 5 ): 1514 - 1527 .

BENRHAIEM W , HAFID A , SAHU P K . Reliable emergency message dissemination scheme for urban vehicular networks [J ] . IEEE Transactions on Intelligent Transportation Systems , 2020 , 21 ( 3 ): 1154 - 1166 .

PARK J S , GERLA M , LUN D S , et al . Codecast:a network-coding-based ad hoc multicast protocol [J ] . IEEE Wireless Communications , 2006 , 13 ( 5 ): 76 - 81 .

DATSIKA E , ANTONOPOULOS A , ZORBA N , et al . Cross-network performance analysis of network coding aided cooperative outband D2D communications [J ] . IEEE Transactions on Wireless Communications , 2017 , 16 ( 5 ): 3176 - 3188 .

YAN Y , ZHANG B X , LI C . Opportunistic network coding based cooperative retransmissions in D2D communications [J ] . Computer Networks , 2017 , 113 : 72 - 83 .

GOU L , ZHANG G X , BIAN Z G , et al . Minimizing completion time for relay-assisted multicast with instantly decodable network coding [J ] . IEEE Communications Letters , 2016 , 20 ( 3 ): 434 - 437 .

ABOUTORAB N , SADEGHI P , TAJBAKHSH S E . Instantly decodable network coding for delay reduction in cooperative data exchange systems [C ] // 2013 IEEE International Symposium on Information Theory . Piscataway:IEEE Press , 2013 : 3095 - 3099 .

王练 , 王萌 , 任治豪 , 等 . D2D 网络中基于立即可解网络编码的时延最小化重传方案 [J ] . 电子与信息学报 , 2018 , 40 ( 7 ): 1691 - 1698 .

WANG L , WANG M , REN Z H , et al . Delay minimization retransmission scheme based on instantly decodable network coding for D2D communications [J ] . Journal of Electronics ＆ Information Technology , 2018 , 40 ( 7 ): 1691 - 1698 .

FAN Y F , JIANG Y X , ZHU H J , et al . PIE:cooperative peer-to-peer information exchange in network coding enabled wireless networks [J ] . IEEE Transactions on Wireless Communications , 2010 , 9 ( 3 ): 945 - 950 .

XU X L , KUMAR M P , GUAN Y L , et al . Two-phase cooperative broadcasting based on batched network code [J ] . IEEE Transactions on Communications , 2016 , 64 ( 2 ): 706 - 714 .

欧莽 , 汪继文 . VANETs中基于分布式TDMA的协作网络编码方法 [J ] . 华南理工大学学报(自然科学版) , 2020 , 48 ( 1 ): 104 - 113 .

OU M , WANG J W . Cooperative network coding in VANETs based on distributed TDMA [J ] . Journal of South China University of Technology (Natural Science Edition) , 2020 , 48 ( 1 ): 104 - 113 .

AHLSWEDE R , CAI N , LI S Y R , et al . Network information flow [J ] . IEEE Transactions on Information Theory , 2000 , 46 ( 4 ): 1204 - 1216 .

HO T , MEDARD M , KOETTER R , et al . A random linear network coding approach to multicast [J ] . IEEE Transactions on Information Theory , 2006 , 52 ( 10 ): 4413 - 4430 .

TRULLOLS-CRUCES O , BARCELO-ORDINAS J M , FIORE M . Exact decoding probability under random linear network coding [J ] . IEEE Communications Letters , 2011 , 15 ( 1 ): 67 - 69 .

LANEMAN J N , WORNELL G W . Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks [J ] . IEEE Transactions on Information Theory , 2003 , 49 ( 10 ): 2415 - 2425 .

TSE D , VISWANATH P . Fundamentals of wireless communication [M ] . Cambridge : Cambridge University Press , 2005 .

BLÖMER J , KARP R , WELZL E . The rank of sparse random matrices over finite fields [J ] . Random Structures ＆ Algorithms , 1997 , 10 ( 4 ): 407 - 419 .

LI X L , MOW W H , TSANG F L . Rank distribution analysis for sparse random linear network coding [C ] // 2011 International Symposium on Networking Coding . Piscataway:IEEE Press , 2011 : 1 - 6 .

MARRIOT P . Finite Markov chains [R ] . Waterloo:University of Waterloo , 2015 .

王磊 . 网络编码理论与实践 [M ] . 上海 : 上海交通大学出版社 , 2017 .

WANG L . Network coding theory and applications [M ] . ShangHai : ShangHai Jiao Tong University Press , 2017 .

Views

1207

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

HARQ scheme for sparse code multiple access based on network coding

Lightweight privacy protection data auditing scheme for regenerating-coding-based distributed storage

Mimic storage scheme based on regenerated code

Cooperative secret key generation for multi-hop relaying systems in Internet of things

Data update algorithm based on secure network coding in cloud environment

Related Author

Ke LAI

Jing LEI

Wei LIU

Lei WEN

Guangjun LIU

Wangmei GUO

Jinbo XIONG

Ximeng LIU

Related Institution

College of Electronic Science and Technology, National University of Defense Technology

School of Computing, Newcastle University

College of Mathematics and Computer Science, Fuzhou University

College of Mathematics and Informatics, Fujian Normal University

State Key Laboratory of Integrated Services Networks, Xidian University

AI问答

⁰