ÇѱÛÁ¦¸ñ(Korean Title) |
RFID ½Ã½ºÅÛÀ» À§ÇÑ ÇÏÀ̺긮µå ÇÏÀÌÆÛ Äõ¸® Æ®¸® ¾Ë°í¸®Áò |
¿µ¹®Á¦¸ñ(English Title) |
A Hybrid Hyper Query Tree Algorithm for RFID System |
ÀúÀÚ(Author) |
±èÅÂÈñ
À̼ºÁØ
¾È±¤¼±
TaeHee Kim
SeongJoon Lee
KwangSeon Ahn
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 15-A NO. 05 PP. 0287 ~ 0294 (2008. 10) |
Çѱ۳»¿ë (Korean Abstract) |
RFID ½Ã½ºÅÛ¿¡¼ ¸®´õ¿Í ű״ ´ÜÀÏ ¹«¼± °øÀ¯ ä³ÎÀ» °®±â ¶§¹®¿¡ RFID ¼öµ¿Çü ű׸¦ À§ÇÑ ÅÂ±× Ãæµ¹ ÁßÀç°¡ ÅÂ±× ÀνÄÀ» À§ÇÑ Áß¿äÇÑ À̽´ÀÌ´Ù. º» ³í¹®¿¡¼´Â ÅÂ±× Ãæµ¹ ¹æÁö¸¦ À§ÇÑ ÇÏÀ̺긮µå ÇÏÀÌÆÛ Äõ¸® Æ®¸® ¾Ë°í¸®Áò(H2QT, Hybrid Hyper Query Tree)À» Á¦¾ÈÇÑ´Ù. Á¦¾ÈµÈ ¾Ë°í¸®ÁòÀº Äõ¸® Æ®¸®¸¦ ±â¹ÝÀ¸·Î űװ¡ ¸®´õ¿¡°Ô ID¸¦ Àü¼ÛÇÏ´Â ½ÃÁ¡À» Àü¼ÛID »óÀ§ 3ºñÆ® ³»ÀÇ '1'°ªÀ» ÀÌ¿ëÇÏ¿© °áÁ¤ÇÑ´Ù. ¶ÇÇÑ Àü¼Û ¹ÞÀº TagÀÇ »óÀ§ 3ºñÆ®´Â Ãæµ¹ÀÌ ¹ß»ýÇÏ´õ¶óµµ Àü¼Û ½½·Ô¿¡ µû¶ó ´Ù¸£¹Ç·Î Á¦¾ÈÇÑ ¾Ë°í¸®Áò¿¡¼ ¿¹ÃøÀÌ °¡´ÉÇÏ´Ù. ½Ã¹Ä·¹À̼ÇÀ» ÅëÇÑ ¼º´É Æò°¡¿¡¼ ´Ù¸¥ Æ®¸® ±â¹Ý ÇÁ·ÎÅäÄÝ¿¡ ºñÇØ Á¦¾ÈÇÑ ¾Ë°í¸®ÁòÀÌ Äõ¸® Ƚ¼ö¿¡¼ ³ôÀº ¼º´ÉÀ» °®´Â´Ù´Â °ÍÀ» º¸¿©ÁØ´Ù
|
¿µ¹®³»¿ë (English Abstract) |
A tag collision arbitration algorithm for RFID passive tags is one of the important issues for fast tag identification, since reader and tag have a shared wireless channel in RFID system. This paper suggests Hyper-Hybrid Query Tree algorithm to prevent the tag-collisions. The suggested algorithms determine the specified point in time for tag to transfer ID to reader by using value 1 of the upper 3 bit based on Query Tree. Also, because the transferred upper 3 bits of tag is different depending on the time of transfer, it is possible to predict in the suggested Algorithm. In the performance evaluation through simulation, it shows the suggested algorithm has higher performance in the number of queries compared to other Tree-based protocols.
|
Å°¿öµå(Keyword) |
RFID
Ãæµ¹¹æÁö ¾Ë°í¸®Áò
ÅÂ±× ÀνÄ
Äõ¸® Æ®¸®
EPC
Anti-Collision Algorithm
Tag Identification
Query Tree
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|