Bi-slotted tree based anti-collision protocols for fast tag identification in RFID systems |
| |
Authors: | Ji Hwan Choi Dongwook Lee Hyuckjae Lee |
| |
Affiliation: | Sch. of Eng., Inf. & Commun. Univ., Daejeon; |
| |
Abstract: | This paper is intended to present bi-slotted tree based RFID tag anti-collision protocols, bi-slotted query tree algorithm (BSQTA) and bi-slotted collision tracking tree algorithm (BSCTTA). Diminishing prefix overhead and iteration overhead is a significant issue to minimize the anti-collision cost. For fast tag identification, BSQTA and BSCTTA use time divided responses depending on whether the collided bit is `0' or `1' at each tag ID. According to the simulation results, BSQTA and BSCTTA require less time consumption for tag identification than the other tree based RFID tag anti-collision protocols |
| |
Keywords: | |
|
|