RFID Category Identification via Deterministic Slot Selection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional RFID systems face challenges in accurately identifying tags due to collisions during the interrogation process, where multiple tags transmit at the same time, making it difficult for the reader to determine which tags are present, especially when only category IDs need to be identified without individual tag IDs.
Innovation Solution
The RFID system employs a deterministic tag algorithm that allows tags to select specific slots in a multi-slot frame based on their category ID, enabling the reader to estimate the set of distinct categories present by analyzing zero and non-zero slots, with the reader calculating the minimum number of slots required to identify categories within a specified error threshold.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If framed slotted ALOHA protocol is used to reduce collisions, then collision reduction is achieved, but the reader still cannot accurately determine which tags are present due to remaining collisions
Solution Approach 1:
The patent segments the tag ID into two parts: category ID and instance ID. Tags transmit only the category ID portion during the interrogation process, while the instance ID remains local to each tag. This segmentation allows the reader to identify which categories are present without needing to resolve all tag-level collisions, as multiple tags within the same category can collide without affecting category-level identification accuracy.
2Productivity
If all tag IDs are identified to determine product categories, then complete tag identification is achieved, but the process becomes inefficient and more complex when only category information is needed
Solution Approach 1:
The patent extracts only the necessary portion of the tag ID (the category ID) for transmission during interrogation, leaving the instance ID local to each tag. This extraction principle allows the system to achieve category-level identification efficiency without the complexity of full tag ID identification, as the reader only needs to process category IDs to determine which product categories are present.
Data Source
AI summary
The set T of all categories in a population of RFID tags is estimated within a specified error bound. For each of one or more frames, a reader broadcasts a probability p, a multiplicity d, a frame size M, and a seed value R to the present tags. A deterministic algorithm on each tag, and known to the reader, calculates (i) whether the tag will transmit in this frame, and, if so, (ii) in which slots the tag will transmit a single “1.” When the tags have responded, the reader calculates set T by initially assuming that all possible categories are in set T and then eliminating those categories that would have transmitted in those slots in which no tag transmitted. Alternatively, the reader initially assumes that set T is empty, and adds those categories that would have transmitted in those slots in which one or more tags did transmit.