A String Matching Algorithm Based on Real Scaling

摘要

A good intrusion detection algorithm is important not only in traditional networks, but also in Ad Hoc networks. This paper proposes a novel intrusion detection algorithm based on the real scale of the string matching. Based on properties of Ad Hoc networks, we design a real indexing tree which gives a complete implementation of the algorithm based on the real scale of the string matching. The algorithm can find out all the possible text scaling, and identify all the possible strings with the text scaling. In order to evaluate efficiencies of our algorithms, we use an evaluation data set, widely used in intrusion detection, to test our algorithms. The experimental results show that our algorithm is superior over other sate of art algorithms, and Ad Hoc network security is improved.