Á¤º¸°úÇÐȸ ³í¹®Áö I : Á¤º¸Åë½Å
ÇѱÛÁ¦¸ñ(Korean Title) |
RFID ½Ã½ºÅÛ¿¡¼ ÅÂ±× Ãæµ¹ ÁßÀ縦 À§ÇÑ ÇÏÀ̺긮µå ±â¹ý |
¿µ¹®Á¦¸ñ(English Title) |
A Hybrid Approach to Arbitrate Tag Collisions in RFID systems |
ÀúÀÚ(Author) |
·ùÁöÈ£
ÀÌÈ£Áø
¼®¿ëÈ£
±ÇÅ°æ
ÃÖ¾çÈñ
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 34 NO. 06 PP. 0483 ~ 0492 (2007. 12) |
Çѱ۳»¿ë (Korean Abstract) |
º» ³í¹®¿¡¼´Â RFID ½Ã½ºÅÛ¿¡¼ Äõ¸® Æ®¸® ±â¹ÝÀÇ ÅÂ±× Ãæµ¹ ÁßÀ縦 À§ÇÑ »õ·Î¿î ÇÁ·ÎÅäÄÝÀ» Á¦¾ÈÇÑ´Ù. Á¦¾ÈÇÑ ÇÏÀ̺긮µå Äõ¸® Æ®¸®(Hybrid Query Tree) ±â¹ýÀº ÀÌÁø Äõ¸® Æ®¸® ´ë½Å¿¡ 4-ary Äõ¸® Æ®¸®¸¦ ÀÌ¿ëÇÏ¿© ÅÂ±× Ãæµ¹ ¼ö¸¦ ÁÙ¿´À¸¸ç Ãß°¡ÀûÀ¸·Î ¹ß»ýÇÏ´Â À¯ÈÞ ½Ã°£À» ÁÙÀ̱â À§ÇØ slotted ¹é¿ÀÇÁ ±â¹ýÀ» È°¿ëÇÏ¿´´Ù. ½ÇÇè°á°ú ¹× ¼öÇÐÀû ºÐ¼®Àº Á¦¾ÈÇÑ ÇÏÀ̺긮µå Äõ¸® Æ®¸® ÇÁ·ÎÅäÄÝÀÌ ±âÁ¸¿¡ Á¦½ÃµÈ ±â¹ýº¸´Ù ¿ì¼öÇÑ ¼º´ÉÀ» º¸ÀÓÀ» ÀÔÁõÇÑ´Ù. |
¿µ¹®³»¿ë (English Abstract) |
In this paper, we propose a new hybrid approach based on query tree protocol to arbitrate tag collisions in RFID systems. The hybrid query tree protocol that combines a tree based query protocol with a slotted backoff mechanism. The proposed protocol decreases the average identification delay by reducing collisions and idle time. To reduce collisions, we use a 4-ary query tree instead of a binary query tree. To reduce idle time, we introduce a slotted backoff mechanism to reduce the number of unnecessary Query commands. Simulation and numerical analysis reveal that the proposed protocol achieves lower identification delay than existing tag collision arbitration protocols. |
Å°¿öµå(Keyword) |
RFID ½Ã½ºÅÛ
ÅÂ±× È¥Àâ ¹æÁö
Æнúê ű×
Äõ¸® Æ®¸®
RFID systems
tag anti collision
passive tag
query tree
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|