期刊文献+

一种改进的多源组播网络的线性网络编码构造方案 被引量:1

Construction Project of Linear Network Coding Improved by Multi-source Cast Network
原文传递
导出
摘要 在传统的线性网络编码算法中,网络中间节点需要执行编码操作,这提高了网络吞吐量,但也增加了编码和解码的计算成本。根据网络中间节点的入度与出度之间的关系,将网络中间节点划分为编码节点和非编码节点,并且最小化网络编码信道的数量,进行随机线性网络编码。采用粒子群优化算法对多源组播网络进行子图划分为多个单源组播网络,各单源组播网络具有相互约束的组播容量,求解包含每个单源组播网络组播能力的Pareto解集。根据权重选择解向量用于改进的线性网络编码构造。仿真测试结果表明,不仅组播容量达到理论最大值,而且降低了时空复杂度,提高了网络的容错性和鲁棒性。 In traditional algorithm of linear network coding,intermediate nodes should execute coding operation so that it improves network throughputs but increases the cost of encoding and decoding.According to the relationship between the input and output of intermediate nodes,encoding nodes and decoding nodes can be classified and the number of coding channels can be minimized to have a random linear network coding.The particle swarm optimization method can divide multi-source cast network into several single source cast networks,which constrain the cast capacity each other and solve the Pareto solution set including cast capacities with several single source cast networks.And the solution vector of weight selection can be used to improve the construction of linear network coding.The result of simulation testing shows that the cast capacities can not only reach the maximum but also decrease the complexity of time and space and improve the fault tolerance and robustness.
作者 卢花 高海波 张诚 冯新 Lu Hua;Gao Haibo;Zhang Cheng;Feng Xin(Department of Electric Engineering of Hunan International Economics University,Changsha Hunan 410205)
出处 《湖南涉外经济学院学报》 2019年第3期5-10,共6页 Journal of Hunan International Economics University
基金 湖南省教育厅科学研究优秀青年项目(No.18B524) 湖南涉外经济学院校级科学研究一般项目(湘外经院科字No.2017B07)
关键词 线性网络编码 多源组播 多目标优化 粒子群优化算法 linear network coding multi-source cast multi-objective optimization algorithm of particle swarm optimization
  • 相关文献

参考文献5

二级参考文献46

  • 1毕荣山,杨霞,谭心舜,项曙光.基于动态Pareto解集的微粒群优化算法及其在多目标规划中的应用[J].计算机工程与应用,2004,40(32):85-88. 被引量:8
  • 2罗军舟,陈晴.异构网络中的分层组播:问题与解决方案[J].东南大学学报(自然科学版),2005,35(6):984-988. 被引量:6
  • 3Ahlswede R, Cai N, Li S-R, et al. Network information flow [J]. IEEE Transactions on Information Theory, 2000, 46(4): 1204-1216.
  • 4Li S-Y R, Yeung R W, Cai N. Linear network coding[J]. IEEE Transactions on Information Theory, 2003, 49(2): 371-381.
  • 5Koetter R, Medard M. An algebraic approach network coding[J]. IEEE/ACM Transactions on Networking, 2003, 11 (5): 782-795.
  • 6Jaggi S, Sanders P, Chou A, et al. Polynomial time algorithms for multicast network code construction[J]. IEEE Transactions on Information Theroy, 2005,51 (6) : 1973-1982.
  • 7Ho T, Medard M, Koetter R, et al. A random linear network coding approach to multicast[J]. IEEE Transactions on Information Theory, 2006,62(10) :4413-4430.
  • 8Wang Beng-shan. Discrete mathematics[M]. Changsha: National University of Defenee Technology Press, 2004.
  • 9Yeung R W, Li S-Y, Cai N, et al. Network coding theory[J]. Foundation and Trends in Communications and Information Theory, 2005,2(4) :241-381.
  • 10Yan X J, Yang J, Zhang Z. An outer bound for multisource muhisink network coding with minimum cost consideration[J]. IEEE Transactions on Information Theory, 2006,52(6):2373- 2385.

共引文献8

同被引文献6

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部