Á¤º¸°úÇÐȸ ³í¹®Áö I : Á¤º¸Åë½Å
ÇѱÛÁ¦¸ñ(Korean Title) |
RFID ½Ã½ºÅÛ¿¡¼ Ãæµ¹ Æ®¸® ±â¹Ý Ãæµ¹¹æÁö ¾Ë°í¸®Áò |
¿µ¹®Á¦¸ñ(English Title) |
Collision Tree Based Anti-collision Algorithm in RFID System |
ÀúÀÚ(Author) |
¼Çö°ï
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 34 NO. 05 PP. 0316 ~ 0327 (2007. 10) |
Çѱ۳»¿ë (Korean Abstract) |
RFID´Â RF½ÅÈ£¸¦ ÀÌ¿ëÇÏ¿© ¹°Ã¼¸¦ ½Äº°ÇÏ´Â °¡Àå À¯¸ÁÇÑ ¹Ì·¡ÀÇ ºñÁ¢ÃË ±â¼úÀÌ´Ù. RFID ¸®´õÀÇ ½Äº°¿µ¿ª¿¡ ¿©·¯ °³ÀÇ Å±װ¡ ÀÖ´Â °æ¿ì, ¸®´õÀÇ ÁúÀÇ¿¡ ´ëÇÏ¿© ¸ðµç ű׵éÀÌ µ¿½Ã¿¡ ÀÀ´äÀ» Çϱ⠶§¹®¿¡ Ãæµ¹ÀÌ ¹ß»ýµÇ¾î ű׸¦ ½Äº°ÇÒ ¼ö ¾ø°Ô µÈ´Ù. RFID¿¡¼ ´ÙÁß ÅÂ±× ½Äº°¹®Á¦´Â ¾ÆÁÖ Áß¿äÇÑ Çٽɱâ¼ú·Î ÀÌ°ÍÀ» ÇØ°áÇϱâ À§ÇØ ½½·Ô±â¹Ý ¾Ë·ÎÇÏ ¾Ë°í¸®Áò, Æ®¸® ±â¹Ý ¾Ë°í¸®Áò µî°ú °°Àº Ãæµ¹ ¹æÁö ¾Ë°í¸®ÁòÀÌ Á¦¾ÈµÇ¾ú´Ù. º» ³í¹®¿¡¼´Â RFID ½Ã½ºÅÛ¿¡¼ Ãæµ¹ Æ®¸®¸¦ ÀÌ¿ëÇÑ Ã浹Ʈ¸® ±â¹Ý Ãæµ¹ ¹æÁö¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. Á¦¾ÈÇÏ´Â ¹æ¹ýÀº È¿°úÀûÀÎ Ãæµ¹ ¹æÁö ¸ÞÄ¿´ÏÁòÀ» Á¦°øÇÏ¸ç ¸Þ¸ð¸®·¡½º ¾Ë°í¸®ÁòÀÌ´Ù. Á¦¾ÈÇÏ´Â Ã浹Ʈ¸®´Â ´ÙÁß ÅÂ±× ½Äº°¹®Á¦¸¦ ÇØ°áÇϱâ À§ÇÑ ¸ÞÄ¿´ÏÁòÀ¸·Î ¸®´õ¿Í ű׻çÀÌ ÁúÀÇ¿Í ÀÀ´ä°úÁ¤¿¡¼ ¸¸µé¾î Áø´Ù. ¸®´õ°¡ k ºñÆ®·Î ±¸¼ºµÈ ÇÁ¸®ÇȽº¸¦ ÁúÀÇÇϸé, ű״ ÀÚ½ÅÀÇ ½Äº°ÀÚ¿Í ÇÁ¸®ÇȽº¸¦ ºñ±³ÇÏ¿© ÀÏÄ¡ÇÒ °æ¿ì ½Äº°ÀÚÀÇ K+1 ºñÆ®¿¡¼ ¸¶Áö¸· ºñÆ®±îÁö ¸®´õ¿¡°Ô Àü¼ÛÇÑ´Ù. ½Ã¹Ä·¹ÀÌ¼Ç °á°ú¿¡ µû¶ó Á¦¾ÈÇÏ´Â Ãæµ¹ Æ®¸® ±â¹Ý Ãæµ¹ ¹æÁö ¾Ë°í¸®ÁòÀÌ ±âÁ¸ÀÇ Æ®¸® ¿öÅ· ¾Ë°í¸®ÁòÀ̳ª Äõ¸® Æ®¸® ¾Ë°í¸®Áòº¸´Ù ÁÁÀº ¼º´ÉÀ» º¸ÀÓÀ» ¾Ë ¼ö ÀÖ´Ù. |
¿µ¹®³»¿ë (English Abstract) |
RFID (Radio Frequency Identification) is one of the most promising air interface technologies in the future for object identification using radio wave. If there are multiple tags within the range of the RFID tag reader, all tags send their tag identifications to the reader at the same time in response to the reader's query. This causes collisions on the reader and no tag is identified. A multi-tag identification problem is a core issue in the RFID. It can be solved by anti-collision algorithm such as slot based ALHOA algorithms and tree based algorithms. This paper, proposes a collision tree based anti-collision algorithm using collision tree in RFID system. It is a memory-less algorithm and is an efficient RFID anti-collision mechanism. The collision tree is a mechanism that can solve multi-tag identification problem. It is created in the process of querying and responding between the reader and tags. If the reader broadcasts K bits of prefix to multiple tags, all tags with the identifications matching the prefix transmit the reader the identifications consisted of k 1 bit to last. According to the simulation result, a proposed collision tree based anti-collision algorithm shows a better performance compared to tree working algorithm and query tree algorithm. |
Å°¿öµå(Keyword) |
RFID
Ãæµ¹¹æÁö ¾Ë°í¸®Áò
Æ®¸®±â¹Ý ¾Ë°í¸®Áò
Ãæµ¹ Æ®¸®
Anti-collision algorithm
tree based algorithm
collision tree
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|