Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
A Low-Complexity Tag Number Estimate in EFSA Protocol for RFID Tag Anti-collision
verfasst von : Zeng Yu, Wu Haifeng, Tan Yuan, Liu Jing
Erschienen in: Informatics in Control, Automation and Robotics
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In many RFID applications, readers need repeatedly identify tags that have been identified in a previous cycle of identification. Some anti-collision protocols, such as efficient framed slotted aloha (EFSA) protocol can retain information obtained from a previous cycle of tag identification, and hence can skip many collisions to quickly re-identify the tags in the current cycle. In EFSA, however, the distribution of tags is not random due to some moving tags. Thus, many exiting estimates will not be suitable. In this paper, we propose a two-dimension binary search (2D-BS) estimate for EFSA. The estimate utilizes a binary search method and nests a 1D search into a final 2D search. The advantage of the proposed estimate is to have lower computational complexity. Simulation results show that the proposed method can reduce the computational complexity and have less error than the existing estimates.