Research Article

A Fast RFID Tag Anticollision Algorithm for Dynamic Arrival Scenarios Based on First-Come-First-Serve

Table 1

Notations used in analysis.

NotationsMeaning and explanation

Number of collision slots
Number of empty slots
Number of success slots
Probability of occurrence under the condition
Number of tags participate in one frame
Duration of success slot
Duration of empty slot
Duration of collision slot
The system efficiency of one frame
The system efficiency of the first n frame
Number of success slots in the i-th frame
Frame length of the i-th frame
The i-th frame
Tag identification process
Number of unidentified tags in the i-th frame
Number of new arrival tags in the i-th frame
Arrival rate of the i-th frame
The j-th slot in the i-th frame
Number of success slots after j-th slot
Number of collision slots after j-th slot
Number of empty slots after j-th slot
Time after j-th slot in the i-th frame
Number of new arrival tags after j-th slot in the i-th frame
SIDtTag random slot number
SIDcThe current slot number of one tag
SIDwThe maximum slot number that can be selected by the waiting tag
SIDlThe minimum slot number that can be selected by the new arrival tag
Number of unidentified tags in the i-th frame
Number of new arrival tags in the i-th frame
RN1616-bit random number
EPC96-bit electronic product code
AckThe Ack instruction
IndicateWaitThe IndicateWait instruction
IndicateArrivalThe IndicateArrival instruction
IndicateThe IndicateWait or IndicateArrival instruction
StartThe Start instruction