An Inference Algorithm with Efficient Slot Allocation for RFID Tag Identification
Summary :
This letter proposes the Inference Algorithm through Effective Slot Allocation (ESA-IA). In ESA-IA, the tags which match the prefix of the reader's request-respond in the corresponding slot; the group of tags with an even number of 1's responds in slot 0, while the group with an odd number of 1's responds in slot 1. The proposed algorithm infers '00' and '11' if there are two collided bits in slot 0, while inferring '01' and '10' if there are two collided bits in slot 1. The ESA-IA decreases the time consumption for tag identification by reducing the overall number of queries.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E93-B No.1 pp.170-173
- Publication Date
- 2010/01/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E93.B.170
- Type of Manuscript
- LETTER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Sungsoo KIM, Yonghwan KIM, Kwangseon AHN, "An Inference Algorithm with Efficient Slot Allocation for RFID Tag Identification" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 1, pp. 170-173, January 2010, doi: 10.1587/transcom.E93.B.170.
Abstract: This letter proposes the Inference Algorithm through Effective Slot Allocation (ESA-IA). In ESA-IA, the tags which match the prefix of the reader's request-respond in the corresponding slot; the group of tags with an even number of 1's responds in slot 0, while the group with an odd number of 1's responds in slot 1. The proposed algorithm infers '00' and '11' if there are two collided bits in slot 0, while inferring '01' and '10' if there are two collided bits in slot 1. The ESA-IA decreases the time consumption for tag identification by reducing the overall number of queries.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.170/_p
Copy
@ARTICLE{e93-b_1_170,
author={Sungsoo KIM, Yonghwan KIM, Kwangseon AHN, },
journal={IEICE TRANSACTIONS on Communications},
title={An Inference Algorithm with Efficient Slot Allocation for RFID Tag Identification},
year={2010},
volume={E93-B},
number={1},
pages={170-173},
abstract={This letter proposes the Inference Algorithm through Effective Slot Allocation (ESA-IA). In ESA-IA, the tags which match the prefix of the reader's request-respond in the corresponding slot; the group of tags with an even number of 1's responds in slot 0, while the group with an odd number of 1's responds in slot 1. The proposed algorithm infers '00' and '11' if there are two collided bits in slot 0, while inferring '01' and '10' if there are two collided bits in slot 1. The ESA-IA decreases the time consumption for tag identification by reducing the overall number of queries.},
keywords={},
doi={10.1587/transcom.E93.B.170},
ISSN={1745-1345},
month={January},}
Copy
TY - JOUR
TI - An Inference Algorithm with Efficient Slot Allocation for RFID Tag Identification
T2 - IEICE TRANSACTIONS on Communications
SP - 170
EP - 173
AU - Sungsoo KIM
AU - Yonghwan KIM
AU - Kwangseon AHN
PY - 2010
DO - 10.1587/transcom.E93.B.170
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2010
AB - This letter proposes the Inference Algorithm through Effective Slot Allocation (ESA-IA). In ESA-IA, the tags which match the prefix of the reader's request-respond in the corresponding slot; the group of tags with an even number of 1's responds in slot 0, while the group with an odd number of 1's responds in slot 1. The proposed algorithm infers '00' and '11' if there are two collided bits in slot 0, while inferring '01' and '10' if there are two collided bits in slot 1. The ESA-IA decreases the time consumption for tag identification by reducing the overall number of queries.
ER -
English
