Abstract

RFID is an advanced non-contact automatic identification technology. It is widely used in location, real-time identification and tracking and it has become a hot topic in the field of research. A lot of redundant data and noise data greatly reduce the efficiency and performance of RFID system. This study puts forward a filtering algorithm based on dynamic adaptive time window. In order to ensure the sequence of acquainted RFID data correctly, the ordered filtering algorithm based on hash table is introduced. Experiments show that the improved filtering algorithm not only can effectively filter duplicate data, but also can ensure the correctness of the data reception.

Keywords:

Data filtering, middleware, noise data, redundant data, RFID,

References

1. Brusey, J., 2003. Reasoning about uncertainty in location identification with RFID [C]. Proceeding of Workshop on Reasoning with Uncertainty in Robotics (IJCAI, 2003), pp: 23-30.
   
2. Chen, J., G. Liu, J. Wu and X. Zhou, 2009. Applications of data filtering in RFID systems [J]. Stud. Opt. Comm., 4: 177-183.
   
3. Deng, H. and J. Li, 2012. The research of RFID data stream filtering algorithm [J]. Res. Comput. Technol. Filtering Algorithm, 22(6): 26-34.
   
4. Li, D. and G. Li, 2009. Research and realization of RFID middleware key part [J]. Comput. Knowl. Technol., 5(34): 9846-9847, 9872.
   
5. Qi, L., 2009. Filtration in RFID middleware data [J]. J. Chongqing Inst. Technol. Nat. Sci., 23(10): 94-98.
   
6. Wang, W. and F. Guo, 2009. Radio frequency identification middleware data filtering algorithm based on dynamic time window [J]. Inform. Electron. Eng., 7(3): 177-183.
   
7. You, Z. and S. Li, 2004. Radio Frequency Identification Technology (RFID) Theory and Application [M]. Electronic Industry Press, Beijing.
   
8. Zhao, L., 2006. The Design and Implementation of RFID Middleware Event Management System [D]. Huazhong University of Science and Technology, Wuhan.
   

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.