RFID Random Access Timing for QueryRep Counting Loss
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In RFID systems, tags in poor coverage areas may fail to receive QueryRep signaling, leading to inaccurate counting and simultaneous random access by multiple tags, resulting in access conflicts and reduced efficiency.
Innovation Solution
The communication method involves signaling to indicate the number of random access occasions, allowing tags to determine the correct occasion for initiating random access, thereby reducing conflicts and improving efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Area of stationary object
If coverage is enhanced to improve signal reach, then coverage area is improved, but tag counting accuracy deteriorates leading to access conflicts
Solution Approach 1:
The reader performs preliminary actions by sending QueryRep signaling to page tags and maintain a counter before random access occurs. This preliminary counting process allows the system to prepare for random access timing, though in poor coverage areas some QueryRep signaling may be lost, affecting counting accuracy. The invention addresses this by having tags determine their own random access occasion based on received signaling count.
Solution Approach 2:
The system implements feedback mechanisms where the reader sends QueryRep signaling to tags, and tags provide feedback by initiating random access when their counter reaches zero. The reader can detect access conflicts through feedback from multiple tags accessing simultaneously, and adjust subsequent paging strategies accordingly to improve coverage and reduce conflicts.
2Productivity
If tags initiate random access based on counter reaching zero, then random access is triggered, but access conflicts occur when multiple tags simultaneously initiate access
Solution Approach 1:
The random access process is segmented into multiple occasions (first random access occasion, second random access occasion, etc.). Tags are divided into different groups based on their counter values and the QueryRep signaling they receive. This segmentation distributes tags across different random access occasions, reducing the probability that multiple tags will simultaneously initiate access on the same occasion.
Solution Approach 2:
The system dynamically adjusts random access timing based on tag counter states and received signaling. Tags dynamically determine their random access occasion based on how many QueryRep signaling they have received, creating a dynamic distribution of access times rather than static simultaneous access. This dynamic approach reduces access conflicts while maintaining productivity.
3Ease of operation
If tags use counter-based random access timing, then random access timing is determined, but implementation complexity increases due to counter maintenance
Solution Approach 1:
Tags perform self-service by autonomously determining their random access occasion based on the QueryRep signaling they receive from the reader. Each tag independently counts the received signaling and determines its own access timing without requiring complex centralized counter management. This self-service approach reduces implementation complexity while maintaining ease of operation.
Solution Approach 2:
The QueryRep signaling acts as an intermediary that carries timing information from the reader to tags. Instead of tags maintaining complex internal counters, the signaling itself conveys the necessary information for tags to determine their random access occasion. This intermediary mechanism simplifies tag implementation while preserving the counter-based timing functionality.
Data Source
AI summary
A communication method and apparatus are provided. The method includes: A second communication apparatus (for example, a reader) sends first signaling to indicate a quantity N of random access occasions, where N is a positive integer. In addition, the second communication apparatus further sends second signaling, where the second signaling includes first information, the first information indicates a number of a first random access occasion, and the number of the first random access occasion is less than or equal to N−1. A first communication apparatus (for example, a tag) receives the first signaling and the second signaling, and determines, based on the first information, whether to initiate random access on the first random access occasion.