基于预测的机会式网络编码

发布时间：2018-04-29 21:12

本文选题：机会式网络编码 + 预测　；参考：《通信学报》2013年04期

【摘要】：针对理论网络编码在实际应用上的缺陷,以及现有机会式网络编码完全依赖于消息偷听导致应用场合的局限性,以完全不同于网络编码优化问题的思路,提出了基于预测的机会式网络编码的方法。其主要思想是:基于网络流量的自相似性,利用EMD(经验模式分解)和ARMA(自回归滑动平均)预测下一个报文的到达时间,综合计算编码时间、为了编码而等待的时间、传输时间等要素,从而决定是否编码。推导出了网络编码在不同情况下要实现吞吐量正增益可以等待的时间上界。仿真实验结果显示,在吞吐量上,提出的方法相对于理论网络编码平均提高15%左右,相对于当前的存储转发平均提高21%左右。在提高吞吐量的基础上,提出方法也可有效地降低网络的能量消耗。
[Abstract]:Aiming at the defects of theoretical network coding in practical application, and the limitation of existing opportunistic network coding due to message eavesdropping, it is completely different from the optimization problem of network coding. An opportunistic network coding method based on prediction is proposed. The main idea is: based on the self-similarity of network traffic, EMD (empirical Mode decomposition) and ARMA (autoregressive moving average) are used to predict the arrival time of the next message. Transmission time and other elements, thus determining whether or not to code. The upper bound of the time that the network code can wait to achieve the positive gain of throughput in different cases is derived. The simulation results show that the proposed method increases the throughput by about 15% compared with the theoretical network coding and 21% compared with the current storage and forwarding. On the basis of improving throughput, the proposed method can also effectively reduce the energy consumption of the network.
【作者单位】：广州大学电子信息工程系;中山大学电子通信工程系;
【基金】：国家自然科学基金资助项目广东联合基金重点项目(U0735002) 国家自然科学基金资助项目(60970146,61202271) 广东省自然科学基金资助项目(S2011040004068,S2012040007184)~~
【分类号】：TP393.02

【参考文献】