期刊文献+

高效自适应的抗污染攻击网络编码传输方案 被引量:1

Efficient and adaptive network coding transmission scheme against pollution resistance
下载PDF
导出
摘要 针对中间节点对收到的所有编码包进行验证浪费网络资源和目的节点解码速率慢等问题进行研究,提出一种高效自适应的抗污染攻击网络编码传输方案-EANC(efficient and adaptive network coding transmission scheme against pollution attack)。EANC方案在数据分组编码阶段,利用按照网络编码的时间和空间特性构造的线性子空间签名方案准确地验证数据分组是否被污染从而有效控制污染数据分组的传播,并且能使中间节点调节验证步骤使之自适应于当前网络的污染程度,从而提高验证效率;在目的节点解码阶段,EANC方案利用目的节点重传恢复机制降低解码恢复时延。仿真结果表明,EANC方案能够减少子空间的签名长度并且降低目的节点解码恢复的平均时延。 In order to solve the problem that intermediate node verifies all the encoded packets wasting the network resources and the slow decoding rate of the destination node,this paper proposed an efficient and adaptive network coding transmission scheme which called EANC.In data packet encoding stage,EANC scheme used network encoding time and space characteristics to structure linear subspace signature scheme,the scheme was accurate verification of data packets effectively and control the spread of pollution data packets,EANC scheme could make the middle nodes adjust detection step adapt to the current network pollution level and improved verification efficiency;at the destination node decoding stage,EANC scheme used the destination node packet loss retransmission mechanism to reduce the decoding delay.The simulation results show that the EANC scheme can reduce the time of the linear subspace signature and reduce the average time delay of the decoding and recovery of the destination node.
作者 姚玉坤 吕盼成 王宇 Yao Yukun;Lyu Pancheng;Wang Yu(Key Laboratory of Mobile Communications Technology of Chongqing,Chongqing University of Posts&Telecommunications,Chongqing 400065,China)
出处 《计算机应用研究》 CSCD 北大核心 2018年第3期879-883,共5页 Application Research of Computers
基金 重庆市科委自然科学基金资助项目(cstc2012jj A40040) 重庆市基础与前沿研究计划资助项目(cstc2015jcyj BX0085)
关键词 网络编码 安全 污染攻击 自适应验证 重传恢复 network coding secure pollution attack adaptive authentication retransmission recovery
  • 相关文献

参考文献6

二级参考文献134

  • 1罗明星,杨义先,王励成,钮心忻.抗窃听的安全网络编码[J].中国科学:信息科学,2010,40(2):371-380. 被引量:10
  • 2王张宜,李波,张焕国.Hash函数的安全性研究[J].计算机工程与应用,2005,41(12):18-19. 被引量:26
  • 3曾丽华,熊璋,张挺.Key值更新随机Hash锁对RFID安全隐私的加强[J].计算机工程,2007,33(3):151-153. 被引量:34
  • 4Ahlswede R, Cai N, Li SYR, Yeung RW. Network information flow. IEEE Trans. on Information Theory, 2000,46(4):1204-1216.
  • 5Jain K, Mahdian M, Salavatipour MR. Packing Steiner trees, In: Prec. of the 10th Annual ACM-SIAM Syrup. on Discrete Algorithms (SODA). New York: ACM Press, 2003. 266-274.
  • 6Chen S, Gunluk O, Yener B. The multicast packing problem. IEEE/ACM Transactions on Networking, 2000,8(3):311-318.
  • 7Li SYR, Yeung RW, Cai N. Linear network coding. IEEE Trans. on Information Theory, 2003,49(2):371-381.
  • 8Koetter R, Medard M. An algebraic approach to network coding. IEEE/ACM Trans. on Networking, 2003,11(5):782-795.
  • 9Jaggi S, Sanders P, Chou PA, Effros M, Egner S, Jain K, Tolhuizen L. Polynomial time algorithms for multicast network code construction. IEEE Trans. on Information Theory, 2005,51(6):1973-1982.
  • 10Ho T, Medard M, Koetter R, Shi J, Effros M, Karger D. On randomized network coding. In: Proc. of the 41st Annual Allerton Conf. on Communication, Control, and Computing. 2003.

共引文献51

同被引文献3

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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