TCSP Solving Technique For RFID Complex Event Processing

RFID (Radio Frequency Identification) technology is enabling cost-effective sensing and identification in various large-scale applications in retail, pharmaceuticals, healthcare and supply chain management. However, the characteristics of RFID data include time-dependency, dynamic changes, huge volumes and hoard of implicit semantics. And the inherent nature of RFID event stream poses significant challenges to RFID complex event processing.In recent years researchers have investigated ways of RFID complex event detection, but the temporal event processing problem has not been solved satisfactorily, there are still many aspects worthy of further study. In this thesis, we propose a new research idea for dealing with temporal event detection, which features translating the problem of RFID complex event detection into a temporal constraint satisfaction problem (TCSP) that can be solved by available constraint algorithms. This paper first presents a comprehensive survey of the state-of-the-art RFID complex event detection (CED) technology and TCSP solving technology. On this basis, this paper proposes the Rule Conversion Algorithm to convert a CED problem represented in logical rules into a TCSP, and thus solve the TCSP through available constraint solvers or the specialized temporal constraint solving algorithm.Finally, we implement a TCSP-based RFID complex event processing system in Java and conduct a set of experiments to show the feasibility and efficiency through comparative analysis.