Radio frequency identification (RFID) technology is becoming increasingly attractive because of its high storage capacity and reprogrammability. There is a challenge to be overcome when a reader needs to read a number of tags within the reader's interrogation zone at the same time. In this paper, we present an anti-collision scheme in a RFID system. The scheme is based on the dynamic framed ALOHA protocol developed for radio networks. In our scheme, we propose two methods to estimate the number of tags. Simulation results indicate that the total number of time slots for reading all tags is about 4 times the number of tags that need to be read, including acknowledgement time slots. The main advantages of our scheme are the great performance of uplink throughput and its easy implementation for both readers and tags.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Wen-Tzu CHEN, Guan-Hung LIN, "An Efficient Anti-Collision Method for Tag Identification in a RFID System" in IEICE TRANSACTIONS on Communications,
vol. E89-B, no. 12, pp. 3386-3392, December 2006, doi: 10.1093/ietcom/e89-b.12.3386.
Abstract: Radio frequency identification (RFID) technology is becoming increasingly attractive because of its high storage capacity and reprogrammability. There is a challenge to be overcome when a reader needs to read a number of tags within the reader's interrogation zone at the same time. In this paper, we present an anti-collision scheme in a RFID system. The scheme is based on the dynamic framed ALOHA protocol developed for radio networks. In our scheme, we propose two methods to estimate the number of tags. Simulation results indicate that the total number of time slots for reading all tags is about 4 times the number of tags that need to be read, including acknowledgement time slots. The main advantages of our scheme are the great performance of uplink throughput and its easy implementation for both readers and tags.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e89-b.12.3386/_p
Copy
@ARTICLE{e89-b_12_3386,
author={Wen-Tzu CHEN, Guan-Hung LIN, },
journal={IEICE TRANSACTIONS on Communications},
title={An Efficient Anti-Collision Method for Tag Identification in a RFID System},
year={2006},
volume={E89-B},
number={12},
pages={3386-3392},
abstract={Radio frequency identification (RFID) technology is becoming increasingly attractive because of its high storage capacity and reprogrammability. There is a challenge to be overcome when a reader needs to read a number of tags within the reader's interrogation zone at the same time. In this paper, we present an anti-collision scheme in a RFID system. The scheme is based on the dynamic framed ALOHA protocol developed for radio networks. In our scheme, we propose two methods to estimate the number of tags. Simulation results indicate that the total number of time slots for reading all tags is about 4 times the number of tags that need to be read, including acknowledgement time slots. The main advantages of our scheme are the great performance of uplink throughput and its easy implementation for both readers and tags.},
keywords={},
doi={10.1093/ietcom/e89-b.12.3386},
ISSN={1745-1345},
month={December},}
Copy
TY - JOUR
TI - An Efficient Anti-Collision Method for Tag Identification in a RFID System
T2 - IEICE TRANSACTIONS on Communications
SP - 3386
EP - 3392
AU - Wen-Tzu CHEN
AU - Guan-Hung LIN
PY - 2006
DO - 10.1093/ietcom/e89-b.12.3386
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E89-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2006
AB - Radio frequency identification (RFID) technology is becoming increasingly attractive because of its high storage capacity and reprogrammability. There is a challenge to be overcome when a reader needs to read a number of tags within the reader's interrogation zone at the same time. In this paper, we present an anti-collision scheme in a RFID system. The scheme is based on the dynamic framed ALOHA protocol developed for radio networks. In our scheme, we propose two methods to estimate the number of tags. Simulation results indicate that the total number of time slots for reading all tags is about 4 times the number of tags that need to be read, including acknowledgement time slots. The main advantages of our scheme are the great performance of uplink throughput and its easy implementation for both readers and tags.
ER -