Enhancing Wireless Intrusion Detection Systems with the All-Ready State Traversal Pattern Matching (ARSTPM) Algorithm

This research introduces the All-Ready State Traversal pattern-matching algorithm to optimize pattern-matching processes within wireless-oriented intrusion detection systems (WIDS). The proposed technique enhances WIDS security by consolidating pseudo-equivalent states during attacks, thereby reducing memory usage and improving pattern-matching performance. The method integrates merged pattern-matching strings with encryption and decryption protocols to fortify data security. Future studies will prioritize optimizing memory address allocation using B or B+ trees. Furthermore, a novel merging finite state machine (FSM) pattern-matching approach is presented to overcome primary memory constraints in embedded devices, minimizing memory footprint while enhancing security. Laboratory tests demonstrate a remarkable 53% speed improvement compared to conventional pattern-matching algorithms. By combining this method with other memory-efficient techniques, memory limitations are addressed; intrusion detection system performance is bolstered, providing a comprehensive solution for secure and efficient pattern matching in WIDS. The implications of this study hold promise for significantly enhancing the efficiency and efficacy of intrusion detection systems in wireless networks.