z-logo
open-access-imgOpen Access
Adaptive and dynamic RFID tag anti-collision based on secant iteration
Author(s) -
Zuliang Wang,
Shiqi Huang,
Linyan Fan,
Ting Zhang,
Yunlong Wang,
Yufan Wang
Publication year - 2018
Publication title -
plos one
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.99
H-Index - 332
ISSN - 1932-6203
DOI - 10.1371/journal.pone.0206741
Subject(s) - aloha , radio frequency identification , collision , computer science , identification (biology) , frame (networking) , throughput , algorithm , ideal (ethics) , population , real time computing , telecommunications , wireless , computer security , philosophy , botany , demography , epistemology , sociology , biology
Radio frequency identification (RFID) has recently experienced unprecedented development. Among many other areas, it has been widely applied in blood station management, automatic supermarket checkout, and logistics. In the application of RFID for large-scale passive tags, tag collision is inevitable owing to the non-cooperation mechanism among tags. Therefore, a tag anti-collision method is a key factor affecting the identification efficiency. In this paper, we propose a tag anti-collision method based on Aloha technology for RFID. It estimates the number of remaining tags using the secant iteration method. To achieve optimal identification efficiency, it adaptively and dynamically adjusts the lengths of the subsequent frames according to the principle that the length of a frame should be the same as the number of tags to be identified. For pseudo-solutions of tag population estimation while using secant iteration, we present an elimination method by two probing frames. The simulation results show that the estimation precision of our method can reach above 97%. Thus, it can meet the requirement of the tag anti-collision estimation accuracy. Its global throughput is obviously superior to the Q algorithm adopted by the current international standard, and it is close to the ideal system. It consequently outperforms existing schemes.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here