Heuristic Query Tree Protocol: Use of Known Tags for RFID Tag Anti-Collision

Jongwoo SUNG; Daeyoung KIM; Taehong KIM; Jinhyuk CHOI

doi:10.1587/transcom.E95.B.603

Heuristic Query Tree Protocol: Use of Known Tags for RFID Tag Anti-Collision

Jongwoo SUNG, Daeyoung KIM, Taehong KIM, Jinhyuk CHOI

Full Text Views

0

Share
Cite this

Errata[Uploaded on February 1,2012]

Summary :

Existing query tree protocols deal with RFID tags in a blind manner. They query tags in a fixed bit order based on the assumption that the tag ID numbers are uniformly distributed throughout the range of the entire ID space because readers have no prior knowledge of the tags. This paper attempts to distinguish RFID applications where readers are already aware of all tags used by the application. We propose a heuristic query tree (H-QT) protocol that uses heuristic to select effective bits from known tags for the best queries in a divide and conquer approach. The performance evaluation shows that the proposed protocol is superior to original query tree protocols because it significantly reduces the number of tag collisions and no tag response.

Publication: IEICE TRANSACTIONS on Communications Vol.E95-B No.2 pp.603-606

Publication Date: 2012/02/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E95.B.603

Type of Manuscript: LETTER

Category: Network

Cite this

Copy

Jongwoo SUNG, Daeyoung KIM, Taehong KIM, Jinhyuk CHOI, "Heuristic Query Tree Protocol: Use of Known Tags for RFID Tag Anti-Collision" in IEICE TRANSACTIONS on Communications, vol. E95-B, no. 2, pp. 603-606, February 2012, doi: 10.1587/transcom.E95.B.603.
Abstract: Existing query tree protocols deal with RFID tags in a blind manner. They query tags in a fixed bit order based on the assumption that the tag ID numbers are uniformly distributed throughout the range of the entire ID space because readers have no prior knowledge of the tags. This paper attempts to distinguish RFID applications where readers are already aware of all tags used by the application. We propose a heuristic query tree (H-QT) protocol that uses heuristic to select effective bits from known tags for the best queries in a divide and conquer approach. The performance evaluation shows that the proposed protocol is superior to original query tree protocols because it significantly reduces the number of tag collisions and no tag response.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.E95.B.603/_p

Copy

@ARTICLE{e95-b_2_603,
author={Jongwoo SUNG, Daeyoung KIM, Taehong KIM, Jinhyuk CHOI, },
journal={IEICE TRANSACTIONS on Communications},
title={Heuristic Query Tree Protocol: Use of Known Tags for RFID Tag Anti-Collision},
year={2012},
volume={E95-B},
number={2},
pages={603-606},
abstract={Existing query tree protocols deal with RFID tags in a blind manner. They query tags in a fixed bit order based on the assumption that the tag ID numbers are uniformly distributed throughout the range of the entire ID space because readers have no prior knowledge of the tags. This paper attempts to distinguish RFID applications where readers are already aware of all tags used by the application. We propose a heuristic query tree (H-QT) protocol that uses heuristic to select effective bits from known tags for the best queries in a divide and conquer approach. The performance evaluation shows that the proposed protocol is superior to original query tree protocols because it significantly reduces the number of tag collisions and no tag response.},
keywords={},
doi={10.1587/transcom.E95.B.603},
ISSN={1745-1345},
month={February},}

Copy

TY - JOUR
TI - Heuristic Query Tree Protocol: Use of Known Tags for RFID Tag Anti-Collision
T2 - IEICE TRANSACTIONS on Communications
SP - 603
EP - 606
AU - Jongwoo SUNG
AU - Daeyoung KIM
AU - Taehong KIM
AU - Jinhyuk CHOI
PY - 2012
DO - 10.1587/transcom.E95.B.603
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E95-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2012
AB - Existing query tree protocols deal with RFID tags in a blind manner. They query tags in a fixed bit order based on the assumption that the tag ID numbers are uniformly distributed throughout the range of the entire ID space because readers have no prior knowledge of the tags. This paper attempts to distinguish RFID applications where readers are already aware of all tags used by the application. We propose a heuristic query tree (H-QT) protocol that uses heuristic to select effective bits from known tags for the best queries in a divide and conquer approach. The performance evaluation shows that the proposed protocol is superior to original query tree protocols because it significantly reduces the number of tag collisions and no tag response.
ER -