• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

¿µ¹® ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ¿µ¹® ³í¹®Áö > TIIS (Çѱ¹ÀÎÅͳÝÁ¤º¸ÇÐȸ)

TIIS (Çѱ¹ÀÎÅͳÝÁ¤º¸ÇÐȸ)

Current Result Document : 1 / 1

ÇѱÛÁ¦¸ñ(Korean Title) A Simple and Fast Anti-collision Protocol for Large-scale RFID Tags Identification
¿µ¹®Á¦¸ñ(English Title) A Simple and Fast Anti-collision Protocol for Large-scale RFID Tags Identification
ÀúÀÚ(Author) Xiaolin Jia   Yuhao Feng   Yajun Gu  
¿ø¹®¼ö·Ïó(Citation) VOL 14 NO. 04 PP. 1460 ~ 1478 (2020. 04)
Çѱ۳»¿ë
(Korean Abstract)
¿µ¹®³»¿ë
(English Abstract)
This paper proposes a novel anti-collision protocol for large-scale RFID tags identification, named Bi-response Collision Tree Protocol (BCT). In BCT, two group of tags answer the reader¡¯s same query in two response-cycles respectively and independently according to the bi-response pattern. BCT improves the RFID tag identification performance significantly by decreasing the query cycles and the bits transmitted by the reader and tags during the identification. Computation and simulation results indicate that BCT improves the RFID tag identification performance effectively, e.g. the tag identification speed is improved more than 13.0%, 16.9%, and 22.9% compared to that of Collision Tree Protocol (CT), M-ary Collision Tree Protocol (MCT), and Dual Prefix Probe Scheme (DPPS) respectively when tags IDs are distributed uniformly.
Å°¿öµå(Keyword) RFID tag identification   anti-collision protocol   bi-response pattern   degenerate collision tree   stablity  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå