Two-way Fast String Matching Algorithm in Ad hoc Networks

In a network intrusion detection system,the original AC algorithm adopts one-way matching.The comparing time will increase as the number of samples increases.This paper presented an efficient multi-pattern matching algorithm,a bi-directional fast string matching algorithm.The algorithm uses finite automata and forward-backward two-way matching.Compared with the original one-way matching algorithm,the intrusion detection rate is increased by 3 times.The performance of the algorithm was analyzed and compared with other algorithms.Simulation results show that this algorithm can improve the efficiency and detection rate.