Method of Time Series Similarity Measurement Based on Dynamic Time Warping

With the rapid development of mobile communication all over the world,the similarity of mobile phone communication data has received widely attention due to its advantage for the construction of smart cities.Mobile phone communication data can be regarded as a type of time series and dynamic time warping(DTW)and derivative dynamic time warping(DDTW)are usually used to analyze the similarity of these data.However,many traditional methods only calculate the distance between time series while neglecting the shape characteristics of time series.In this paper,a novel hybrid method based on the combination of dynamic time warping and derivative dynamic time warping is proposed.The new method considers not only the distance between time series,but also the shape characteristics of time series.We demonstrated that our method can outperform DTW and DDTW through extensive experiments with respect to cophenetic correlation.

A novel and effective multi-constrained QoS routing scheme in WMNs

Multi-constrained quality of service(QoS)routing aims at finding an optimal path that satisfies a set of QoS parameters,as an NP complete problem,which is also a big challenge for wireless mesh networks(WMNs).Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this problem.However,existing solutions,most of which suffered either from excessive computational complexities or from low performance,were proposed only for wired networks and cannot be used directly in wireless mesh networks.In this paper,we propose a novel routing scheme based on mean field annealing(MFA-RS)to solve this problem.MFA-RS first uses a function of two QoS parameters,wireless link’s delay and transmission success rate as the cost function,and then seeks to find a feasible path by MFA.Because MFA-RS uses a set of deterministic equations to replace the stochastic process in simulated annealing(SA)and uses saddle point approximation in the calculation of the stationary probability distribution at equilibrium,the convergence time is much less than the routing scheme based on SA(SA-RS).Simulation results demonstrate that MFA-RS is an effective algorithm and is very fit for WMNs.