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

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

Abstract

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.

Key words: double unicast network coding, random linear network coding, reachable information rate region, pre-coding strategy of source node, zero space of matrix

CLC Number:

TN911

Baoxing PU,Zhiyi MO. Construction method of double unicast network coding[J]. Journal on Communications, 2020, 41(9): 92-103.

Figures/Tables 5

References 23

[1]	KOETTER R , MEDARD M . An algebraic approach to network coding[J]. IEEE/ACM Transactions on Networking, 2003,11(5): 782-795.
[2]	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.
[3]	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.
[4]	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.
[5]	金振坤, 黄佳庆, 程文青 . 多单播模型下的网络编码研究[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.
[6]	DOUGHERTY R , ZEGER K . Nonreversibility and equivalent constructions of multiple-unicast networks[J]. IEEE Transactions on Information Theory, 2006,52(11): 5067-5077.
[7]	KAMATH S , ANANTHARAM V , TSC D ,et al. The two-unicast problem[J]. IEEE Transactions on Information Theory, 2018,64(5): 3865-3882.
[8]	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.
[9]	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.
[10]	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.
[11]	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.
[12]	WANG C C , SHROFF N B . Pairwise intersession network coding on directed networks[J]. IEEE Transactions on Information Theory, 2012,56(8): 3879-3900.
[13]	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.
[14]	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.
[15]	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.
[16]	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.
[17]	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.
[18]	蒲保兴, 杨路明, 王伟平 . 线性网络编码的导出与扩展[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.
[19]	YEUNG R W . Information theory and network Coding[M]. New York: SpringerPress, 2008: 56-68.
[20]	BERNSTEIN D S . Matrix mathematics:theory,facts and formulas[M]. New Jersey: Princeton University PressPress, 2009.
[21]	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.
[22]	蒲保兴, 杨路明, 王伟平 . 最优线性网络编码的分布式构造方法[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.
[23]	谢金星, 邢文训, 王振波 . 网络优化[M]. 北京：清华大学出版社, 2009： 79-82.
	XIE J X , XING W X , WANG Z B . Network optimization[M]. Beijing: Tsinghua University PressPress, 2009: 79-82.

Metrics

Recommended 0

No Suggested Reading articles found!

Construction method of double unicast network coding

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 5

References 23

Related Articles 2

Metrics

Recommended 0

[1]	. Secure network coding scheme for scalable video streaming [J]. Journal on Communications, 2013, 34(5): 21-191.
[2]	Xi-meng LIU,Guang-jun LIU,Jian-feng MA,Jin-bo XIONG. Secure network coding scheme for scalable video streaming [J]. Journal on Communications, 2013, 34(5): 184-191.