ÇѱÛÁ¦¸ñ(Korean Title) |
RFID Ãæµ¹ ºñÆ®¸¦ ÀÌ¿ëÇÑ ´ÙÁß ÅÂ±× ÀÎ½Ä ¾Ë°í¸®Áò |
¿µ¹®Á¦¸ñ(English Title) |
A New RFID Multi-Tag recognition Algorithm using Collision-Bit |
ÀúÀÚ(Author) |
ÁöÀ¯°
Á¶¹Ì³²
È«¼º¼ö
¹Ú¼öºÀ
Yoo-Kang Ji
Mi-Nam Cho
Sung-Soo Hong
Soo-Bong Park
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 12 NO. 01 PP. 0055 ~ 0058 (2008. 05) |
Çѱ۳»¿ë (Korean Abstract) |
RFID(Radio Frequency IDentification)¸®´õ´Â ¿µ¿ª ³»¿¡ ÀÖ´Â ´Ù¼öÀÇ Å±׸¦ ÀνÄÇÒ ¶§ µ¥ÀÌÅÍ°£ÀÇ Ãæµ¹ÀÌ ¹ß»ýÇϴµ¥ ÀÌ·¯ÇÑ Ãæµ¹Àº ¸®´õÀÇ Å±×ÀÎ½Ä ½Ã°£À» Áö¿¬½ÃÅ°´Â ¿øÀÎÀÌ µÈ´Ù. ¸®´õÀÇ Å±×ÀÎ½Ä ½Ã°£ÀÇ Áö¿¬À» ¹æÁöÇÏ´Â ÇÁ·ÎÅäÄÝÀº ´ëÇ¥ÀûÀ¸·Î QT(Query Tree)¾Ë°í¸®ÁòÀ» »ç¿ëÇϴµ¥ º» ³í¹®¿¡¼´Â Ãæµ¹ºñÆ®À§Ä¡¸¦ ÀÌ¿ëÇÏ¿© °³¼±µÈ QT-MTC(Query Tree with Multi-Tag Cognition)¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. Á¦¾È ¾Ë°í¸®ÁòÀº Ãæµ¹ÀÌ ÀÏ¾î³ ºñÆ® ¼ö¿Í Ãæµ¹ÀÌ ¹ß»ýÇÑ ºñÆ® À§Ä¡¸¦ ½ºÅÿ¡ ÀúÀåÇÏ¿© Æ®¸®¸¦ ¼øȸÇϴ Ƚ¼ö¸¦ ÁÙ¿´°í, µÎ °³ÀÇ Å±׸¦ µ¿½Ã¿¡ ½Äº°ÇÒ ¼ö ÀÖµµ·Ï ¼³°èµÇ¾ú´Ù. ¼º´ÉºÐ¼® °á°ú QT ÇÁ·ÎÅäÄÝ¿¡ ºñ±³ÇÏ¿© Á¦¾È¾Ë°í¸®ÁòÀº ¿¬¼ÓµÈ ÅÂ±× ºñÆ®¿¡ ´ëÇØ ³ôÀº ¼º´É°³¼±È¿°ú¸¦ º¸¿´´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
RFID(Radio Frequency IDintification) leader is collision of data, when recognizing the multiple tag the inside area. This collision became the cause which delays the tag recognition time of the leader. The protocol which prevents the delay of tag recognition time of the leader the place where representative it uses QT(Query Tree) algorithms, it uses a collision bit position from this paper and are improved QT-MTC(Query Tree with Multi-Tag Cognition) algorithms which it proposes. This algorithm stored the bit position which bit possibility and the collision where the collision happens occurs in the stack and goes round a tree the number of time which, it reduced could be identified two tags simultaneously in order, it was planned. A result of performance analysis, It compared in QT protocols and the this algorithm against the tag bit which is continued a high efficiency improvement effect was visible.
|
Å°¿öµå(Keyword) |
RFID
Ãæµ¹¹æÁö
QT¾Ë°í¸®Áò
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|