Construction method of double unicast network coding

被引：0
|
作者：
Pu B. [1 ]
Mo Z. [1 ]
机构：
[1] School of Data Science and Software Engineering, Wuzhou University, Wuzhou
来源：
Tongxin Xuebao/Journal on Communications | 2020年 / 41卷 / 09期
关键词：
Double unicast network coding; Pre-coding strategy of source node; Random linear network coding; Reachable information rate region; Zero space of matrix;
D O I：
10.11959/j.issn.1000-436x.2020139
中图分类号：
学科分类号：
摘要：
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. © 2020, Editorial Board of Journal on Communications. All right reserved.
引用
收藏
页码：92 / 103
页数：11
相关论文
共 23 条
  • [1] KOETTER R, MEDARD M., An algebraic approach to network coding, IEEE/ACM Transactions on Networking, 11, 5, pp. 782-795, (2003)
  • [2] JAGGI S, SANDERS P, CHOU P A, Et al., Polynomial time algorithms for multicast network code construction, IEEE Transactions on Information Theory, 51, 6, pp. 1973-1982, (2005)
  • [3] HO T, MEDARD M, KOETTER R, Et al., A random linear network coding approach to multicast, IEEE Transactions on Information Theory, 52, 10, pp. 4413-4430, (2006)
  • [4] YEUNG R W, LI S Y R, CAI N, Et al., Network coding theory part II: multiple source, Communications & Information Theory, 2, 5, pp. 330-381, (2005)
  • [5] JIN Z K, HUANG J Q, CHENG W Q., Survey of network coding for multiple unicast model, Journal of Chinese Computer Systems, 33, 5, pp. 1023-1028, (2012)
  • [6] DOUGHERTY R, ZEGER K., Nonreversibility and equivalent constructions of multiple-unicast networks, IEEE Transactions on Information Theory, 52, 11, pp. 5067-5077, (2006)
  • [7] KAMATH S, ANANTHARAM V, TSC D, Et al., The two-unicast problem, IEEE Transactions on Information Theory, 64, 5, pp. 3865-3882, (2018)
  • [8] HUANG S, RAMAMOORTHY A., An achievable region for the double unicast problem based on a minimum cut analysis, Transactions on Communications, 61, 7, pp. 2890-2899, (2013)
  • [9] XU X, LI Z Y, LIANG G Y, TRACEY H., An achievable region for double-unicast networks with linear network coding, IEEE Transactions on Communications, 62, 10, pp. 3621-3630, (2014)
  • [10] BIDOKHTI S S, PRABHAKARAN V M, DIGGAVI S N., On multicasting nested message sets over combination networks, Information Theory Workshop, pp. 2741-2749, (2012)
123