• 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 KIISE:Software and Applications
• /
• v.36 no.7
• /
• pp.560-570
• /
• 2009

RFID, Radio Frequency Identification, is a technology of automated identification replacing bar-code. RFID technology has advantages that it recognizes fast and it is strong to contamination using wireless communication. However, there are difficult problems that should be solved for popularization of RFID. Among of these, tag anti-collision problem is dealed in this paper. It affected the performance of RFID system directly. This paper analyzes conventional algorithms and proposes new algorithms of tag anti-collision. The algorithm proposed was composed of appropriate properties to each phase of distribution and recognition as hybrid between ALOHA-based algorithm and QT-based algorithm. At phase of distribution, the number of tags recognizing at a frame was reduced using ALOHA-based algorithm. It addressed the delay problem because of deep depth of tree. At phase of recognition, it solved ALOHA-based chronic problem that couldn't recognize all the tags sometimes. Moreover, QTR algorithm that recognize by reversed tag IDs was adopted for the performance. The FQTR algorithm proposed in this paper showed brilliant performance as compared with convention algorithms by simulation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.9
• /
• pp.29-37
• /
• 2004

In RFID system one of the problems that we must solve is to devise a good anti-collision algorithm to improve the efficiency of tag identification which is usually low because of tag collision. Among the existing RFID anti-collision algorithms, Framed Slotted ALOHA algorithm though simple, has a disadvantage that the number of slots used to identify the tags increases exponentially as the number of tags does. In the paper, we propose a new anti-collision algorithm called Partial-Response Framed Slotted ALOHA(PRFSA) which restricts the number of responding tags by dividing the tags into a number of groups when there are large number of tags and changes the frame size when there are small tags. Since the proposed algorithm keeps the frame size and the number of responding tags in such a way that can increase slot utilization, the algorithm shows superior performance to the existing ones. The simulation results showed that the proposed algorithm improves the slot efficiency by 85～100% compared to the existing algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9B
• /
• pp.1092-1097
• /
• 2011

An anti-collision protocol which tries to minimize the collision probability and identification time is the most important factor in all identification technologies. This paper focuses on methods to improve the efficiency of tag's process in identification systems. Our scheme, Binary Slotted Query Tree (BSQT) algorithm, is a memoryless protocol that identifies an object's ID more efficiently by removing the unnecessary prefixes of the traditional Query Tree (QT) algorithm. With enhanced QT algorithm, the reader will broadcast 1 bit and wait the response from the tags but the difference in this scheme is the reader will listen in 2 slots (slot 1 is for 0 bit Tags and slot 2 is for 1 bit Tags). Base on the responses the reader will decide next broadcasted bit. This will help for the reader to remove some unnecessary broadcasted bits which no tags will response. Numerical and simulation results show that the proposed scheme decreases the tag identification time by reducing the overall number of request.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.2 s.344
• /
• pp.27-38
• /
• 2006

When an RFID reader attempts to read tags, interference might occur if the neighboring readers also attempt to communicate with the same tag at the same time or the neighboring readers use the same frequency at the same time. These interferences cause the RFID reader collision. When the RFID reader collision occirs, either the command from the reader can not be transmitted to the tags or the response from the tags can not be received by the reader correctly. RFID reader anti-collision algorithms have been developed to reduce it. One of the best blown reader anti-collision algorithms is the Colorwave algorithm proposed by MIT. The Colorwave algorithm reduces the reader collisions by having the readers operate at different times. In Colorwave the time is divided into frames and a frame is divided into a number of slots. Each reader can access the tags using the slot time assigned to it. Depending on the probability of the interference, the colorwave adjusts the frame size to improve the efficiency. In this paper, we analyze the operations and the performance of the Colorwave algorithm and identify the problems of the algorithm. We also show that by adding some modifications to the algorithm the performance can be improved significantly.

• Journal of Mechanical Science and Technology
• /
• v.19 no.2
• /
• pp.505-519
• /
• 2005

In this paper, we develop an anti-sway control in proposed techniques for an ATC system. The developed algorithm is to build the optimal path of container motion and to calculate an anti-collision path for collision avoidance in its movement to the finial coordinate. Moreover, in order to show the effectiveness in this research, we compared NNP PID controller to be tuning parameters of controller using NN with 2 DOF PID controller. The simulation and experimental results show that the proposed control scheme guarantees performances, trolley position, sway angle and settling time in NNP PID controller than other controller. As the results in this paper, the application of NNP PID controller is analyzed to have robustness about disturbance which is wind of fixed pattern in the yard. Accordingly, the proposed algorithm in this study can be readily used for industrial applications.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.98-98
• /
• 2004

• Proceedings of the Korea Multimedia Society Conference
• /
• 2004.05a
• /
• pp.425-428
• /
• 2004

최근 각광을 받고 있는 RFID는 재고와 제조 유통분야를 중심으로 발전해 오던 바코드를 대체하여 물류유통의 혁명을 초래할 기술로 주목 받고 있다. 그러나 국내의 RFID에 대한 기술 및 자본의 투자는 해외에 비해 미흡한 실정이다. RFID 시스템에서 하나의 인터러게이터 영역에 다수의 트랜스 폰더가 동시에 데이터를 전송하게 되어 데이터 충돌이 발생하게 된다. 본 논문에서는 인터러게이터에서 각 트랜스폰더의 상호 충돌로부터 신뢰성 있게 데이터를 보호하고 해독이 가능하도록 하는 여러 충돌 방지 시스템에 대해서 알아본다.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.10 no.4
• /
• pp.141-148
• /
• 2002

Repair were made for front pillar, center pillar and side-step panel for lightweight vehicles with head-on and 40% off-set collision of 15 km/h in a RCAR standard. The salt dilution was sprayed and the compression tests were performed for vehicles with and without anti-corrosional treatment after repair. After 764 hours of salt-dilt sprayed test without using anti-corrosion, the mean penetration depth fur corrosion was shown to be 58% of the thickness. The resulyed decrease in bending stiffness by 10∼20% can cause reduction of the residual life and crash-absorption capability for damaged vehicles. The corrosoin safety tests showed that the anti-corrosional treatment should be made to improve the safety characteristics for a or damaged car.

• The KIPS Transactions:PartA
• /
• v.16A no.4
• /
• pp.289-298
• /
• 2009

Generally, RFID systems are composed of one reader and several passive tags, and share the single wireless channel. For this reason, collisions occurwhen more than two tags simultaneously respond to the reader's inquiry. To achieve this problem, many papers, such as QT[8], HCT[10], BSCTTA[2], and QT-BCS[9], have been proposed. In this paper, we propose the tree-based anti-collision algorithm using a bit change sensing unit (TABCS) based on BSCTTA algorithm. The proposed algorithm can identify bits returned from tags through bit change sensing unit, even if multi collisions occur. So, it rapidly generates the unique prefix to indentify each tag, and reduce the total of bits. As the result, the cost of identifying all tag IDs is relatively reduced as compared with existing algorithms. It is verified through simulations that the proposed algorithm surpass other existing algorithms.