Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Duan, X., Jia, C., Liu, C.: Intrusion detection method based on the hierarchical hidden Marco model and variable-length semantic pattern. Journal of Communication 31(3), 109–114 (2010)
Lee, W., Xiang, D.: Information theoretic measures for anomaly detection. In: Proceedings of the 2001 IEEE Symposium on Research Security and Privacy, Oakland, California, pp. 130–134 (2001)
Murakami, M., Honda, N.: A study on the modeling ability of the IDS method: A soft computing technique using pattern-based information processing 45(3), 470–487 (2007)
Zhang, Y., Xu, J., Chang, G., Jia, J.: Two-way fast string matching algorithm in Ad Hoc Network. Computer Science 37(10), 42–47 (2010)
Alicherry, M., Muthuprasanna, M., Kumar, V.: High Speed Pattern Matching for Network IDS/IPS. In: Proceedings the 2006 IEEE International Conference on Network Protocols, NW Washington, DC, USA, pp. 187–196 (2006)
Sheu, T.-F., Huang, N.-F., Leeb, H.-P.: Hierarchical multi-pattern matching algorithm for network content inspection. Information Sciences 178(14), 2880–2898 (2010)
Charras, C., Lecroq, T.: Handbook of exact string—matching algorithms [DB/OL] (May 2010), http://www.igm.univ-mlv.Fr/qecroq/tring/
Sunday, D.M.: A very fast substring search algorithm. Communications of the ACM 33(8), 132–142 (1990)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag GmbH Berlin Heidelberg
About this chapter
Cite this chapter
Ying, Z., Guiran, C., Jie, J. (2012). A String Matching Algorithm Based on Real Scaling. In: Qian, Z., Cao, L., Su, W., Wang, T., Yang, H. (eds) Recent Advances in Computer Science and Information Engineering. Lecture Notes in Electrical Engineering, vol 125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25789-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-25789-6_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25788-9
Online ISBN: 978-3-642-25789-6
eBook Packages: EngineeringEngineering (R0)