Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014 (2014), Article ID 654974, 9 pages
http://dx.doi.org/10.1155/2014/654974
Research Article

Based on Regular Expression Matching of Evaluation of the Task Performance in WSN: A Queue Theory Approach

School of Software Technology, Dalian University of Technology, Dalian 116620, China

Received 4 July 2014; Accepted 16 August 2014; Published 23 October 2014

Academic Editor: Fei Yu

Copyright © 2014 Jie Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. Matam and S. Tripathy, “Provably secure routing protocol for wireless mesh networks,” International Journal of Network Security, vol. 16, no. 3, pp. 182–192, 2014. View at Google Scholar
  2. H. Deng, W. Li, and D. P. Agrawal, “Routing security in wireless ad hoc networks,” IEEE Communications Magazine, vol. 40, no. 10, pp. 70–75, 2002. View at Publisher · View at Google Scholar · View at Scopus
  3. L. Eschenauer and V. D. Gligor, “A key-management scheme for distributed sensor networks,” in Proceedings of the 9th ACM Conference on Computer and Communications Security, pp. 41–47, Dalian, China, November 2002. View at Scopus
  4. Y.-C. Hu, D. B. Johnson, and A. Perrig, “SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks,” Ad Hoc Networks, vol. 1, no. 1, pp. 175–192, 2003. View at Publisher · View at Google Scholar · View at Scopus
  5. S. S. Ahmeda, “ID-based and threshold security scheme for ad hoc network,” in Proceedings of the IEEE 3rd International Conference on Communication Software and Networks (ICCSN '11), pp. 16–21, Xi'an, China, May 2011. View at Publisher · View at Google Scholar · View at Scopus
  6. M. Roesch and Stanford Telecommunications, “Snort: lightweight intrusion detection for networks,” in Proceedings of the 13th USENIX Conference on System Administration (LISA '99), vol. 99, pp. 229–238, 1999.
  7. A. Prathapani, L. Santhanam, and D. P. Agrawal, “Detection of blackhole attack in a wireless mesh network using intelligent honeypot agents,” Journal of Supercomputing, vol. 64, no. 3, pp. 777–804, 2011. View at Publisher · View at Google Scholar · View at Scopus
  8. J. Levandoski, E. Sommer, M. Strait et al., “Application layer packet classifier for linux,” 2008.
  9. X. Li, M. Chen, and W. Liu, “Application of STBC—encoded cooperative transmissions in wireless sensor networks,” IEEE Signal Processing Letters, vol. 12, no. 2, pp. 134–137, 2005. View at Publisher · View at Google Scholar · View at Scopus
  10. K. Kim, “(N,n)-preemptive priority queues,” Performance Evaluation, vol. 68, no. 7, pp. 575–585, 2011. View at Publisher · View at Google Scholar · View at Scopus
  11. J. Wang, Y. Yanshuo, and K. Zhou, “A regular expression matching approach to distributed wireless network security system,” International Journal of Network Security, vol. 16, no. 5, pp. 382–388, 2014. View at Google Scholar
  12. W. Jie, K. Zhou, K. Cui et al., “Evaluation of the task communication performance in wireless sensor networks: a queue theory approach,” in Green Computing and Communications, IEEE and Internet of Things, IEEE International Conference on and IEEE Cyber, Physical and Social Computing, pp. 939–944, IEEE, 2013.
  13. J. P. A. X. Liu and E. Torng, “Bypassing space explosion in regular expression matching for networkintrusion detection and prevention systems,” 2012.
  14. S. Kumar, S. Dharmapurikar, F. Yu, P. Crowley, and J. Turner, “Algorithms to accelerate multipleregular expressions matching for deep packet inspection,” ACM SIGCOMM Computer Communication Review, vol. 36, no. 4, pp. 339–350, 2006. View at Publisher · View at Google Scholar
  15. T. Liu, Y. Sun, A. X. Liu, L. Guo, and B. Fang, “A preltering approach to regular expression matching for network security systems,” in Applied Cryptography and Network Security, pp. 363–380, Springer, Berlin, Germany, 2012. View at Google Scholar
  16. M. Becchi and P. Crowley, “Efficient regular expression evaluation: Theory to practice,” in Proceeding of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS '08), pp. 50–59, New York, NY, USA, November 2008. View at Publisher · View at Google Scholar · View at Scopus
  17. S. Kumar, J. Turner, and J. Williams, “Advanced algorithms for fast and scalable deep packet inspection,” in Proceedings of the 2nd ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS '06), pp. 81–92, ACM, New York, NY, USA, December 2006. View at Publisher · View at Google Scholar · View at Scopus
  18. B. C. Brodle, R. K. Cytron, and D. E. Taylor, “A scalable architecture for high-throughput regular-expression pattern matching,” in Proceedings of the 33rd International Symposium on Computer Architecture (ISCA '06), pp. 191–202, Boston, Mass, USA, June 2006. View at Publisher · View at Google Scholar · View at Scopus
  19. A. Mitra, W. Najjar, and L. Bhuyan, “Compiling PCRE to FPGA for accelerating SNORT IDS,” in Proceedings of the 3rd ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS '07), pp. 127–135, ACM, New York, NY, USA, December 2007. View at Publisher · View at Google Scholar · View at Scopus
  20. R. Sidhu and V. K. Prasanna, “Fast regular expression matching using fpgas,” in Proceedings of the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM '01), pp. 227–238, IEEE, 2001.
  21. L. Chuan-Lai, The Queuing Theory, Beijing University of Posts and Telecommunications Press, Beijing, China, 2000.
  22. S. S. Mishra and D. K. Yadav, “Cost and profit analysis of Markovian queuing system with two priority classes: a computational approach,” International Journal of Applied Mathematics and Computer Sciences, vol. 5, no. 3, pp. 150–156, 2009. View at Google Scholar
  23. V. Srinivas, S. S. Rao, and B. K. Kale, “Estimation of measures in M/M/1 queue,” Communications in Statistics—Theory and Methods, vol. 40, no. 18, pp. 3327–3336, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. W. F. Nasrallah, “How pre-emptive priority affects completion rate in an M/M/1 queue with Poisson reneging,” European Journal of Operational Research, vol. 193, no. 1, pp. 317–320, 2009. View at Publisher · View at Google Scholar · View at Scopus
  25. A. Al Hanbali and O. Boxma, “Busy period analysis of the state dependent M/M/1/K queue,” Operations Research Letters, vol. 38, no. 1, pp. 1–6, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus