Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 535690, 22 pages
Research Article

Processing Uncertain RFID Data in Traceability Supply Chains

1Department of Information Science and Engineering, Hunan Institute of Humanities, Science and Technology, Loudi 417000, China
2Department of Information Science and Engineering, Hunan First Normal University, Changsha, 410205, China
3Department of Electronics and Information Engineering, Loudi Vocational and Technical College, Loudi 417000, China

Received 8 September 2013; Accepted 30 December 2013; Published 10 March 2014

Academic Editors: J. Comellas and Y. Takama

Copyright © 2014 Dong Xie 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.


Radio Frequency Identification (RFID) is widely used to track and trace objects in traceability supply chains. However, massive uncertain data produced by RFID readers are not effective and efficient to be used in RFID application systems. Following the analysis of key features of RFID objects, this paper proposes a new framework for effectively and efficiently processing uncertain RFID data, and supporting a variety of queries for tracking and tracing RFID objects. We adjust different smoothing windows according to different rates of uncertain data, employ different strategies to process uncertain readings, and distinguish ghost, missing, and incomplete data according to their apparent positions. We propose a comprehensive data model which is suitable for different application scenarios. In addition, a path coding scheme is proposed to significantly compress massive data by aggregating the path sequence, the position, and the time intervals. The scheme is suitable for cyclic or long paths. Moreover, we further propose a processing algorithm for group and independent objects. Experimental evaluations show that our approach is effective and efficient in terms of the compression and traceability queries.