• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.6
• /
• pp.999-1005
• /
• 2008

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.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.18 no.4 s.119
• /
• pp.398-407
• /
• 2007

In this paper we proposed the tag antenna with a low performance distortion from an attached surface material using the asymmetric dual-arm dipole antenna(ADDA) structure. The tag is designed to exhibit low performance changes when the tag is attached on a target object(the medical litter receptacle, ${\varepsilon}_r=1.7,\;tan\;{\delta}=0.002$). Detail design parameters for the proposed antenna are optimized to maintain a good readable range in free-space as well as on a target object. The size of the optimized antenna is $100\;mm{\times}50\;mm$. The antenna shows the matching bandwidth($S_{11}$< -10 dB) of 3.7 % and the radiation efficiency of 80 % at the operating frequency. Finally we confirmed the readable range of the tag antenna by measurement and it shows about 5.3 m in free space and 5.5 m on the target object.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.802-805
• /
• 2008

RFID 시스템에서 리더와 태그는 단일 무선 공유 채널을 갖기 때문에 RFID 수동형 태그를 위한 태그 충돌 중재가 태그 인식을 위한 중요한 이슈이다. 본 논문에서는 태그 충돌 방지를 위한 Improved Hybrid Query Tree algorithm 을 제안한다. 제안된 알고리즘은 쿼리 트리를 기반으로 태그가 리더에게 ID 를 전송하는 시점을 전송 ID 상위 3 비트 내의 '1' 값을 이용하여 결정한다. 또한 전송받은 Tag 의 상위 3 비트는 충돌이 발생하더라도 전송 슬롯에 따라 다르므로 제안한 알고리즘에서 예측이 가능하다. 시뮬레이션을 통한 성능 평가에서 다른 트리 기반 프로토콜에 비해 제안한 알고리즘이 쿼리 횟수에서 높은 성능을 갖는다는 것을 보여준다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.11
• /
• pp.25-32
• /
• 2007

In this paper, we propose the Group Separation Algorithm for RFID Tag Anti-Collision. We study the RFID Tag anti-collision technique of ALOHA and the anti-collision algorithm of binary search. The existing technique is several problems; the transmitted data rate included of data, the recognition time and energy efficiency. For distinction of all tags, the Group Separation algorithm identify each Tag_ID bit#s sum of bit #1#. In other words, Group Separation algorithm had standard of selection by collision table, the algorithm can reduce unnecessary number of search even than the exisiting algorithm. The Group Separation algorithm had performance test that criterions were reader#s number of repetition and number of transmitted bits for understanding tag. We showed the good performance of Group Separation algorithm better than exisiting algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.2
• /
• pp.422-429
• /
• 2007

Location awareness is one of the key functionalities to build an U-city. Recently, many of works of the location-aware systems are emerging to commercially apply to on-going large-scale apartment complex based on U-city. As dwellers or cars being attached with active tags are moving in the U-city complex, the active tags periodically broadcast their own identifiers and receivers fixed along the street or in building use those information to calculate location of them. There are several issues to be considered for such an environment. The first is that the number of active tags operating in the same region are large as much as tens of thousands, and the second is that the active tags should be alive without change of batteries more than a year, hence low power consumption is very important. In this paper we propose i) a new architecture for location-aware system considering such issues, ii) technical issues to implement it using active tags, and iii) a mathematical analytic model to investigate overall performance and verify it by comparing with actual experimental results. Through the analysis we can show the theoretical boundary of the lowest packet loss rate and the maximum number of tags with acceptable performance for the systems based on active tags. The results can be applied to practical design of location-based systems of U-City projects.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06d
• /
• pp.408-411
• /
• 2010

본 논문에서는 의약품, 음료수병 등 액체용기에 부착이 가능하며, 주변 유전체에 의한 성능열화가 적고 소형으로 바코드를 대신하여 용기에 부착이 가능한 플렉시블 RFID 특수태그 안테나를 제안하였다. 제안된 태그 안테나는 PET 기판 위에 미앤더 기법으로 제작되어 제작 및 대량 생산에 용이하며, 범용 RFID의 사용주파수 (860~960MHz)를 만족시키고, 주변 유전물의 영향으로 인한 성능변화를 최소화할 수 있도록 설계하였다. 제안된 태그 안테나는 본체 중앙부에 T 정합회로를 사용하고 미앤더 구조와 직선 구조의 보조선로 2개를 본체 상단에 삽입하여, 캐패시티브 결합을 이용해 태그칩과의 임피던스 공액정합이 쉽게 이루어지도록 하였다. 또한 2개의 보조선로가 각각 다른 부착물체의 유전율에 상호 보완적으로 전류를 유기시 키도록 하여 주변 유전 물질의 영향에 의한 반사손실을 만족하도록 하였다. 본 태그의 성능은 송신출력 20dBm, 안테나 이득 6dBi인 리더 안테나를 사용하였을 때 자유공간에서는 3.5m, 유리 부착 시 2.61m, 액체가 든 유리병 부착 시 2.51m 의 인식거리 성능을 보였다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.1
• /
• pp.19-25
• /
• 2012

In evaluating the performance of RFID systems, the tag anti-collision arbitration has been considered to be an important issue. For BT(Binary Tree) and ABS( Adaptive Binary Splitting) protocols, the so-called capture effect, which presumably happens frequently in the process of readers' receiving messages from multiple tags, can lead to some failures in detecting all tags in BT and ABS. In this paper, we propose a new anti-collision protocol, namely FTB (Feedback TagID with Binary splitting), which can solve the aforementioned problem and improve the performance.

• Electronics and Telecommunications Trends
• /
• v.29 no.5
• /
• pp.40-50
• /
• 2014

최근에 RFID(Radio Frequency Identification) 기술은 사물인터넷의 기반 기술로 다양한 애플리케이션의 개발과 함께 산업화/정보화에 크게 기여하고 있다. 그러나 산업에서 요구하는 RFID 태그, 리더의 요구사항이 단순한 인식뿐만 아니라 다양한 정보를 장기간 저장하고 관리할 목적으로 태그 메모리 크기가 확장되고 있으며, 해당 정보를 태그에 읽고 쓰기 위하여 간섭 잡음에 강한 신뢰성 있는 성능 향상 무선통신기술이 연구되고 있다. 본고에서는 RFID 태그-리더 간 고속으로 통신하는 기술과 다량의 태그 밀집 환경에서 RFID 인식률 향상을 위한 빔포밍 기술에 대하여 기술한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.565-568
• /
• 2005

RFID system allows contactless identification of objects, where small tags are attached to objects and information of objects are transferred using radio frequency. In recent years, industries have incorporated several identification systems to its production processes, which allow collecting automatically information about goods. In order to communicate with a single tag out of a group of tags, the target tag has to be identified. Therefore the read has to attempt to obtain the unique identification code of each tag within its read range. This paper presents performance results of QT and QT-sl protocols, which are tag identification protocols incorporating memoryless property. The memoryless property is that the current response of each tag only depends on the current query of the reader but not on the past history of the reader's queries.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8A
• /
• pp.794-804
• /
• 2008

In this paper, we analyze the performance of probabilistic slotted anti-collision algorithm used in EPCglobal Class-1 Generation-2 (Gen2). To increase throughput and system efficiency, and to decrease tag identification time and collision ratio, we propose new tag anti-collision algorithms, which are FAFQ (fired adjustable flamed Q) algorithm and AAFQ (adaptive adjustable framed Q) algorithm, by using QueryAdjust command. We also propose grouping method based on Gen2 to improve the efficiency of tag identification. The simulation results show that all the proposed algorithms outperform Q algorithm, and AAFQ algorithm performs the best. That is, AAFQ has an increment of 5% of system efficiency and a decrement of 4.5% of collision ratio. For FAFQ and AAFQ algorithm, the performance of grouping method is similar to that of ungrouping method. However, for Q algorithm in Gen2, grouping method can increase throughput and system efficiency, and decrease tag identification time and collision ratio compared with ungrouping method.