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

Jongwoo SUNG  Daeyoung KIM  Taehong KIM  Jinhyuk CHOI  

IEICE TRANSACTIONS on Communications   Vol.E95-B   No.2   pp.603-606
Publication Date: 2012/02/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E95.B.603
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Network
RFID,  anti-collision,  query tree,  heuristic,  divide and conquer,  

Full Text: PDF(530KB)>>
Buy this Article

 | Errata[Uploaded on February 1,2012]

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.