• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.5
• /
• pp.20-27
• /
• 2007

In this paper, Air-interface protocols of ISO 18000-6 Type A and B applied to RFID system in UHF band are analyzed, and those algorithms are realized. Also, the improved anticollision algorithms for the Type A and B of ISO 18000-6 protocol are proposed and the performances are compared. As the results, reduction ratio of total tag recognition time of the improved ISO 18000-6 Type A algorithm is 35.2 % for 100 tags and 24.3% for 1000 tags with respect to standard algorithm, respectively. And the reduction ratio of the improved ISO 18000-6 Type B algorithm is 6.0% for 100 tags and 6.6% for 1000 tags. Therefore, the improved anticollision algorithm proposed in this paper is the advanced method improving the performance of tag recognition in the RFID system.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.11a
• /
• pp.434-437
• /
• 2006

Today, Hospital Information System that integrates ubiquitous technologies are introduced in limited basis due to problems like standardization and limits on medical use, where responsibilities lie, legal safeguard on transmission, invasion of privacy etc. Particularly, problems like absence of tag design suitable for medical environment, compatibility issue with previous medical information system. In order to solve such problems, we have designed medical tags for the first time that are consistent with future ubiquitous environment by deciding on medically suitable field with 96bit tag offered by EFC as its base. Second, improving on previous multi-tag recognizing crash prevention algorithm, we have designed a priority anti-collision algorithm that reflects priorities on the needs in medical environment.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.48-55
• /
• 2009

In this paper, We propose Adaptive Group Separation algorithm for efficient RFID system AGS algorithm determines the optimized initial prefix size j, and divides the group of. A reader requests the group and searches the tag ID. If a tag collision occurred, reader adds a one bit, '0' or '1' at first bit of collision point, As a result we observe that transmitted data bits and the recognition time are decreased. The proposed algorithms have been verified by computer simulation. The performance of the proposed anti-collision algorithm is evaluated in terms of the number of repetitions and the amount of transmission bits according to the in crease of the number of tags is 256. The AGS algorithm improve the number of repetitions by about 32.3% and reduce tile amount of the transmission bits by about 1/40 than slotted binary tree algorithm.

• 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.

• Journal of Internet Computing and Services
• /
• v.14 no.4
• /
• pp.25-33
• /
• 2013

The procedure of the arbitration which is the tag collision is essential because the multiple tags response simultaneously in the same frequency to the request of the Reader. This procedure is known as Anti-collision and it is a key technology in the RFID system. In this paper, we propose the 4-Bit Pattern Slot Allocation(4-BPSA) algorithm for the high-speed identification of the multiple tags. The proposed algorithm is based on the tree algorithm using the time slot and identify the tag quickly and efficiently through accurate prediction using the a slot as a 4-bit pattern according to the slot allocation scheme. Through mathematical performance analysis, We proved that the 4-BPSA is an O(n) algorithm by analyzing the worst-case time complexity and the performance of the 4-BPSA is improved compared to existing algorithms. In addition, we verified that the 4-BPSA is performed the average 0.7 times the query per the Tag through MATLAB simulation experiments with performance evaluation of the algorithm and the 4-BPSA ensure stable performance regardless of the number of the tags.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4A
• /
• pp.358-364
• /
• 2007

RFID, Radio Frequency Identification, technology is a contactless automatic identification technology using radio frequency. For this RFID technology to be widely spread, the problem of multiple tag identification, which a reader identifies a multiple number of tags in a very short time, has to be solved. Up to the present, many anti-collision algorithms have been developed in order to solve this problem, and those can be largely divided into ALOHA based algorithm and tree based algorithm. In this paper, two new anti-collision algorithms combining the characteristics of these two categories are presented. And the performances of the two algorithms are compared and evaluated in comparison with those of typical anti-collision algorithms: 18000-6 Type A, Type B, Type C, and query tree algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.126-134
• /
• 2000

Version control is an application to maintain consistency between different instances of the same document allowing operations such as navigation, differencing, and merging. Most version control systems, however, lack the support of functionality for cooperative writing environment, such as to represent and store the history of the actions of different individuals, to effectively differentiate and merge the individual actions including the text object, and to manage different access privileges for different granularity and individuals. With the help of Activity IDentification (AID) tag and its unique addressing scheme proposed in this paper, differencing and merging become simple and effective. Access and role control is improved by associating the access right table and role assignment in AID scheme also eliminates the requirements for large storage capacity for version information maintenance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.563-566
• /
• 2008

In RFID system. when a variety of tags are present in the interrogation zone of a single reader at the same time, the system requires a multiple tag identification scheme that allows the reader to read data from the individual tags. Anti-collision algorithms required for the multiple tag identification are essential for the implementation of RFID system. This paper analyzed the performance of SFSA algorithm, which is easy to implement. According to the analytical results, the algorithm's performances are closely related with the number of tags and the frame size.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.491-494
• /
• 2005

In this paper, a QT_rev protocol is proposed for identifying all the tags within the identification range. The proposed QT_rev protocol revises the QT protocol, which has a memoryless property. In the QT_rev protocol, the tag will send the remaining bits of their identification codes when the query string matches the first bits of their identification codes. After the reader receives all the responses of the tags, it knows which bit is collided. If the collision occurs in the last bit, the reader can identify two tags simultaneously without further query.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.55-57
• /
• 2006

최근 국내 표준의 확정과 함께 새로운 수익모델로써 다양한 분야에서 활용이 기대가 되는 RFID 무선인식 시스템은 국내의 많은 업체와 기관들이 현재 다양한 솔루션을 개발함으로써 다가오는 유비쿼터스 환경에 적극 대응하고 있다. RFID 시스템의 중요한 기술요소 중 하나는 다중 태그로 인한 충돌을 처리하는 Anti-collision 알고리즘이다. 본 논문에서는 먼저 충돌방지기법의 종류와 최근에 900MHz대역의 RFID 표준으로 확정된 ISO/IEC 18000-6 Type C 표준문서에서 소개한 Slotted random 충돌방지 알고리즘을 분석하고, 충돌 정도에 따라 적응적으로 다음 프레임의 크기를 조정하는 기법을 제안한다. 모든 태그를 완전히 읽어내는데 걸리는 시간을 계산하기 위해서 Type C 표준을 적용한 모의실험을 통해 성능평가를 하였다.