Bi-slotted tree based anti-collision protocols for fast tag identification in RFID systems

Cited 29 time in webofscience Cited 0 time in scopus
  • Hit : 153
  • Download : 265
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 V 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.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2006-12
Language
English
Article Type
Article
Citation

IEEE COMMUNICATIONS LETTERS, v.10, no.12, pp.861 - 863

ISSN
1089-7798
DOI
10.1109/LCOMM.2006.061348
URI
http://hdl.handle.net/10203/12840
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 29 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0