A Biased Modified Binary Query Tree Protocol for RFID Tag Collision Resolution

2011 ◽  
Author(s):  
Xinqing Yan ◽  
Yan Xu ◽  
Bin Li
Keyword(s):  
Collision Resolution ◽  
Rfid Tag ◽  
Query Tree

A memoryless binary query tree based Successive Scheme for passive RFID tag collision resolution

2015 ◽  
Vol 22 ◽  
pp. 26-38 ◽  
Author(s):  
Xin-Qing Yan ◽  
Yang Liu ◽  
Bin Li ◽  
Xue-Mei Liu
Keyword(s):  
Collision Resolution ◽  
Rfid Tag ◽  
Query Tree ◽  
Passive Rfid

A Novel Query Tree Protocol with Bit Tracking in RFID Tag Identification

2013 ◽  
Vol 12 (10) ◽  
pp. 2063-2075 ◽  
Author(s):  
Yuan-Cheng Lai ◽  
Ling-Yen Hsiao ◽  
Hong-Jie Chen ◽  
Ching-Neng Lai ◽  
Jian-Wei Lin
Keyword(s):  
Tag Identification ◽  
Rfid Tag ◽  
Query Tree

RFID Tag Anti-Collision Protocols

2012 ◽  
pp. 133-154 ◽  
Author(s):  
Ching-Nung Yang ◽  
Jyun-Yan He ◽  
Yu-Ching Kun
Keyword(s):  
Radio Frequency ◽  
Large Volume ◽  
Radio Frequency Identification ◽  
Binary Tree ◽  
Radio Frequency Field ◽  
Rfid Tag ◽  
Rfid System ◽  
Collision Problem ◽  
Query Tree ◽  
Frequency Identification

A tag collision problem (or missed reads) in Radio Frequency Identification (RFID) system happens when multiple tags respond to a reader simultaneously. At this time, the reader cannot differentiate these tags correctly. This problem is often seen whenever a large volume of RFID tags are read together in the same radio frequency field. Tag collisions will degrade identification efficiency, and this unreliable identification will compromise the usefulness of RFID system. This chapter introduces tag collision problem and discusses tag anti-collision protocols, including ALOHA-based protocol, Binary Tree (BT) protocol, and Query Tree (QT) protocol. To date, most tag anti-collision protocols are QT protocols. Thus, in this chapter, the authors briefly describe some elegant researches on QT protocols, and also introduce their recent research results on QT protocols.

Sign in / Sign up

Export Citation Format

Share Document