An Efficient Complex Event Processing Algorithm Based on NFA-HTBTS for Massive RFID Event Stream

An Efficient Complex Event Processing Algorithm Based on NFA-HTBTS for Massive RFID Event Stream

Jianhua Wang (South China Agricultural University, Guangzhou, China), Shilei Lu (South China Agricultural University, Guangzhou, China), Yubin Lan (South China Agricultural University, Guangzhou, China) and Lianglun Cheng (Guangdong University of Technology, Guangzhou, China)
DOI: 10.4018/IJITSA.2018070102

Abstract

This article describes how quickly picking up some valuable information from massive RFID event stream often faces with the problem of long detection time, high memory consumption and low detection efficiency due to its stream characteristics of volume, velocity, variety, value and veracity. Aim to solving the problems above, an efficient complex event processing method based on NFA-HTBTS (Nondeterministic Finite Automaton-Hash Table B+ Tree Structure) is presented in this article. The achievement of this article lies in that we successfully use the union of NFA and HTBTS to realize the detection of complex event in massive RFID event stream. Specially, in our scheme, after using NFA to match related primitive events from massive RFID event stream, we use hash table and B+ tree structure to successfully realize the detection of complex event from large matched results above, as a result, these problems existed in current methods above can be effectively solved by our scheme. The simulation results show that our proposed scheme outperforms some general methods for massive RFID event stream.
Article Preview

1. Introduction

With the rapid development and growing maturity in RFID (Radio Frequency Identification) technology in recent years, a large number of RFID devices have been widely used in many areas of modern life, such as supply chain management (Lee et al., 2008), health care (Kwon et al., 2013), air monitoring (Honda et al., 2014), power network management (Sitthidet et al., 2014), pervasive computing applications (Boytsov et al., 2013) and industrial manufacturing(Son et al., 2014). The wide usage of RFID devices generates massive RFID event stream. However, the characteristics of massive RFID event stream: huge volume, high velocity, many variety, small value and not veracity, etc., makes the existing event processing methods on event stream difficult to rapidly deal with the massive RFID event stream above, thus seriously affecting its whole processing efficiency. So, how to develop a technology to quickly get desired information from massive RFID event stream has become an important issue in this paper.

Since CEP (Complex Event Processing) (Del et al., 2007) technology can rapidly pick up valuable information from massive RFID event stream by taking advantage of the association between event attributes, matching rules and algebraic operations for users, therefore, it has obtained increasing attention in the field of event stream processing.

In recent, many researches on CEP have been done to detect a complex event from various streams. In the processing systems aspects, some general complex event processing systems, such as Cayuga (Demers et al., 2007), Esper (2010), Estream (Garg et al., 2005), PQS (Cybenko et al., 2007), have been developed to provide the basic processing functions for complex event. In processing methods aspects, some general complex event processing methods, for example, complex event processing method based on petri-nets (Wang et al., 2006), complex event processing method based on diagram (Bai et al., 2009), complex event processing method based on tree (Sun et al., 2009), complex event processing method based on finite automaton (Mei et al., 2009), complex event processing method based on workflow (Zang et al., 2009), etc., and their some optimized algorithms, such as complex event processing method based on timed petri-net (Jin et al., 2008), complex event processing method based on optimized directed graph (Wang et al., 2006), complex event processing method based on compressed composition tree (Li et al., 2010), complex event processing method based on pushdown automata structure (Cao et al., 20114), and so on, have been studied to detect a complex event. However, since these processing systems or methods above need to take many repeatable unnecessary inserting, storage and search operations when detecting a complex event for massive RFID events stream, which can result in long processing time, high memory consumption and low event throughput.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 13: 2 Issues (2020): Forthcoming, Available for Pre-Order
Volume 12: 2 Issues (2019): 1 Released, 1 Forthcoming
Volume 11: 2 Issues (2018)
Volume 10: 2 Issues (2017)
Volume 9: 2 Issues (2016)
Volume 8: 2 Issues (2015)
Volume 7: 2 Issues (2014)
Volume 6: 2 Issues (2013)
Volume 5: 2 Issues (2012)
Volume 4: 2 Issues (2011)
Volume 3: 2 Issues (2010)
Volume 2: 2 Issues (2009)
Volume 1: 2 Issues (2008)
View Complete Journal Contents Listing