Adaptive RFID Query Slot-Counter Adjustment for Collision Resolution
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional RFID systems face inefficiencies in identifying RFID tags due to tag collisions, particularly in environments with large numbers of tags, where existing protocols like Tree-Walking-based and Aloha-like algorithms struggle to optimize query command slot-count parameters, leading to reduced identification speed.
Innovation Solution
An adaptive query command slot-count parameter adjustment method for RFID readers, where Q is initially set and adjusted by different amounts based on the presence of replies or collisions, with specific formulas to decrease Q when no reply is received and increase it when a collision occurs, optimizing the slot-count parameter for faster tag identification.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If conventional Aloha protocol is used for resolving tag collisions, then tags can independently determine transmission time, but throughput is low
Solution Approach 1:
The patent applies dynamics by making the slot-count parameter Q adjustable and adaptive rather than fixed. The reader dynamically modifies Q based on collision detection and reply patterns, allowing the system to adapt its time slot structure to current tag population conditions, thereby improving throughput while maintaining operational simplicity
Solution Approach 2:
The patent changes the parameter Q (slot-count) to optimize system performance. By adjusting Q values based on collision frequency and reply patterns, the system transforms the static Aloha protocol into a dynamic one that can achieve higher throughput while preserving the independence of tag transmission time determination
2Reliability
If Tree-Walking-based deterministic algorithms are used, then tag collisions are resolved by splitting subsets, but the number of required query commands is dependent on the number of existing RFID tags
Solution Approach 1:
The patent applies partial action by using a simplified adaptive Q adjustment mechanism rather than the complete Tree-Walking algorithm. Instead of recursively splitting subsets until single tags remain, the system uses probabilistic Q adjustment to achieve sufficient collision resolution with fewer query commands, accepting partial optimization rather than complete deterministic resolution
3Adaptability or versatility
If the Gen-2 adaptive Q algorithm is used, then Q is adjusted based on replies and collisions, but the identification speed is reduced due to equal adjustment amounts
Solution Approach 1:
The patent applies asymmetry by using different adjustment amounts for increasing and decreasing Q based on the current state. When collisions occur, Q increases by a larger amount (alpha) than when it decreases (beta), creating an asymmetric adjustment strategy that accelerates convergence to optimal Q values and improves identification speed while maintaining adaptability
Solution Approach 2:
The patent implements periodic action through iterative Q adjustment cycles where the reader continuously monitors replies and collisions, adjusts Q accordingly, and repeats the process. This periodic adaptation allows the system to rapidly converge to optimal performance while maintaining responsiveness to changing tag populations
Data Source
AI summary
RFID readers and methods for adjusting a query command slot-count parameter Q for use by radio frequency identification (RFID) tag reader in an RFID tag inventory round are provided. A method for adjusting a query command slot-count parameter Q for use by an RFID tag reader includes setting an initial value for Q for a first inventory round, issuing a query command to a population of RFID tags, and monitoring replies from the population of RFID tags. The value of Q is decreased by a first amount if no reply is received, and the value of Q is increased by a second amount different from the first amount if a tag collision reply is received.