期刊文献+

MANET中基于二次置换多项式的滑动窗口网络编码算法 被引量:1

Quadratic Permutation Polynomials-Based Sliding Window Network Coding Algorithm in MANET
原文传递
导出
摘要 针对移动自组网络(mobile Ad hoc network,MANET)的数据传输机制和数据吞吐量问题,提出了一种MANET中基于二次置换多项式的滑动窗口网络编码(quadratic permutation polynomials-based sliding window network coding,QPPSWNC)算法。该算法根据QPP理论优化滑动窗口的大小,对进入滑动窗口中的分组进行网络编码操作,恢复原始数据分组,降低每个滑动窗口的编码/解码复杂性。利用NS-2仿真器进行了仿真实验,分析本文算法性能。仿真实验结果表明,相较于典型的Block-LDPC和ACODI算法,本文算法可以优化MANET中编码开销、解码时延和网络吞吐量等性能。 Aiming at the data transmission mechanism and data throughput of mobile Ad hoc network(MANET),this paper pro⁃poses a quadratic permutation polynomials-based sliding window network coding(QPP-SWNC)algorithm in MANETs.Accord⁃ing to the QPP theory,this algorithm optimizes the size of the sliding window,carries out network coding operation on the packets entering the sliding window,restores the original data packet,and reduces the encoding/decoding complexity of each sliding win⁃dow.The performance of the proposed algorithm was studied using NS-2 software.Simulation results show that compared with the typical Block-LDPC and ACODI algorithms,the proposed algorithm can optimize the performance of MANET,such as the encoding overhead,decoding delay and network throughput.
作者 孙宝林 桂超 宋莺 刘雄 张芮凡 黄成丽 SUN Baolin;GUI Chao;SONG Ying;LIU Xiong;ZHANG Ruifan;HUANG Chengli(School of Information and Communication Engineering,Hubei University of Economics,Wuhan 430205,Hubei,China;School of Computer Science and Information Engineering,Hubei University,Wuhan 430062,Hubei,China;Computer Engineering Department,Guangdong Youth Vocational College,Guangzhou 510507,Guangdong,China)
出处 《武汉大学学报(理学版)》 CAS CSCD 北大核心 2019年第6期547-553,共7页 Journal of Wuhan University:Natural Science Edition
基金 国家自然科学基金资助项目(61572012) 湖北省自然科学基金资助项目(2018CFB661,2017CFB677)
关键词 移动自组网络 网络编码 二次置换多项式 滑动窗口 mobile Ad hoc network(MANET) network coding quadratic permutation polynomials(QPP) sliding window
  • 相关文献

参考文献3

二级参考文献19

  • 1徐海波,刘海蛟,荆继武,杜皎.一种正形置换的逐位递增构造方法[J].中国科学院研究生院学报,2006,23(2):251-256. 被引量:8
  • 2任金萍,吕述望.正形置换的枚举与计数[J].计算机研究与发展,2006,43(6):1071-1075. 被引量:17
  • 3Lohrop M.Block Substitution Using Orthormorphic Mapping[J].Advances in Applied Mathematics,1995,16(1):59-71.
  • 4Mullen G L.Permutation Polynomials:a Matrix Analogue of Schur's Conjecture and a Surey of Recent Results[J].Finite Fields and Their Applications,1995,1:242-258.
  • 5Lidl R,Niederreiter H.Finite Fields,Encyclopedia of Mathematics and Its Application[M].London:Addison-Wesley Publishing Company,1983.
  • 6F61ix G M, Gregorio M P. Towards pre-standardiza-tion of trust and reputation models for distributed and heterogeneous systems [-J]. Computer Standards & Interfaces, 2010,32(4) : 185-196.
  • 7Feldman J, Malkin T, Stein C, et al. On the Capacity of Secure Network Coding[EB/OL]. [-2007-06-08]. ht- t p : / / people, csail, mit. edu/ jon f eld / pubs/ s flow Alle- rton04 final. Pd f .
  • 8Rouayheb S Y E, Soljanin E. On Wiretap Network H [C]//IEEE Intl Syrup Inf Theory. Nice: IEEE Press, 2007 : 551-555.
  • 9Silva D, Kschischang F R. Security for Wiretap Net- works Via Rank-Met ric Codes[C]//IEEE Intl Syrup Inf Theory. Toronto : IEEE Press, 2008 : 176-180.
  • 10Chanl T, Grant A. Capacity Bounds for Secure Net- work Coding[C]//Communication Theory Workshop. Australian IEEE Press, 2008 : 95-100.

共引文献10

同被引文献4

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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