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

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸Åë½ÅÇÐȸ ³í¹®Áö (Journal of the Korea Institute of Information and Communication Engineering)

Çѱ¹Á¤º¸Åë½ÅÇÐȸ ³í¹®Áö (Journal of the Korea Institute of Information and Communication Engineering)

Current Result Document : 34 / 246 ÀÌÀü°Ç ÀÌÀü°Ç   ´ÙÀ½°Ç ´ÙÀ½°Ç

ÇѱÛÁ¦¸ñ(Korean Title) RFID ½Ã½ºÅÛ¿¡¼­ °í¼Ó ÅÂ±× ½Äº°À» À§ÇÑ µ¿Àû FSA ¾Ë°í¸®Áò
¿µ¹®Á¦¸ñ(English Title) Dynamic FSA Algorithm for Fast Tag Identification in RFID Systems
ÀúÀÚ(Author) ÀÓÀÎÅà  ÃÖÁø¿À   ln-Taek Lim   Jin-Oh Choi  
¿ø¹®¼ö·Ïó(Citation) VOL 10 NO. 05 PP. 0806 ~ 0811 (2006. 05)
Çѱ۳»¿ë
(Korean Abstract)
RFID ½Ã½ºÅÛ¿¡¼­ ű׵éÀÌ µ¿½Ã¿¡ ÀÀ´äÀ» Çϸé Ãæµ¹ÀÌ ¹ß»ýÇϸç, À̸¦ ÇØ°áÇÏ´Â ±â¼úÀÌ Ãæµ¹¹æÁö ¾Ë°í¸®ÁòÀÌ´Ù. ±âÁ¸ÀÇ Ãæµ¹¹æÁö ¾Ë°í¸®Áò Áß¿¡¼­ SFSA (Static Framed Slot ALOHA) ¾Ë°í¸®ÁòÀº ±¸ÇöÀÌ °£´ÜÇÑ ÀåÁ¡ÀÌ ÀÖÁö¸¸, ÇÁ·¹ÀÓÀÇ Å©±â°¡ °íÁ¤µÇ¾î Àֱ⠶§¹®¿¡ ÅÂ±× ¼ö°¡ °¡º¯ÀûÀÎ °æ¿ì¿¡´Â ½Ã½ºÅÛ ¼º´ÉÀÌ ÀúÇϵǴ ´ÜÁ¡ÀÌ ÀÖ´Ù. µû¶ó¼­ º» ³í¹®¿¡¼­´Â Ãæµ¹ÀÌ ¹ß»ýÇÑ ½½·ÔÀÇ ¼ö¸¦ ÀÌ¿ëÇÏ¿© ¸Å ÇÁ·¹ÀÓ¸¶´Ù ÃÖÀûÀÇ ÇÁ·¹ÀÓ Å©±â¸¦ °áÁ¤ÇÏ´Â DFSA(dynamic FSA) ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. ¼º´É ºÐ¼®ÀÇ °á°ú, DFSA ¾Ë°í¸®ÁòÀº ±âÁ¸ÀÇ SFSA ¾Ë°í¸®Áò¿¡ ºñÇÏ¿© ºü¸¥ ÅÂ±× ½Äº°ÀÌ °¡´ÉÇÔÀ» ¾Ë ¼ö ÀÖ¾ú´Ù.
¿µ¹®³»¿ë
(English Abstract)
In RFID system, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred to as anti-collision algorithm. Among the existing anti-collision algorithms, SFSA, though simple, has a disadvantage that when the number of tags is variable, the system performance degrades because of the fixed frame size. This paper proposes a new anti-collision algorithm called DFSA which determines the optimal frame size using the number of collided slots at every frame. According to the simulation results, the tag identification time of the proposed algorithm is faster than that of SFSA.
Å°¿öµå(Keyword) RFID   Anti-collision algorithm   FSA  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå