Research Article
A New Slot-Count Selection Algorithm for RFID Protocol
@INPROCEEDINGS{10.1109/CHINACOM.2007.4469535, author={Mahmoud Daneshmand and Chonggang Wang and Kazem Sohraby}, title={A New Slot-Count Selection Algorithm for RFID Protocol}, proceedings={2nd International ICST Conference on Communications and Networking in China}, publisher={IEEE}, proceedings_a={CHINACOM}, year={2008}, month={3}, keywords={RFID; anti-collision protocol; generation-2 RFID protocol; tag identification speed}, doi={10.1109/CHINACOM.2007.4469535} }- Mahmoud Daneshmand
Chonggang Wang
Kazem Sohraby
Year: 2008
A New Slot-Count Selection Algorithm for RFID Protocol
CHINACOM
IEEE
DOI: 10.1109/CHINACOM.2007.4469535
Abstract
EPCglobal RFID generation-2 (Gen-2) protocol [1] has been proposed for ultra-high frequency (UHF) passive tags and is being deployed. Gen-2 proposes a slotted random anti-collision algorithm, including an adaptive slot-count (Q) selection algorithm. The integer-valued parameter Q in Gen-2 plays a critical role in tag collision resolution. This adaptive algorithm dynamically adjusts value of Q based on the type of replies from tags. However, it modifies the value of Q the same way whether there is a “collided reply” or “no reply”. This approach could lead to a slow tag identification speed, since it does not recognize the differences in duration between the “collided reply” and “no reply”. This paper proposes a new slot-count selection algorithm which changes the parameter Q with different amounts depending on whether the reader receives a “collided reply” or there is “no reply” by a pre-specified waiting time. It is demonstrated, through analysis and simulations, that the new proposed algorithm achieves significantly faster tag identification speed compared to that of the existing Gen-2 adaptive Q algorithm.