基于多尺度熵方法的网络流量复杂度分析.

This paper used the multiscale entropy analysis method to analyze the relationship. It quantitatively analyzed the network traffic complexities of the classical routing protocol AODV and the routing protocols AODV-FABL and AODV-CM, which were improved from AODV, at different time scales. Analysis results confirm that the network traffic complexity of those routing protocols are all higher and have large fluctuation in smaller time scales, and are all lower and shows the long-range dependence in larger time scales. This paper also pointed and analyzed the relationship between the network traffic complexity of those routing protocols and the changing speed of network topology. [ABSTRACT FROM AUTHOR]