双单播网络编码的构造方法

蒲保兴; 莫智懿

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

您当前的位置：

首页 >

文章列表页 >

双单播网络编码的构造方法

学术论文 | 更新时间：2024-06-05

- 双单播网络编码的构造方法
- Construction method of double unicast network coding
- 通信学报 2020年41卷第9期页码：92-103
- 作者机构：
  
  梧州学院大数据与软件工程学院，广西梧州 543002
- 作者简介：
  
  [ "蒲保兴（1965- ），男，湖南邵阳人，博士，梧州学院教授，主要研究方向为网络编码、智能计算" ]
  [ "莫智懿（1984- ），男，湖南益阳人，梧州学院高级工程师，主要研究方向为网络编码" ]
- 基金信息：
  
  广西创新驱动发展专项基金资助项目(AA18118036)
- DOI：10.11959/j.issn.1000-436x.2020139
  中图分类号： TN911
- 网络出版日期：2020-09，
  
  纸质出版日期：2020-09-25
- 稿件说明：
移动端阅览
蒲保兴, 莫智懿. 双单播网络编码的构造方法[J]. 通信学报, 2020,41(9):92-103.

Baoxing PU, Zhiyi MO. Construction method of double unicast network coding[J]. Journal on communications, 2020, 41(9): 92-103.
蒲保兴, 莫智懿. 双单播网络编码的构造方法[J]. 通信学报, 2020,41(9):92-103. DOI： 10.11959/j.issn.1000-436x.2020139.

Baoxing PU, Zhiyi MO. Construction method of double unicast network coding[J]. Journal on communications, 2020, 41(9): 92-103. DOI： 10.11959/j.issn.1000-436x.2020139.

摘要

为在双单播网络中运用网络编码技术进行数据传输，提出了一种双单播网络编码的构造方法。所提方法在源点实施预编码策略，采用随机线性网络编码方法并结合多目标优化进化算法来设计各信道的局部编码向量；在宿点运用矩阵零空间的基向量来消除部分信息干扰，再运用二级预编码策略来控制源点的发送速率，从而能够解码。所提方法不仅能确定双单播网络编码的近似可达信息率区域，还能为可达信息率区域中的每一向量构造可行的传输方案。理论推导与仿真计算表明了所提方法的有效性。

Abstract

In order to use network coding technology for data transmission in double unicast network

a construction method of double unicast network coding was proposed.The pre-coding strategy was implemented at each source node

the random linear network coding combined to the multi-objective optimization evolutionary algorithm was adopted to design the local coding vector of each channel.At the each sink node

the base vector of zero space of matrix was used to eliminate some information interference

and then the two-level pre-coding strategy was used to control the transmission rate at source.Thus

each sink node could be decoded successfully.With the proposed method

the approximate reachable information rate region of double unicast network coding could be determined and the transmission scheme for each vector in the reachable information rate region could be designed.Theoretical derivation and simulation calculation show the effectiveness of the proposed method.

关键词

Keywords

references

KOETTER R , MEDARD M . An algebraic approach to network coding [J ] . IEEE/ACM Transactions on Networking , 2003 , 11 ( 5 ): 782 - 795 .

JAGGI S , SANDERS P , CHOU P A , et al . Polynomial time algorithms for multicast network code construction [J ] . IEEE Transactions on Information Theory , 2005 , 51 ( 6 ): 1973 - 1982 .

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 .

YEUNG R W , LI S Y R , CAI N , et al . Network coding theory part II:multiple source [J ] . Communications ＆ Information Theory , 2005 , 2 ( 5 ): 330 - 381 .

金振坤 , 黄佳庆 , 程文青 . 多单播模型下的网络编码研究 [J ] . 小型微型计算机系统 , 2012 , 33 ( 5 ): 1023 - 1028 .

JIN Z K , HUANG J Q , CHENG W Q . Survey of network coding for multiple unicast model [J ] . Journal of Chinese Computer Systems , 2012 , 33 ( 5 ): 1023 - 1028 .

DOUGHERTY R , ZEGER K . Nonreversibility and equivalent constructions of multiple-unicast networks [J ] . IEEE Transactions on Information Theory , 2006 , 52 ( 11 ): 5067 - 5077 .

KAMATH S , ANANTHARAM V , TSC D , et al . The two-unicast problem [J ] . IEEE Transactions on Information Theory , 2018 , 64 ( 5 ): 3865 - 3882 .

HUANG S , RAMAMOORTHY A . An achievable region for the double unicast problem based on a minimum cut analysis [J ] . Transactions on Communications , 2013 , 61 ( 7 ): 2890 - 2899 .

XU X,LI Z Y , LIANG G Y , TRACEY H . An achievable region for double-unicast networks with linear network coding [J ] . IEEE Transactions on Communications , 2014 , 62 ( 10 ): 3621 - 3630 .

BIDOKHTI S S , PRABHAKARAN V M , DIGGAVI S N . On multicasting nested message sets over combination networks [C ] // Information Theory Workshop . Piscataway:IEEE Press , 2012 : 2741 - 2749 .

DOUGHERTY R , FREILING C , ZEGER K . Insufficiency of linear coding in network information flow [J ] . IEEE Transactions on Information Theory , 2005 , 51 ( 8 ): 2745 - 2759 .

WANG C C , SHROFF N B . Pairwise intersession network coding on directed networks [J ] . IEEE Transactions on Information Theory , 2012 , 56 ( 8 ): 3879 - 3900 .

KAMATH S U , TSE D N C , ANANTHARAM V . Generalized network sharing outer bound and the two-unicast problem [C ] // International Symposium on Network Coding . Piscataway:IEEE Press , 2011 : 285 - 291 .

ZENG W , CADAMBE V , MEDARD M . On the tightness of the generalized network sharing bound for the two-unicast-Z network [C ] // IEEE International Symposium on Information Theory . Piscataway:IEEE Press , 2013 : 365 - 369 .

SHOMORONY I , AVESTIMEHR A S . A generalized cut-set bound for deterministic multi-flow networks and its applications [C ] // 2014 IEEE International Symposium on Information Theory . Piscataway:IEEE Press , 2014 : 271 - 275 .

ZENG W , CADAMBE V R , MEDARD M . An edge reduction lemma for linear network coding and an application to two-unicast networks [C ] // 2012 50th Annual Allerton Conference on Communication,Control,and Computing . Piscataway:IEEE Press , 2012 : 509 - 516 .

GANAL A E , COSTA M H M . The capacity region of a class of deterministic interference channels [J ] . IEEE Transactions on Information Theory , 1982 , 28 ( 5 ): 343 - 346 .

蒲保兴 , 杨路明 , 王伟平 . 线性网络编码的导出与扩展 [J ] . 软件学报 , 2011 , 22 ( 3 ): 558 - 571 .

PU B X , YANG L M , WANG W P . Generation and extension of linear network coding [J ] . Journal of Software , 2011 , 22 ( 3 ): 558 - 571 .

YEUNG R W . Information theory and network Coding [M ] . New York : SpringerPress , 2008 : 56 - 68 .

BERNSTEIN D S . Matrix mathematics:theory,facts and formulas [M ] . New Jersey : Princeton University PressPress , 2009 .

KIM M , MURIEL M , TRASLOV D . An evolutionary approach to inter-session network coding [C ] // IEEE INFOCOM 2009 - The 28th Conference on Computer Communication . Piscataway:IEEE Press , 2009 : 450 - 458 .

蒲保兴 , 杨路明 , 王伟平 . 最优线性网络编码的分布式构造方法 [J ] . 系统工程与电子技术 , 2009 , 31 ( 11 ): 2761 - 2766 .

PU B X , YANG L M , WANG W P . Distributed construction of optimal linear network coding [J ] . Systems Engineering and Electronics , 2009 , 31 ( 11 ): 2761 - 2766 .

谢金星 , 邢文训 , 王振波 . 网络优化 [M ] . 北京：清华大学出版社 , 2009 ： 79 - 82 .

XIE J X , XING W X , WANG Z B . Network optimization [M ] . Beijing : Tsinghua University PressPress , 2009 : 79 - 82 .

浏览量

447

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

可伸缩视频流的安全网络编码方案