RFID Transponder Collision Arbitration via Dynamic Waiting Periods
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing RFID systems face challenges in efficiently managing collisions between multiple transponders when many tags are present, leading to mutual interference and reduced read efficiency due to complex logic circuits and increased power consumption.
Innovation Solution
A method that adjusts the waiting period for transponder responses using a random number generator and logic circuitry to control the counter, allowing for flexible adjustment of the Round Size with minimal logic components, reducing chip complexity and power consumption.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If complex logic circuits are used to manage transponder collisions, then collision arbitration capability is improved, but device complexity and power consumption increase
Solution Approach 1:
The patent extracts the collision arbitration function from complex logic circuits and implements it using a simple counter and random number generator. The counter counts random time slots and compares with a threshold value to determine transmission timing, eliminating the need for complex arbitration logic while maintaining effective collision management.
Solution Approach 2:
The transponder uses its own identification number as a seed for the random number generator, making the system self-configuring. The threshold value is automatically set based on the number of active transponders, allowing the system to adapt without external intervention or complex control logic.
2Reliability
If complex logic circuits are used to manage transponder collisions, then collision arbitration capability is improved, but power consumption increases
Solution Approach 1:
The patent replaces power-hungry complex logic circuits with energy-efficient components including a simple counter, random number generator, and threshold comparator. This extraction of the arbitration function to simpler components directly reduces power consumption while maintaining collision management effectiveness.
Solution Approach 2:
The system uses a simple threshold value that can be easily updated based on the number of active transponders, replacing the need for complex, power-intensive logic circuits. The threshold acts as a disposable parameter that is recalculated as transponders are read, providing adaptive collision management with minimal energy cost.
3Device complexity
If fixed waiting periods are used, then device complexity is reduced, but read efficiency decreases due to collisions
Solution Approach 1:
The patent implements dynamic waiting periods by using a counter that counts random time slots determined by a random number generator. The threshold value for the counter is dynamically adjusted based on the number of active transponders, allowing the system to adapt to changing conditions and maintain high read efficiency without increasing device complexity.
Solution Approach 2:
The system changes the parameter of waiting period duration dynamically by updating the threshold value based on the number of active transponders. This parameter change allows the system to optimize performance under different load conditions while maintaining simple control logic through the use of a basic counter and comparator.
4Reliability
If random waiting periods are used, then collision reduction is improved, but device complexity increases
Solution Approach 1:
The patent extracts the random number generation function to a simple linear recursive sequence generator that uses the transponder's identification number as a seed. This extraction provides effective collision reduction through randomized timing while keeping the circuitry simple and avoiding the need for complex random number generation hardware.
Data Source
AI summary
The invention describes an arbitration management method and system for use in identifying RFID transponders or tags which each transmit a response signal to a reader within a respective waiting period the maximum duration of which can be adjusted. The maximum duration is determined by a random number transmitted to a counter along a number of data lines, at least one of the data lines being provided with logic gates which block or permit data line signals reaching the binary inputs of the counter to control the maximum length of the waiting period.